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/9044

Title: Tyrolean termination tool: Techniques and features
Authors: Hirokawa, Nao
Middeldorp, Aart
Keywords: Term rewriting
Dependency pair method
Polynomial interpretations
Issue Date: 2007-09
Publisher: Elsevier
Magazine name: Information and Computation
Volume: 205
Number: 4
Start page: 474
End page: 511
DOI: 10.1016/j.ic.2006.08.010
Abstract: The Tyrolean Termination Tool (T_<T>T for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependency pair method that are easy to implement, increase the power of the method, result in simpler termination proofs, and make the method more efficient. T_<T>T employs polynomial interpretations with negative coefficients, like x − 1 for a unary function symbol or x − y for a binary function symbol, which are useful for extending the class of rewrite systems that can be proved terminating automatically. Besides a detailed account of these techniques, we describe the convenient web interface of T_<T>T and provide some implementation details.
Rights: NOTICE: This is the author's version of a work accepted for publication by Elsevier. Nao Hirokawa and Aart Middeldorp, Information and Computation, 205(4), 2007, 474-511, http://dx.doi.org/10.1016/j.ic.2006.08.010
URI: http://hdl.handle.net/10119/9044
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
07ic.pdf520KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Contact : Library Information Section, Japan Advanced Institute of Science and Technology