Cdiprover3: a tool for proving derivational complexities of term rewriting systems

Authors:
Andreas Schnabl
Affiliations:
Institute of Computer Science, University of Innsbruck, Austria
Venue:
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
Year:
2008

Citing 18
Cited 0

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
Proving Polynomials Positive

Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Termination Proofs by Context-Dependent Interpretations

RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Analysing the implicit complexity of programs

Information and Computation - Special issue: ICC '99
Algorithms with polynomial interpretation termination proof

Journal of Functional Programming
Mechanically Proving Termination Using Polynomial Interpretations

Journal of Automated Reasoning
Matrix Interpretations for Proving Termination of Term Rewriting

Journal of Automated Reasoning
Arctic Termination ...Below Zero

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Proving Quadratic Derivational Complexities Using Context Dependent Interpretations

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Root-Labeling

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Automated Complexity Analysis Based on the Dependency Pair Method

IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Complexity, Graphs, and the Dependency Pair Method

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
The Derivational Complexity Induced by the Dependency Pair Method

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
Quasi-interpretation synthesis by decomposition an application to higher-order programs

ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Complexity analysis by rewriting

FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
Reducing right-hand sides for termination

Processes, Terms and Cycles

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes cdiprover3, a tool for proving termination of term rewrite systems by polynomial interpretations and context dependent interpretations. The methods used by cdiprover3 induce small bounds on the derivational complexity of the considered system. We explain the tool in detail, and give an overview of the employed proof methods.