Skip to main content
Article thumbnail
Location of Repository

Symbolic execution with separation logic

By Josh Berdine, Cristiano Calcagno, Peter W. O’hearn and Queen Mary

Abstract

Abstract. 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.

Publisher: Springer
Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.2880
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.doc.ic.ac.uk/~ccris... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.