1274 search results - page 33 / 255 » New Proofs for |
CAV
2011
Springer
12 years 11 months ago
2011
Springer
Abstract. Quantified Boolean formulae (QBF) allow compact encoding of many decision problems. Their importance motivated the development of fast QBF solvers. Certifying the result...
ICFP
2006
ACM
14 years 7 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
ISORC
2005
IEEE
14 years 1 months ago
2005
IEEE
Web Services emerge as a new paradigm for distributed computing. Model checking is an important verification method to ensure the trustworthiness of composite WS. abstraction and...
LICS
1999
IEEE
13 years 12 months ago
1999
IEEE
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
CSR
2009
Springer
13 years 11 months ago
2009
Springer
In this paper we investigate the following two questions: Q1: Do there exist optimal proof systems for a given language L? Q2: Do there exist complete problems for a given promise ...