Presentation 2010-12-14
On non-termination proof of right-linear and right-shallow term rewriting systems based on forward narrowing
Tatsuya HATTORI, Masahiko SAKAI, Naoki NISHIDA, Keiichirou KUSAKARI, Toshiki SAKABE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Detecting non-termination of term rewriting systems based on forward narrowing is used in termination tools such as AProVE. However, there is no known class of term rewriting systems for which the detection method is complete, that is, non-termination is always proved by the method. This paper proves that the detection method is complete for the term rewriting systems whose dependency pairs are right-linear and right-shallow.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) termination tool / completeness / dependency pair
Paper # SS2010-44
Date of Issue

Conference Information
Committee SS
Conference Date 2010/12/7(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Software Science (SS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On non-termination proof of right-linear and right-shallow term rewriting systems based on forward narrowing
Sub Title (in English)
Keyword(1) termination tool
Keyword(2) completeness
Keyword(3) dependency pair
1st Author's Name Tatsuya HATTORI
1st Author's Affiliation Graduate School of Information Science, Nagoya University()
2nd Author's Name Masahiko SAKAI
2nd Author's Affiliation Graduate School of Information Science, Nagoya University
3rd Author's Name Naoki NISHIDA
3rd Author's Affiliation Graduate School of Information Science, Nagoya University
4th Author's Name Keiichirou KUSAKARI
4th Author's Affiliation Graduate School of Information Science, Nagoya University
5th Author's Name Toshiki SAKABE
5th Author's Affiliation Graduate School of Information Science, Nagoya University
Date 2010-12-14
Paper # SS2010-44
Volume (vol) vol.110
Number (no) 336
Page pp.pp.-
#Pages 6
Date of Issue