Proving Termination by Bounded Increase

Authors:
Jürgen Giesl;René Thiemann;Stephan Swiderski;Peter Schneider-Kamp
Affiliations:
LuFG Informatik 2, RWTH Aachen, Germany;LuFG Informatik 2, RWTH Aachen, Germany;LuFG Informatik 2, RWTH Aachen, Germany;LuFG Informatik 2, RWTH Aachen, Germany
Venue:
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Year:
2007

Citing 13
Cited 11

Term rewriting and all that

Term rewriting and all that
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
Termination Analysis by Inductive Evaluation

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Mechanically Proving Termination Using Polynomial Interpretations

Journal of Automated Reasoning
Mechanizing and Improving Dependency Pairs

Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features

Information and Computation
Automating the dependency pair method

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Relaxing monotonicity for innermost termination

Information Processing Letters
SAT solving for termination analysis with polynomial interpretations

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
The termination competition

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Termination analysis with calling context graphs

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

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
Maximal Termination

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Arctic Termination ...Below Zero

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
From Outermost Termination to Innermost Termination

SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
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
Termination Analysis by Dependency Pairs and Inductive Theorem Proving

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Polytool: Polynomial interpretations as a basis for termination analysis of logic programs

Theory and Practice of Logic Programming
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
Proving Termination by Dependency Pairs and Inductive Theorem Proving

Journal of Automated Reasoning
Formalizing bounded increase

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decreasein recursive calls. However, they fail if the reason for termination is that an argument is increasedin recursive calls repeatedly until it reaches a bound. In this paper, we solve that problem and show how to prove innermost termination of TRSs with bounded increase automatically.