| Presentation | 2015-07-24 An Equivalent Transformation of Constrained Term Rewriting Systems by Pattern Elimination Takahiro Nagao, Naoki Nishida, Masahiko Sakai, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | A constrained term rewriting system, an extension of term rewriting systems, can control application of rules by constraints such as those on integers. By partial elimination of patterns occurring in left-hand sides of rules, which preserves their meanings, one can facilitate analyzing various properties. In this article, we propose a transformation based on pattern elimination of constrained term rewriting systems that contain only patterns of interpretable terms in their left-hand sides, and show sufficient conditions for the resulting system to be equivalent to the original with respect to some properties such as sufficient completeness and innermost termination. We also propose a procedure for testing reduction completeness as an application of the transformation. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | constrained term rewriting system / pattern elimination / reduction completeness |
| Paper # | SS2015-33,KBSE2015-26 |
| Date of Issue | 2015-07-15 (SS, KBSE) |
| Conference Information | |
| Committee | KBSE / SS / IPSJ-SE |
|---|---|
| Conference Date | 2015/7/22(3days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Tadashi Iijima(Keio Univ.) / Shoji Yuen(Nagoya Univ.) |
| Vice Chair | Shigeo Kaneda(Doshisha Univ.) / Kazuhiro Ogata(JAIST) |
| Secretary | Shigeo Kaneda(Nihon Univ.) / Kazuhiro Ogata(Osaka Univ.) / (Tokyo Inst. of Tech.) |
| Assistant | Shinpei Ogata(Shinshu Univ.) / Hiroaki Hashiura(Nippon Inst. of Tech.) / Yoshiki Higo(Osaka Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Knowledge-Based Software Engineering / Technical Committee on Software Science / Special Interest Group on Software Engineering |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | An Equivalent Transformation of Constrained Term Rewriting Systems by Pattern Elimination |
| Sub Title (in English) | |
| Keyword(1) | constrained term rewriting system |
| Keyword(2) | pattern elimination |
| Keyword(3) | reduction completeness |
| 1st Author's Name | Takahiro Nagao |
| 1st Author's Affiliation | Nagoya University(Nagoya Univ.) |
| 2nd Author's Name | Naoki Nishida |
| 2nd Author's Affiliation | Nagoya University(Nagoya Univ.) |
| 3rd Author's Name | Masahiko Sakai |
| 3rd Author's Affiliation | Nagoya University(Nagoya Univ.) |
| Date | 2015-07-24 |
| Paper # | SS2015-33,KBSE2015-26 |
| Volume (vol) | vol.115 |
| Number (no) | SS-153,KBSE-154 |
| Page | pp.pp.167-172(SS), pp.167-172(KBSE), |
| #Pages | 6 |
| Date of Issue | 2015-07-15 (SS, KBSE) |