Sciweavers

347 search results - page 12 / 70
» From Separation Logic to First-Order Logic
Sort
View
APAL
2010
123views more  APAL 2010»
13 years 7 months ago
Cut elimination and strong separation for substructural logics: An algebraic approach
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
Nikolaos Galatos, Hiroakira Ono
ITP
2010
161views Mathematics» more  ITP 2010»
13 years 11 months ago
Separation Logic Adapted for Proofs by Rewriting
We present a formalisation of separation logic which, by avoiding the use of existential quantifiers, allows proofs that only use standard equational rewriting methods as found in...
Magnus O. Myreen
APLAS
2005
ACM
14 years 1 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
ECOOP
2009
Springer
14 years 8 months ago
Implicit Dynamic Frames: Combining Dynamic Frames and Separation Logic
The dynamic frames approach has proven to be a powerful formalism for specifying and verifying object-oriented programs. However, it requires writing and checking many frame annota...
Jan Smans, Bart Jacobs 0002, Frank Piessens
FAC
2010
93views more  FAC 2010»
13 years 4 months ago
Inter-process buffers in separation logic with rely-guarantee
Separation logic allows simple proofs of concurrent algorithms which use blocking mechanisms such as semaphores. It can even deal with non-blocking algorithms. With the addition of...
Richard Bornat, Hasan Amjad