A Local Shape Analysis Based on Separation Logic

  • Dino Distefano
  • Peter W. O’Hearn
  • Hongseok Yang
Conference paper

DOI: 10.1007/11691372_19

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3920)
Cite this paper as:
Distefano D., O’Hearn P.W., Yang H. (2006) A Local Shape Analysis Based on Separation Logic. In: Hermanns H., Palsberg J. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2006. Lecture Notes in Computer Science, vol 3920. Springer, Berlin, Heidelberg

Abstract

We describe a program analysis for linked list programs where the abstract domain uses formulae from separation logic.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Dino Distefano
    • 1
  • Peter W. O’Hearn
    • 1
  • Hongseok Yang
    • 2
  1. 1.Queen MaryUniversity of LondonUK
  2. 2.Seoul National UniversitySouth Korea

Personalised recommendations