6978 search results - page 212 / 1396 » On Proofs in System P |
174
click to vote
APAL
2008
15 years 6 months ago
2008
We develop and study the complexity of propositional proof systems of varying strength extending resolution by allowing it to operate with disjunctions of linear equations instead ...
170
click to vote
ICLP
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
154
click to vote
ICFEM
2007
Springer
16 years 22 days ago
2007
Springer
Simulink is popular in industry for modeling and simulating embedded systems. It is deficient to handle requirements of high-level assurance and timing analysis. Previously, we sh...
179
click to vote
ASIAN
2006
Springer
15 years 10 months ago
2006
Springer
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
139
click to vote
CIE
2008
Springer
15 years 8 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...