Maximal Termination

Authors:
Carsten Fuhs;Jürgen Giesl;Aart Middeldorp;Peter Schneider-Kamp;René Thiemann;Harald Zankl
Affiliations:
LuFG Informatik 2, RWTH Aachen University, Germany;LuFG Informatik 2, RWTH Aachen University, Germany;Institute of Computer Science, University of Innsbruck, Austria;LuFG Informatik 2, RWTH Aachen University, Germany;Institute of Computer Science, University of Innsbruck, Austria;Institute of Computer Science, University of Innsbruck, Austria
Venue:
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Year:
2008

Citing 12
Cited 11

Proof of termination of the rewriting system SUBST on CCL

Theoretical Computer Science
Counterexamples to termination for the direct sum of term rewriting systems

Information Processing Letters
Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
Testing Positiveness of Polynomials

Journal of Automated Reasoning
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
Proving Termination by Bounded Increase

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
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
AProVE 1.2: automatic termination proofs in the dependency pair framework

IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
TPA: termination proved automatically

RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications

Automated Implicit Computational Complexity Analysis (System Description)

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Improving Context-Sensitive Dependency Pairs

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
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
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic

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
Monotonicity criteria for polynomial interpretations over the naturals

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
SAT Solving for Termination Proofs with Recursive Path Orders and Dependency Pairs

Journal of Automated Reasoning
Synthesis of sup-interpretations: A survey

Theoretical Computer Science
Unifying the Knuth-Bendix, recursive path and polynomial orders

Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new approach for termination proofs that uses polynomial interpretations (with possibly negative coefficients) together with the "maximum" function. To obtain a powerful automatic method, we solve two main challenges: (1) We show how to adapt the latest developments in the dependency pair framework to our setting. (2) We show how to automate the search for such interpretations by integrating " max " into recent SAT-based methods for polynomial interpretations. Experimental results support our approach.