A local shape analysis based on separation logic

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3920 LNCS, Issue , 2006, Pages 287-302

  Distefano, Dino ^a   O'Hearn, Peter W ^a   Yang, Hongseok ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

FORMULAE; PROGRAM ANALYSIS; SEPARATION LOGIC;

ABSTRACTING; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER PROGRAM LISTINGS; COMPUTER SYSTEMS PROGRAMMING;

FORMAL LOGIC;

EID: 33745765468     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691372_19     Document Type: Conference Paper

References (17)

1. T. Amtoft, S. Bandhakavi, and A. Banerjee. A logic for information flow analysis of pointer programs. 33rd POPL, to appear, 2006.
2. T. Amtoft and A. Banerjee. Information flow analysis in logical form, 11th Static Analysis Symposium, LNCS3184, pp100-115, 2004.
3. T. Ball, A. Podelski, and S. K. Rajamani. Boolean and Cartesian abstraction for model checking C programs. 7th TACAS, LNCS, 2031:268-283, 2001.
4. J. Berdine, C. Calcagno, and P. O'Hearn. A decidable fragment of separation logic. Proceedings of FSTTCS, LNCS 3328, Chennai, December, 2004.
5. Josh Berdine, Cristiano Calcagno, and Peter W. O'Hearn. Symbolic execution with separation logic. In K. Yi, editor, APLAS 2005, volume 3780 of LNCS, 2005.
6. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. 4th ACM Symposium on Principles of Programming Languages, pages 238-252, 1977.
7. D. Distefano. On model checking the dynamics of object-based software: a foundational approach. PhD thesis, University of Twente, 2003.
8. D. Distefano, A. Rensink, and J.-P. Katoen. Who is pointing when to whom: on model-checking pointer structures. CTIT Technical Report TR-CTIT-03-12, Faculty of Informatics, University of Twente, March 2003.
9. S. Magill, A. Nanevski, E. Clarke, and P. Lee. Inferring invariants in Separation Logic for imperative list-processing programs. Draft, July 2005, 2005.
10. R. Manevich, E. Yahav, G. Ramalingam, and S. Sagiv. Predicate abstraction and canonical abstraction for singly-linked lists. Proceedings of 6th VMCAI, pp181-198, 2005.
11. P. O'Hearn. Resources, concurrency and local reasoning. Theoretical Computer Science, 2006. to appear. Preliminary version appeared in CONCUR'04, LNCS 3170, 49-67.
12. P. O'Hearn, J. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In Proc. of 15th CSL, LNCS, pages 1-19. Springer-Verlag, 2001.
13. P. W. O'Hearn, H. Yang, and J. C. Reynolds. Separation and information hiding. In 31st POPL, pages 268-280, 2004.
14. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In 17th LICS, pp 55-74, 2002.
15. N. Rinetzky, J. Bauer, T. Reps, S. Sagiv, and R. Wilhelm. A semantics for procedure local heaps and its abstractions. 32nd POPL, pp296-309, 2005.
16. N. Rinetzky, M. Sagiv, and E. Yahav. Interprocedural shape analysis for cutpointfree programs. In 12th International Static Analysis Symposium (SAS), 2005.
17. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via Svalued logic. ACM Trans. Program. Lang. Syst., 24(3):217-298, 2002.