Nagoya Termination Tool
swMATH ID: | 21588 |
Software Authors: | Yamada, A.; Kusakari, K.; Sakabe, T. |
Description: | Nagoya termination tool. This paper describes the implementation and techniques of the Nagoya Termination Tool, a termination prover for term rewrite systems. The main features of the tool are: the first implementation of the weighted path order which subsumes most of the existing reduction pairs, and the efficiency due to the strong cooperation with external SMT solvers. We present some new ideas that contribute to the efficiency and power of the tool. |
Homepage: | https://link.springer.com/chapter/10.1007%2F978-3-319-08918-8_32 |
Related Software: | NaTT; Tyrolean; AProVE; z3; GitHub; StarExec; CeTA; Matchbox; TPDB; CSI; CoCoWeb; MU-TERM; CoLoR; Isabelle/HOL; TPA; MadMax; KBCV; Slothrop; mkbTT; KoAT |
Cited in: | 14 Documents |
Standard Articles
1 Publication describing the Software, including 1 Publication in zbMATH | Year |
---|---|
Nagoya termination tool. Zbl 1416.68183 Yamada, Akihisa; Kusakari, Keiichirou; Sakabe, Toshiki |
2014
|
all
top 5
Cited by 22 Authors
Cited in 2 Serials
3 | Journal of Automated Reasoning |
1 | Logical Methods in Computer Science |
Cited in 2 Fields
14 | Computer science (68-XX) |
2 | Mathematical logic and foundations (03-XX) |