Linear ranking with reachability

Authors:
Aaron R. Bradley;Zohar Manna;Henny B. Sipma
Affiliations:
Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA
Venue:
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Year:
2005

Citing 11
Cited 38

Theory of linear and integer programming

Theory of linear and integer programming
The size-change principle for program termination

POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Introduction to Mathematical Theory of Computation

Introduction to Mathematical Theory of Computation
Visual Abstractions for Temporal Verification

AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Synthesis of Linear Ranking Functions

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs

CC '02 Proceedings of the 11th International Conference on Compiler Construction
Practical Methods for Proving Program Termination

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Deductive Model Checking

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Scalable analysis of linear systems using mathematical programming

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

Termination analysis of integer linear loops

CONCUR 2005 - Concurrency Theory
Termination proofs for systems code

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
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
Transition predicate abstraction and fair termination

ACM Transactions on Programming Languages and Systems (TOPLAS) - Special issue on POPL 2005
Path invariants

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Proving thread termination

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Program analysis as constraint solving

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Proving Conditional Termination

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Constraint-Based Invariant Inference over Predicate Abstraction

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
Proving Termination of Integer Term Rewriting

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Constraint solving for interpolation

VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Leaping loops in the presence of abstraction

CAV'07 Proceedings of the 19th international conference on Computer aided verification
All you need is compassion

VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
Constraint solving for interpolation

Journal of Symbolic Computation
Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs

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
Making prophecies with decision predicates

Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving program termination

Communications of the ACM
Model checking of hybrid systems: from reachability towards stability

HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
The polyranking principle

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Verification constraint problems with strengthening

ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Termination of integer linear programs

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Termination analysis with compositional transition invariants

CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Proving liveness by backwards reachability

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Termination analysis of imperative programs using bitvector arithmetic

VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
A new look at the automatic synthesis of linear ranking functions

Information and Computation
Synthesizing software verifiers from proof rules

Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Deciding conditional termination

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Termination analysis with algorithmic learning

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Termination proofs for linear simple loops

SAS'12 Proceedings of the 19th international conference on Static Analysis
On the linear ranking problem for integer linear-constraint loops

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Ramsey vs. lexicographic termination proving

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

Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering
Better termination proving through cooperation

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

Quantified Score

Hi-index	0.02

Visualization

Abstract

We present a complete method for synthesizing lexicographic linear ranking functions supported by inductive linear invariants for loops with linear guards and transitions. Proving termination via linear ranking functions often requires invariants; yet invariant generation is expensive. Thus, we describe a technique that discovers just the invariants necessary for proving termination. Finally, we describe an implementation of the method and provide extensive experimental evidence of its effectiveness for proving termination of C loops.