×

TPA

swMATH ID: 10114
Software Authors: Adam Koprowski
Description: TPA: Termination Proved Automatically. 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.
Homepage: http://link.springer.com/chapter/10.1007/11805618_19
Related Software: Tyrolean; AProVE; Haskell; Matchbox; Jambox; Nagoya Termination Tool; MU-TERM; CoLoR; Coq; CiME; TPDB; MTT; Maude; CafeOBJ; OBJ3; CASL; CeTA; Isabelle/HOL; MiniSat; TOY
Referenced in: 13 Publications

Standard Articles

1 Publication describing the Software, including 1 Publication in zbMATH Year
TPA: termination proved automatically. Zbl 1151.68635
Koprowski, Adam
2006

Referencing Publications by Year