2014年
Nagoya termination tool
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- ,
- ,
- 巻
- 8560
- 号
- 開始ページ
- 466
- 終了ページ
- 475
- 記述言語
- 英語
- 掲載種別
- 研究論文(国際会議プロシーディングス)
- DOI
- 10.1007/978-3-319-08918-8_32
- 出版者・発行元
- Springer Verlag
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. © 2014 Springer International Publishing Switzerland.
- ID情報
-
- DOI : 10.1007/978-3-319-08918-8_32
- ISSN : 1611-3349
- ISSN : 0302-9743
- SCOPUS ID : 84958549524