Sciweavers

361 search results - page 12 / 73
» Analytic Methods for the Logic of Proofs
Sort
View
84
Voted
APLAS
2005
ACM
15 years 5 months ago
Symbolic Execution with Separation Logic
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
Josh Berdine, Cristiano Calcagno, Peter W. O'Hearn
83
Voted
JSYML
2011
84views more  JSYML 2011»
14 years 6 months ago
On the non-confluence of cut-elimination
Abstract. Westudy cut-elimination in first-orderclassical logic. Weconstructa sequenceofpolynomiallength proofs having a non-elementary number of different cut-free normal forms....
Matthias Baaz, Stefan Hetzl
91
Voted
AICOM
2010
127views more  AICOM 2010»
14 years 11 months ago
Interactive verification of concurrent systems using symbolic execution
This paper presents an interactive proof method for the verification of temporal properties of concurrent systems based on symbolic execution. Symbolic execution is a well known a...
Simon Bäumler, Michael Balser, Florian Nafz, ...
189
Voted
POPL
2007
ACM
15 years 12 months ago
Modular verification of a non-blocking stack
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
Matthew J. Parkinson, Richard Bornat, Peter W. O'H...
106
Voted
LMCS
2006
126views more  LMCS 2006»
14 years 11 months ago
The Completeness of Propositional Resolution: A Simple and Constructive Proof
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing tha...
Jean H. Gallier