|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/9058
|
| Title: | Tyrolean Termination Tool |
| Authors: | Hirokawa, Nao
Middeldorp, Aart |
| Issue Date: | 2005 |
| Publisher: | Springer |
| Magazine name: | Lecture Notes in Computer Science |
| Volume: | 3467/2005 |
| Start page: | 175 |
| End page: | 184 |
| DOI: | 10.1007/b135673 |
| Abstract: | This paper describes the Tyrolean Termination Tool (T_<T>T in the sequel), the successor of the Tsukuba Termination Tool [12]. We describe the differences between the two and explain the new features, some of which are not (yet) available in any other termination tool, in some detail. T_<T>T is a tool for automatically proving termination of rewrite systems based on the dependency pair method of Arts and Giesl [3]. It produces high-quality output and has a convenient web interface. The tool is available at http://cl2-informatik.uibk.ac.at/ttt T_<T>T incorporates several new improvements to the dependency pair method. In addition, it is now possible to run the tool in fully automatic mode on a collection of rewrite systems. Moreover, besides ordinary (first-order) rewrite systems, the tool accepts simply-typed applicative rewrite systems which are transformed into ordinary rewrite systems by the recent method of Aoto and Yamada [2]. In the next section we describe the differences between the semi automatic mode and the Tsukuba Termination Tool. Section 3 describes the fully automatic mode. In Section 4 we show a termination proof of a simply-typed applicative system obtained by T_<T>T. In Section 5 we describe how to input a collection of rewrite systems and how to interpret the resulting output. Some implementation details are given in Section 6. The final section contains a short comparison with other tools for automatically proving termination. |
| Rights: | This is the author-created version of Springer, Nao Hirokawa and Aart Middeldorp, Lecture Notes in Computer Science, 3467/2005, 2005, 175-184. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/b135673 |
| URI: | http://hdl.handle.net/10119/9058 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| 05rta.pdf | | 278Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
