Generating polynomial orderings
Information Processing Letters
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Computer experiments with the REVE term rewriting system generator
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
An Efficient Representation of Arithmetic for Term Rewriting
RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
Rewrite Systems for Natural, Integral, and Rational Arithmetic
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Term Rewriting, French Spring School of Theoretical Computer Science, Advanced Course
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation
Termination of {aa →bc,bb→ac,cc→ab}
Information Processing Letters
Termination by quasi-periodic interpretations
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
SAT solving for argument filterings
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Matrix interpretations for proving termination of term rewriting
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proving and disproving termination of higher-order functions
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
Termination of string rewriting with matrix interpretations
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Termination Of Term Rewriting By Semantic Labelling
Fundamenta Informaticae
Loop detection in term rewriting using the eliminating unfoldings
Theoretical Computer Science
Proving Termination by Bounded Increase
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Proving Termination Using Recursive Path Orders and SAT Solving
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Search Techniques for Rational Polynomial Orders
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
MTT: The Maude Termination Tool (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 with (Boolean) Satisfaction
Logic-Based Program Synthesis and Transformation
Termination Analysis of Logic Programs Based on Dependency Graphs
Logic-Based Program Synthesis and Transformation
A Transformational Approach to Prove Outermost Termination Automatically
Electronic Notes in Theoretical Computer Science (ENTCS)
Well-Definedness of Streams by Termination
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)
Automated termination proofs for logic programs by term rewriting
ACM Transactions on Computational Logic (TOCL)
Termination by quasi-periodic interpretations
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Certification of proving termination of term rewriting by matrix interpretations
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Goal-directed and relative dependency pairs for proving the termination of narrowing
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Rewriting Computation and Proof
| Hi-index | 0.00 |
Since 2004, a Termination Competition is organized every year. This competition boosted a lot the development of automatic termination tools, but also the design of new techniques for proving termination. We present the background, results, and conclusions of the three first editions, and discuss perspectives and challenges for the future.