| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| SS | 2023-03-15 09:30 |
Okinawa | (Primary: On-site, Secondary: Online) |
On Polynomial Interpretations Toward Termination of Logically Constrained Term Rewrite Systems with Bit Vector Arithmetic Ayuka Matsumi, Naoki Nishida, Misaki Kojima, Donghoon Shin (Nagoya Univ.)  SS2022-61 |
Logically constrained term rewrite systems with the bit-vector theory (BV-LCTRSs, for short) are useful as models of pro... [more] | SS2022-61 pp.85-90 |
| MSS, SS | 2023-01-11 13:30 |
Osaka | (Primary: On-site, Secondary: Online) |
A formal description of a functional language with exception handling, and constrained dependency pairs for the termination proofs Takeshi Hamaguchi, Masahiko Sakai (Nagoya Univ.) MSS2022-56 SS2022-41 |
This paper proposes a termination-proof method for functional programs with exception handling. First, we give a small s... [more] | MSS2022-56 SS2022-41 pp.66-71 |
| SS | 2020-03-04 15:10 |
Okinawa | (Cancelled but technical report was issued) |
Transforming Programs with Exclusive Control into Logically Constrained Term Rewrite Systems Misaki Kojima, Naoki Nishida, Yutaka Matsubara, Masahiko Sakai (Nagoya Univ.) SS2019-46 |
To apply Logically Constrained Term Rewrite Systems (LCTRSs, for short) to program verification, a previous work targets... [more] | SS2019-46 pp.31-36 |
| DC, SS | 2019-10-24 14:55 |
Kumamoto | Kumamoto Univ. | Extending rewriting induction to existentially quantified equations Kazushi Nishie, Naoki Nishida, Masahiko sakai (Nagoya Univ.) SS2019-17 DC2019-45 |
In this paper, we extend rewriting induction which is developed to prove equations, to existentially quantified equation... [more] | SS2019-17 DC2019-45 pp.25-30 |
| MSS, SS | 2019-01-16 09:25 |
Okinawa | On Representation of Structures and Unions in Logically Constrained Rewriting Yoshiaki Kanazawa, Naoki Nishida, Masahiko Sakai (Nagoya Univ.) MSS2018-67 SS2018-38 |
Recently, several methods for verifying imperative programs by means of transformations into term rewriting systems have... [more] | MSS2018-67 SS2018-38 pp.67-72 |
|
| SS, KBSE, IPSJ-SE [detail] | 2017-07-20 15:50 |
Hokkaido | Polynomial Interpretations to Convert Dependency Chains of Constrained Term Rewriting Systems to Bounded Increasing Sequences of Intergers Tomohiro Sasano, Naoki Nishida, Masahiko Sakai, Tomoya Ueyama (Nagoya Univ.) SS2017-17 KBSE2017-17 |
In dependency pair framework for proving termination of constrained term rewriting systems, polynomial interpretations t... [more] | SS2017-17 KBSE2017-17 pp.139-144 |
|
| SS, MSS | 2016-01-26 11:05 |
Ishikawa | Shiinoki-Geihin-Kan | Transforming Constrained Dependency Pairs by Narrowing Tomohiro Sasano, Naoki Nishida, Masahiko Sakai (Nagoya Univ.) MSS2015-57 SS2015-66 |
The dependency pair framework, a method for proving termination of term rewriting systems, has been extended for constra... [more] | MSS2015-57 SS2015-66 pp.123-128 |
| KBSE, SS, IPSJ-SE [detail] | 2015-07-24 11:10 |
Hokkaido | An Equivalent Transformation of Constrained Term Rewriting Systems by Pattern Elimination Takahiro Nagao, Naoki Nishida, Masahiko Sakai (Nagoya Univ.) SS2015-33 KBSE2015-26 |
A constrained term rewriting system, an extension of term rewriting systems, can control application of rules by constra... [more] | SS2015-33 KBSE2015-26 pp.167-172 |
|
| SS | 2015-03-10 09:55 |
Okinawa | OKINAWAKEN SEINENKAIKAN | Heuristics for Automatically Proving Commutativity of Function Composition for Constrained Term Rewriting Systems Ryutaro Kuriki, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe (Nagoya Univ.) SS2014-70 |
In proving equations to be inductive theorems of constrained term rewriting systems, we often need appropriate lemmas of... [more] | SS2014-70 pp.91-96 |
| SS | 2014-03-11 13:30 |
Okinawa | Tenbusu Naha | On Detecting Useless Transition Rules of Constrained Tree Automata Yasuhiro Nakano, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari, Kenji Hashimoto (Nagoya Univ.) SS2013-77 |
Reduction completeness of terms is proved many times in a theorem proving method for constrained term rewriting systems ... [more] | SS2013-77 pp.31-36 |
| SS | 2013-01-10 13:30 |
Okinawa | Construction of Constrained Tree Automata Recognizing Ground Instances of Constrained Terms Yasuhiro Nakano, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari (Nagoya Univ.) |
A theorem proving method for constrained term rewriting systems, which is based on rewriting induction, needs a decision... [more] | SS2012-47 pp.7-12 |
|
| KBSE, SS | 2008-05-29 13:30 |
Miyazaki | Miyazaki Citizens' Plaza | On Rewriting Induction for Presburger-Constrained Term Rewriting Systems Tsubasa Sakata, Naoki Nishida, Toshiki Sakabe, Masahiko Sakai, Keiichirou Kusakari (Nagoya Univ.) SS2008-1 KBSE2008-1 |
A method for verifying equivalence between procedural programs has been proposed, where the implicit induction is extend... [more] | SS2008-1 KBSE2008-1 pp.1-6 |
[Return to Top Page]