Symbolic Execution with Separation Logic
- Cite this paper as:
- Berdine J., Calcagno C., O’Hearn P.W. (2005) Symbolic Execution with Separation Logic. In: Yi K. (eds) Programming Languages and Systems. APLAS 2005. Lecture Notes in Computer Science, vol 3780. Springer, Berlin, Heidelberg
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 uses a form of symbolic execution, a decidable proof theory for symbolic heaps, and extraction of frame axioms from incomplete proofs. This is a precursor to the use of the logic in automatic specification checking, program analysis, and model checking.
Unable to display preview. Download preview PDF.