| TPA: Termination Proved Automatically |  |
Abstract:
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.
TPA: Termination Proved Automatically
In
Proceedings of the 17th International Conference on Rewriting Techniques and Applications
( RTA '06),
Seattle, WA, USA.
BibTeX:@inproceedings{tpa-RTA-06,
author = {Adam Koprowski},
title = {{TPA}: Termination Proved Automatically},
booktitle = {Proceedings of the 17th International Conference on Rewriting Techniques and Applications (RTA '06)},
year = {2006},
series = {Lecture Notes in Computer Science},
volume = {4098},
pages = {257--266},
} | 
