Structuring depth-first search algorithms in Haskell
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Hierarchical termination revisited
Information Processing Letters
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
System Description: The Dependency Pair Method
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Automatic Termination Proofs With Transformation Orderings
RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
Complete Monotonic Semantic Path Orderings
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Simplification Orderings: History Of Results
Fundamenta Informaticae
Proving termination of membership equational programs
Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Program transformation by templates based on term rewriting
PPDP '05 Proceedings of the 7th ACM SIGPLAN international conference on Principles and practice of declarative programming
Automating the dependency pair method
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Termination of String Rewriting Proved Automatically
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)
Complexity analysis by rewriting
FLOPS'08 Proceedings of the 9th international conference on Functional and logic programming
SAT solving for argument filterings
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Termination of rewrite systems with shallow right-linear, collapsing, and right-ground rules
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Partial inversion of constructor term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
On tree automata that certify termination of left-linear term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Solving partial order constraints for LPO termination
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
RAPT: a program transformation system based on term rewriting
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
We present a tool for automatically proving termination of first-order rewrite systems. The tool is based on the dependency pair method of Arts and Giesl. It incorporates several new ideas that make the method more efficient. The tool produces high-quality output and has a convenient web interface.