Cyclic proofs of program termination in separation logic

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2008, Pages 101-112

  Brotherston, James ^a   Bornat, Richard ^b   Calcagno, Cristiano ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b MIDDLESEX UNIVERSITY   (United Kingdom)

Author keywords

cyclic proof; hoare logic; inductive definitions; program verification; separation logic; termination

Indexed keywords

CYCLIC PROOF; HOARE LOGIC; INDUCTIVE DEFINITIONS; PROGRAM VERIFICATION; SEPARATION LOGIC; TERMINATION;

COMPUTER PROGRAMMING LANGUAGES; INFORMATION RETRIEVAL;

FORMAL LOGIC;

EID: 84865639148     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1328438.1328453     Document Type: Conference Paper

References (25)

1. Peter Aczel. An introduction to inductive definitions. In Jon Barwise, editor, Handbook of Mathematical Logic, pages 739-782. N-H, 1977.
2. Amir M. Ben-Amram and Chin Soon Lee. Ranking functions for size change termination II. Presented at (Hofbauer and Serebrenik 2007), 2007.
3. J. Berdine, C. Calcagno, and P.W. O'Hearn. Symbolic execution with separation logic. In APLAS 2005, volume 3780 of LNCS, pages 52-68, 2005.
4. J. Berdine, C. Calcagno, and P.W. O'Hearn. Smallfoot: Automatic modular assertion checking with separation logic. In FMCO, volume 4111 of LNCS, pages 115-137, 2006a.
5. J. Berdine, B. Cook, D. Distefano, and P. O'Hearn. Automatic termination proofs for programs with shape-shifting heaps. In CAV, volume 4144 of LNCS, pages 386-400, 2006b.
6. J. Berdine, A. Chawdhary, B. Cook, D. Distefano, and P. O'Hearn. Variance analyses from invariance analyses. In 34th POPL, 2007.
7. Richard Bornat, Cristiano Calcagno, and Peter O'Hearn. Local reasoning, separation and aliasing. In SPACE Workshop, 2004.
8. James Brotherston. Cyclic proofs for first-order logic with inductive definitions. In B. Beckert, editor, TABLEAUX 2005, volume 3702 of LNAI, pages 78-92. Springer-Verlag, 2005.
9. James Brotherston. Formalised inductive reasoning in the logic of bunched implications. In SAS-14, volume 4634 of LNCS, pages 87-103. Springer-Verlag, August 2007.
10. James Brotherston. Sequent Calculus Proof Systems for Inductive Definitions. PhD thesis, University of Edinburgh, November 2006.
11. James Brotherston and Alex Simpson. Complete sequent calculi for induction and infinite descent. In LICS-22, pages 51-60. IEEE Computer Society, July 2007.
12. C. Calcagno, D. Distefano, P.W. O'Hearn, and H. Yang. Beyond reachability: Shape abstraction in the presence of pointer arithmetic. In SAS, volume 4134 of LNCS, pages 182-203, 2006.
13. D. Distefano, P. O'Hearn, and H. Yang. A local shape analysis based on separation logic. In TACAS, volume 3920 of LNCS, pages 287-302, 2006.
14. Bolei Guo, Neil Vachharajani, and David I. August. Shape analysis with inductive recursion synthesis. In PLDI, June 2007.
15. Dieter Hofbauer and Alexander Serebrenik. The 9th international workshop on termination. Paris, France, 2007.
16. Chin Soon Lee, Neil D. Jones, and Amir M. Ben-Amram. The size-change principle for program termination. In 28th POPL, 2001.
17. O. Lee, H. Yang, and K. Yi. Automatic verification of pointer programs using grammar-based shape analysis. In ESOP, volume 3444 of LNCS, pages 124-140, 2005.
18. Per Martin-Löf. Haupstatz for the intuitionistic theory of iterated inductive definitions. In J.E. Fenstad, editor, Proceedings of the Second Scandinavian Logic Symposium, pages 179-216. N-H, 1971.
19. P. W. O'Hearn and D. J. Pym. The logic of bunched implications. Bulletin of Symbolic Logic, 5(2):215-244, June 99.
20. J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In LICS, pages 55-74, 2002.
21. A. Rybalchenko, B. Cook, and A. Podelski. Termination proofs for systems code. In PLDI, pages 415-426, 2006.
22. Ulrich Schöpp and Alex Simpson. Verifying temporal properties using explicit approximants: Completeness for context-free processes. In FoSSaCS 2002, volume 2303 of LNCS, pages 372-386. Springer-Verlag, 2002.
23. Christoph Sprenger and Mads Dam. On the structure of inductive reasoning: circular and tree-shaped proofs in the μ-calculus. In FOSSACS 2003, volume 2620 of LNCS, pages 425-440, 2003.
24. N. Torp-Smith, L. Birkedal, and J. Reynolds. Local reasoning about a copying garbage collector. In POPL, pages 220-231, 2004.
25. H. Yang and P. O'Hearn. A semantic basis for local reasoning. In 5th FOSSACS, LNCS 2303, 2002.