Proving program termination

Authors:
Byron Cook;Andreas Podelski;Andrey Rybalchenko
Affiliations:
University of London, England;University of Freiburg, Germany;Universität München, Germany
Venue:
Communications of the ACM
Year:
2011

Citing 27
Cited 6

The size-change principle for program termination

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Synthesis of Linear Ranking Functions

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Circular Compositional Reasoning about Liveness

CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
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
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
Thorough static analysis of device drivers

Proceedings of the 1st ACM SIGOPS/EuroSys European Conference on Computer Systems 2006
Proving Termination by Divergence.

SEFM '07 Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods
Proving non-termination

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Heap Assumptions on Demand

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Proving Conditional Termination

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Scalable Shape Analysis for Systems Code

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
Ranking abstractions

ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European conference on Programming languages and systems
Deadlock immunity: enabling systems to defend against deadlocks

OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
The polyranking principle

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Termination of polynomial programs

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Automatic termination proofs for programs with shape-shifting heaps

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Termination analysis with calling context graphs

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Programs with lists are counter automata

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Separating fairness and well-foundedness for the analysis of fair discrete systems

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Linear ranking with reachability

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Automated termination analysis for Haskell: from term rewriting to programming languages

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Arithmetic strengthening for shape analysis

SAS'07 Proceedings of the 14th international conference on Static Analysis

Binary reachability analysis of higher order functional programs

SAS'12 Proceedings of the 19th international conference on Static Analysis
Word-length optimization beyond straight line code

Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays
At the interface of biology and computation

Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Under-Approximating loops in c programs for fast counterexample detection

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Proving mutual termination of programs

HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
Object ownership in program verification

Aliasing in Object-Oriented Programming

Quantified Score

Hi-index	48.22

Visualization

Abstract

In contrast to popular belief, proving termination is not always impossible.