A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs

Authors:
Stephan Falke;Deepak Kapur
Affiliations:
CS Department, University of New Mexico, Albuquerque, USA;CS Department, University of New Mexico, Albuquerque, USA
Venue:
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Year:
2009

Citing 22
Cited 3

Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
Recursive functions of symbolic expressions and their computation by machine, Part I

Communications of the ACM
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Testing Positiveness of Polynomials

Journal of Automated Reasoning
Synthesis of Linear Ranking Functions

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Practical Methods for Proving Program Termination

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Termination proofs for systems code

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Mechanically Proving Termination Using Polynomial Interpretations

Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features

Information and Computation
Proving Termination by Bounded Increase

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Proving Termination of Integer Term Rewriting

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Tyrolean Termination Tool 2

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
SAT solving for termination analysis with polynomial interpretations

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Ranking abstractions

ESOP'08/ETAPS'08 Proceedings of the Theory and practice of software, 17th European 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
A fast linear-arithmetic solver for DPLL(T)

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
TERMINATOR: beyond safety

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Linear ranking with reachability

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

SAS'05 Proceedings of the 12th international conference on Static Analysis

On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs

WFLP'11 Proceedings of the 20th international conference on Functional and constraint logic programming
Termination of context-sensitive rewriting with built-in numbers and collection data structures

WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
Termination analysis of imperative programs using bitvector arithmetic

VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is transformed into rewrite rules with constraints from quantifier-free Presburger arithmetic. Any computation in the imperative program corresponds to a rewrite sequence, and termination of the rewrite system thus implies termination of the imperative program. Termination of the rewrite system is analyzed using a decision procedure for Presburger arithmetic that identifies possible chains of rewrite rules, and automatically generated polynomial interpretations are used to show finiteness of such chains. An implementation of the approach has been evaluated on a large collection of imperative programs, thus demonstrating its effectiveness and practicality.