Termination Analysis by Dependency Pairs and Inductive Theorem Proving

Authors:
Stephan Swiderski;Michael Parting;Jürgen Giesl;Carsten Fuhs;Peter Schneider-Kamp
Affiliations:
LuFG Informatik 2, RWTH Aachen University, Germany;LuFG Informatik 2, RWTH Aachen University, Germany;LuFG Informatik 2, RWTH Aachen University, Germany;LuFG Informatik 2, RWTH Aachen University, Germany;Dept. of Mathematics & CS, University of Southern Denmark, Odense, Denmark
Venue:
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Year:
2009

Citing 26
Cited 2

Proof by consistency

Artificial Intelligence
Termination of term rewriting: interpretation and type elimination

Journal of Symbolic Computation - Special issue on conditional term rewriting systems
Mathematical induction

Handbook of logic in artificial intelligence and logic programming
Equational reasoning and term rewriting systems

Handbook of logic in artificial intelligence and logic programming (vol. 1)
On proving the termination of algorithms by machine

Artificial Intelligence
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
Computer-Aided Reasoning: An Approach

Computer-Aided Reasoning: An Approach
SPIKE: A System for Automatic Inductive Proofs

AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Termination Analysis for Functional Programs using Term Orderings

SAS '95 Proceedings of the Second International Symposium on Static Analysis
TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language

SAS '97 Proceedings of the 4th International Symposium on Static Analysis
A Mechanizable Induction Principle for Equational Specifications

Proceedings of the 9th International Conference on Automated Deduction
Termination Analysis by Inductive Evaluation

CADE-15 Proceedings of the 15th International Conference on Automated Deduction: Automated Deduction
Automating the dependency pair method

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Mechanizing and Improving Dependency Pairs

Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features

Information and Computation
Order-sorted dependency pairs

Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Proving Termination by Bounded Increase

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Certified Size-Change Termination

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Termination of rewriting under strategies

ACM Transactions on Computational Logic (TOCL)
Automated termination proofs for logic programs by term rewriting

ACM Transactions on Computational Logic (TOCL)
SAT solving for termination analysis with polynomial interpretations

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Termination analysis with calling context graphs

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
Automated termination analysis for Haskell: from term rewriting to programming languages

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems

Fundamenta Informaticae

Size-change termination and transition invariants

SAS'10 Proceedings of the 17th international conference on Static analysis
Proving Termination by Dependency Pairs and Inductive Theorem Proving

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Current techniques and tools for automated termination analysis of term rewrite systems (TRSs) are already very powerful. However, they fail for algorithms whose termination is essentially due to an inductive argument. Therefore, we show how to couple the dependency pair method for TRS termination with inductive theorem proving. As confirmed by the implementation of our new approach in the tool AProVE, now TRS termination techniques are also successful on this important class of algorithms.