Theoretical Computer Science
Termination of rewriting systems by polynomial interpretations and its implementation
Science of Computer Programming
Computational recreations in Mathematica
Computational recreations in Mathematica
Termination of term rewriting: interpretation and type elimination
Journal of Symbolic Computation - Special issue on conditional term rewriting systems
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Termination of Linear Rewriting Systems (Preliminary Version)
Proceedings of the 8th Colloquium on Automata, Languages and Programming
Automated Termination Proofs with Measure Functions
KI '95 Proceedings of the 19th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Match-Bounded String Rewriting Systems
Applicable Algebra in Engineering, Communication and Computing
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Finding finite automata that certify termination of string rewriting
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Termination Of Term Rewriting By Semantic Labelling
Fundamenta Informaticae
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation
Practical use of polynomials over the reals in proofs of termination
Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming
Proving Termination of Context-Sensitive Rewriting with MU-TERM
Electronic Notes in Theoretical Computer Science (ENTCS)
Loop detection in term rewriting using the eliminating unfoldings
Theoretical Computer Science
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
Language and Automata Theory and Applications
A non-termination criterion for binary constraint logic programs
Theory and Practice of Logic Programming
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Web Services and Interoperability for the Maude Termination Tool
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
Experiments with Non-Termination Analysis for Java Bytecode
Electronic Notes in Theoretical Computer Science (ENTCS)
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Proving termination of rewrite systems using bounds
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Termination by quasi-periodic interpretations
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Weighted automata for proving termination of string rewriting
Journal of Automata, Languages and Combinatorics
Derivational complexity of knuth-bendix orders revisited
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Proving and disproving termination of higher-order functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Finding finite automata that certify termination of string rewriting
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Reducing right-hand sides for termination
Processes, Terms and Cycles
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Proving non-looping non-termination automatically
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
| Hi-index | 0.00 |
This paper describes how a combination of polynomial interpretations, recursive path order, RFC match-bounds, the dependency pair method, and semantic labelling can be used for automatically proving termination of an extensive class of string rewriting systems (SRSs). The tool implementing this combination of techniques is called TORPA: Termination of Rewriting Proved Automatically. All termination proofs generated by TORPA are easy to read and check; but for many of the SRSs involved, finding a termination proof would be a hard job for a human. This paper contains all underlying theory, describes how the search for a termination proof is implemented, and includes many examples.