Symbolic Execution with Separation Logic

  • Josh Berdine
  • Cristiano Calcagno
  • Peter W. O’Hearn
Conference paper

DOI: 10.1007/11575467_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3780)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Josh Berdine
    • 1
  • Cristiano Calcagno
    • 2
  • Peter W. O’Hearn
    • 1
  1. 1.Queen MaryUniversity of London 
  2. 2.Imperial CollegeLondon

Personalised recommendations