@inproceedings{440c7cc67f1948d4a7b45ad4612efa34,
title = "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.",
author = "A. Koprowski",
year = "2006",
doi = "10.1007/11805618_19",
language = "English",
isbn = "3-540-36834-5",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "257--266",
editor = "F. Pfenning",
booktitle = "Rewriting Techniques and Applications (Proceedings 17th International Conference, RTA 2006, Seattle WA, USA, August 12-14, 2006)",
address = "Germany",
}