Nagoya Termination Tool

Abstract

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.Comment: 12 pages, 1 figure, full version of the paper which is to appear in RTA/TLCA 201