Automatic termination proofs for programs with shape-shifting heaps

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

Volumn 4144 LNCS, Issue , 2006, Pages 386-400

  Berdine, Josh ^a   Cook, Byron ^a   Distefano, Dino ^b   O'Hearn, Peter W ^a,b  

^a MICROSOFT RESEARCH   (United States)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER OPERATING SYSTEMS; COMPUTER VIRUSES; FINITE AUTOMATA; FORMAL LOGIC; PROGRAM INTERPRETERS;

IMPERATIVE PROGRAMS; PROGRAM TERMINATION ANALYSIS; SHAPE SHIFTING HEAPS; WINDOWS DEVICE DRIVERS;

COMPUTER PROGRAMMING;

EID: 33749858392     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11817963_35     Document Type: Conference Paper

References (16)

1. J. Berdine, C. Calcagno, and P. O'Hearn. Symbolic execution with separation logic. In APLAS, 2005.
2. A. Bradley, Z. Manna, and H. Sipma. Termination of polynomial programs. In VMCAI, 2005.
3. B. Cook, A. Podelski, and A. Rybalchenko. Abstraction refinement for termination. In SAS, 2005.
4. B. Cook, A. Podelski, and A. Rybalchenko. Termination proofs for systems code. In PLDI, 2006.
5. B. Cook, A. Podelski, and A. Rybalchenko. Terminator: Beyond safety. In CAV, 2006.
6. D. Distefano, J.-P. Katoen, and A. Rensink. Who is pointing when to whom? on the automated verification of linked list structures. In FSTTCS, 2004.
7. D. Distefano, P. W. O'Hearn, and H. Yang. A local shape analysis based on separation logic. In TAC AS, 2006.
8. N. Dor, M. Rodeh, and S. Sagiv. Checking cleanness in linked lists. In SAS, 2000.
9. R. W. Floyd. Assigning meanings to programs. In Proceedings of Symposia in Applied Mathematics, 1967.
10. C. S. Lee, N. D. Jones, and A. M. Ben-Amram. The size-change principle for program termination. In POPL, 2001.
11. A. Podelski and A. Rybalchenko. A complete method for the synthesis of linear ranking functions. In VMCAI, 2004.
12. A. Podelski and A. Rybalchenko. Transition invariants. In LICS, 2004.
13. A. Podelski and A. Rybalchenko. Transition predicate abstraction and fair termination. In POPL, 2005.
14. J. Reynolds. Separation logic: A logic for shared mutable data structures. In LICS, 2002.
15. E. Yahav. Property-Guided Verification of Concurrent Heap-Manipulating Programs. PhD thesis, 2004.
16. E. Yahav, T. Reps, M. Sagiv, and R. Wilhelm. Verifying temporal heap properties specified via evolution logic. In ESOP, 2003.