Automatic termination proofs for programs with shape-shifting heaps

Authors:
Josh Berdine;Byron Cook;Dino Distefano;Peter W. O'Hearn
Affiliations:
Microsoft Research;Microsoft Research;Queen Mary, University of London;,Microsoft Research
Venue:
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Year:
2006

Citing 14
Cited 45

The size-change principle for program termination

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Checking Cleanness in Linked Lists

SAS '00 Proceedings of the 7th International Symposium on Static Analysis
Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Transition predicate abstraction and fair termination

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transition predicate abstraction and fair termination

Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Termination proofs for systems code

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Verifying temporal heap properties specified via evolution logic

ESOP'03 Proceedings of the 12th European conference on Programming
Symbolic execution with separation logic

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Termination of polynomial programs

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
TERMINATOR: beyond safety

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Abstraction refinement for termination

SAS'05 Proceedings of the 12th international conference on Static Analysis
Who is pointing when to whom?

FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
A local shape analysis based on separation logic

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Variance analyses from invariance analyses

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving that programs eventually do something good

Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Local Reasoning about Data Update

Electronic Notes in Theoretical Computer Science (ENTCS)
Proving thread termination

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Termination analysis and call graph construction for higher-order functional programs

ICFP '07 Proceedings of the 12th ACM SIGPLAN international conference on Functional programming
Cyclic proofs of program termination in separation logic

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Termination Analysis of Java Bytecode

FMOODS '08 Proceedings of the 10th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Tutorial on Separation Logic (Invited Tutorial)

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Heap Assumptions on Demand

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Monotonic Abstraction for Programs with Dynamic Memory Heaps

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Enhancing Program Verification with Lemmas

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
THOR: A Tool for Reasoning about Shape and Arithmetic

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Proving that non-blocking algorithms don't block

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separation Logic Tutorial

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Automata-Based Termination Proofs

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Using CLP Simplifications to Improve Java Bytecode Termination Analysis

Electronic Notes in Theoretical Computer Science (ENTCS)
Memory Usage Verification Using Hip/Sleek

ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Automatic numeric abstractions for heap-manipulating programs

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A termination analyzer for Java bytecode based on path-length

ACM Transactions on Programming Languages and Systems (TOPLAS)
Shape analysis of single-parent heaps

VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Comparison under abstraction for verifying linearizability

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Proving termination of tree manipulating programs

ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
From object fields to local variables: a practical approach to field-sensitive analysis

SAS'10 Proceedings of the 17th international conference on Static analysis
Alternation for termination

SAS'10 Proceedings of the 17th international conference on Static analysis
Automated termination proofs for haskell by term rewriting

ACM Transactions on Programming Languages and Systems (TOPLAS)
Loop invariant synthesis in a combined domain

ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Proving program termination

Communications of the ACM
Decision procedures for automating termination proofs

VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Programs with lists are counter automata

Formal Methods in System Design
Termination graphs for Java bytecode

Verification, induction termination analysis
Termination graphs for Java bytecode

Verification, induction termination analysis
Beyond reachability: shape abstraction in the presence of pointer arithmetic

SAS'06 Proceedings of the 13th international conference on Static Analysis
Interprocedural shape analysis with separated heap abstractions

SAS'06 Proceedings of the 13th international conference on Static Analysis
Verification of multi-linked heaps

Journal of Computer and System Sciences
Termination analysis with algorithmic learning

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Automated termination proofs for Java programs with cyclic data

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Precise enforcement of progress-sensitive security

Proceedings of the 2012 ACM conference on Computer and communications security
Formalised inductive reasoning in the logic of bunched implications

SAS'07 Proceedings of the 14th international conference on Static Analysis
Footprint analysis: a shape analysis that discovers preconditions

SAS'07 Proceedings of the 14th international conference on Static Analysis
Arithmetic strengthening for shape analysis

SAS'07 Proceedings of the 14th international conference on Static Analysis
Loop invariant synthesis in a combined abstract domain

Journal of Symbolic Computation
Binary reachability analysis of higher order functional programs

SAS'12 Proceedings of the 19th international conference on Static Analysis
Termination proofs for linear simple loops

SAS'12 Proceedings of the 19th international conference on Static Analysis
Reachability-based acyclicity analysis by Abstract Interpretation

Theoretical Computer Science
Structural counter abstraction

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.02

Visualization

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 termination prover. We show that the analysis is able to prove the termination of loops extracted from Windows device drivers that could not be proved terminating before by other means; we also discuss a previously unknown bug found with the analysis.