Proof of termination of the rewriting system SUBST on CCL
Theoretical Computer Science
Termination of rewriting systems by polynomial interpretations and its implementation
Science of Computer Programming
Termination of term rewriting using dependency pairs
Theoretical Computer Science - Trees in algebra and programming
Dummy Elimination: Making Termination Easier
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Termination of simply typed term rewriting by translation and labelling
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Termination of fair computations in term rewriting
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Automation of recursive path ordering for infinite labelled rewrite systems
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Proving liveness with fairness using rewriting
FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Reducing right-hand sides for termination
Processes, Terms and Cycles
Termination Of Term Rewriting By Semantic Labelling
Fundamenta Informaticae
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
Tyrolean termination tool: Techniques and features
Information and Computation
Termination of just/fair computations in term rewriting
Information and Computation
Predictive Labeling with Dependency Pairs Using SAT
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Arctic Termination ...Below Zero
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
Methods for Proving Termination of Rewriting-based Programming Languages by Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
Transforming SAT into Termination of Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
A3PAT, an approach for certified automated termination proofs
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Max/plus tree automata for termination of term rewriting
Acta Cybernetica
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
POP and semantic labeling using SAT
ESSLLI'08/09 Proceedings of the 2008 international conference on Interfaces: explorations in logic, language and computation
Derivational complexity of knuth-bendix orders revisited
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
AProVE 1.2: automatic termination proofs in the dependency pair framework
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
| Hi-index | 0.00 |
TPA is a tool for proving termination of term rewrite systems (TRSs) in a fully automated fashion. The distinctive feature of TPA is the support for relative termination and the use of the technique of semantic labelling with natural numbers. Thanks to the latter, TPA is capable of delivering automated termination proofs for some difficult TRSs for which all other tools fail.