Proving Termination by Dependency Pairs and Inductive Theorem Proving

Authors:
Carsten Fuhs;Jürgen Giesl;Michael Parting;Peter Schneider-Kamp;Stephan Swiderski
Affiliations:
LuFG Informatik 2, RWTH Aachen University, Aachen, Germany;LuFG Informatik 2, RWTH Aachen University, Aachen, Germany;LuFG Informatik 2, RWTH Aachen University, Aachen, Germany;Department of Mathematics & Computer Science, University of Southern Denmark, Odense, Denmark;LuFG Informatik 2, RWTH Aachen University, Aachen, Germany
Venue:
Journal of Automated Reasoning
Year:
2011

Citing 34
Cited 1

Proof by consistency

Artificial Intelligence
Counterexamples to termination for the direct sum of term rewriting systems

Information Processing Letters
Termination of rewriting systems by polynomial interpretations and its implementation

Science of Computer Programming
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
Mechanizing and Improving Dependency Pairs

Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features

Information and Computation
Matrix Interpretations for Proving Termination of Term Rewriting

Journal of Automated Reasoning
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
Proving Termination Using Recursive Path Orders and SAT Solving

FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Termination of rewriting under strategies

ACM Transactions on Computational Logic (TOCL)
KBO Orientability

Journal of Automated Reasoning
Automated termination proofs for logic programs by term rewriting

ACM Transactions on Computational Logic (TOCL)
Termination Analysis by Dependency Pairs and Inductive Theorem Proving

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Beyond Dependency Graphs

CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Certification of Termination Proofs Using CeTA

TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
A3PAT, an approach for certified automated termination proofs

Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Automating the dependency pair method

Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
SAT solving for termination analysis with polynomial interpretations

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Automated termination proofs for haskell by term rewriting

ACM Transactions on Programming Languages and Systems (TOPLAS)
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

Harnessing first order termination provers using higher order dependency pairs

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems

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 termination of TRSs 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.