Josh Berdine, Byron Cook, Dino Distefano, and Peter W. O'Hearn Microsoft...  Home/Search
Context Related
| foment.net/byron/papers/mutant.pdf Cached: PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PS.gz PS Image Update HelpFrom: microsoft.com/~bycook/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe a new program termination analysis designed to handle imperative programs whose termination depends on the mutation of the program's heap. We first describe how an abstract interpretation can be used to construct a finite number of relations which, if each is well-founded, implies termination. We then give an abstract interpretation based on separation logic formul which tracks the depths of pieces of heaps. Finally, we combine these two techniques to produce an automatic... (Update)
Cited by: More
Proving That Programs Eventually Do Something Good - Ron Cook Microsoft (Correct)
Interprocedural Shape Analysis with Separated Heap.. - Gotsman, Berdine, Cook (Correct)
Active bibliography (related documents): More All
1.2: Terminator: Beyond Safety - Ron Cook Andreas (2006) (Correct)
0.9: Termination Proofs for Systems Code - Ron Cook Microsoft (2006) (Correct)
0.7: Abstraction Refinement for Termination - Ron Cook Andreas (2005) (Correct)
Similar documents based on text:
6.0: Unknown - (Correct)
BibTeX entry: (Update)
J. Berdine, B. Cook, D. Distefano, and P. W. O'Hearn. Automatic termination proofs for programs with shape-shifting heaps. In CAV, 2006. http://citeseer.ist.psu.edu/berdine06automatic.html More
@misc{ berdine06automatic,
author = "J. Berdine and B. Cook and D. Distefano and P. O'Hearn",
title = "Automatic termination proofs for programs with shape-shifting heaps",
text = "J. Berdine, B. Cook, D. Distefano, and P. W. O'Hearn. Automatic termination
proofs for programs with shape-shifting heaps. In CAV, 2006.",
year = "2006",
url = "citeseer.ist.psu.edu/berdine06automatic.html" }
Citations (may not include all citations):223 Assigning meanings to programs (context) - Floyd - 1967
111 Separation logic: A logic for shared mutable data structures - Reynolds - 2002
25 The size-change principle for program termination - Lee, Jones et al. - 2001
22 Checking cleanness in linked lists - Dor, Rodeh et al. - 2000
8 Verifying temporal heap properties specified via evolution l.. - Yahav, Reps et al. - 2003
7 A complete method for the synthesis of linear ranking functi.. (context) - Podelski, Rybalchenko - 2004
7 Transition invariants (context) - Podelski, Rybalchenko - 2004
6 Who is pointing when to whom (context) - Distefano, Katoen et al. - 2004
6 Symbolic execution with separation logic - Berdine, Calcagno et al. - 2005
5 A local shape analysis based on separation logic - Distefano, O'Hearn et al. - 2006
5 Termination of polynomial programs (context) - Bradley, Manna et al. - 2005
4 Termination proofs for systems code - Cook, Podelski et al. - 2006
4 Abstraction refinement for termination - Cook, Podelski et al. - 2005
4 Transition predicate abstraction and fair termination (context) - Podelski, Rybalchenko - 2005
2 Terminator: Beyond safety - Cook, Podelski et al. - 2006
1 Property-Guided Verification of Concurrent Heap-Manipulating.. (context) - Yahav - 2004
Documents on the same site (http://research.microsoft.com/~bycook/papers.htm): More
Cogent: Accurate theorem proving for program verification - Cook, Kroening, Sharygina (2005) (Correct)
Interprocedural Shape Analysis with Separated Heap.. - Gotsman, Berdine, Cook (Correct)
Refining Approximations in Software Predicate Abstraction - Ball, Cook, Das, Rajamani (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC