Termination of term rewriting: interpretation and type elimination
Journal of Symbolic Computation - Special issue on conditional term rewriting systems
Term rewriting and all that
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Sequentiality, monadic second-order logic and tree automata
Information and Computation
Argument Filtering Transformation
PPDP '99 Proceedings of the International Conference PPDP'99 on Principles and Practice of Declarative Programming
Termination of Linear Rewriting Systems (Preliminary Version)
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Modularity of Termination Using Dependency pairs
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Decidability for Left-Linaer Growing Term Rewriting Systems
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Tree Automata and Term Rewrite Systems
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
System Description: The Dependency Pair Method
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Decidable Approximations of Term Rewriting Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Termination of Associative-Commutative Rewriting by Dependency Pairs
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Applying Rewriting Techniques to the Verification of Erlang Processes
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Decidable Call by Need Computations in term Rewriting (Extended Abstract)
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Termination Of Term Rewriting By Semantic Labelling
Fundamenta Informaticae
Hierarchical termination revisited
Information Processing Letters
Modular termination proofs for rewriting using dependency pairs
Journal of Symbolic Computation
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Decidable call-by-need computations in term rewriting
Information and Computation
Information Processing Letters
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
Elimination Transformations for Associative---Commutative Rewriting Systems
Journal of Automated Reasoning
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
Language and Automata Theory and Applications
CADE-22 Proceedings of the 22nd International Conference on Automated Deduction
Information and Computation
Decidable call-by-need computations in term rewriting
Information and Computation
Automating the dependency pair method
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Information Processing Letters
Information Processing Letters
Proving termination of rewrite systems using bounds
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Context-sensitive dependency pairs
Information and Computation
Decidability of termination for semi-constructor TRSs, left-linear shallow TRSs and related systems
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved by using tree automata techniques to obtain better approximations of the dependency graph. This graph determines the ordering constraints that need to be solved in order to conclude termination. We further show that by using our approximations the dependency pair method provides a decision procedure for termination of right-ground rewrite systems.