| 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 | 2010-08-05 16:00 |
Hokkaido | Asahikawa Shimin-Bunka-Kaikan (Civic Culture Hall) | Argument Filterings and Usable Rules in Higher-Order Rewrite Systems Sho Suzuki, Keiichirou Kusakari (Nagoya Univ.), Frederic Blanqui (INRIA)  SS2010-24 |
The static dependency pair method is a method for proving the termination of higher-order rewrite systems {\em \`a la} ... [more] |
SS2010-24 pp.47-52 |
| SS | 2009-12-17 15:50 |
Kagawa | Kagawa Univ. | Argument Filtering and Usable Rules in Higher-Order Rewrite Systems Sho Suzuki, Keiichirou Kusakari, Toshiki Sakabe, Masahiko Sakai, Naoki Nishida (Nagoya Univ.) SS2009-39 |
Simply-typed term rewriting systems (STRSs) and higher-order rewrite systems (HRSs) have been proposed to extend term r... [more] |
SS2009-39 pp.25-30 |
| SS | 2009-12-17 16:20 |
Kagawa | Kagawa Univ. | On Decidability of Context-Sensitive Termination for Right-Linear Right-Shallow Term Rewriting Systems Yoshimasa Mishuku, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari, Naoki Nishida (Nagoya Univ.) SS2009-40 |
It is known that termination and innermost termination are decidable for term rewriting systems (TRSs for short) whose d... [more] | SS2009-40 pp.31-36 |
| SS | 2009-12-18 08:40 |
Kagawa | Kagawa Univ. | Program Generation Based on Transformation of Conditional Equations Masanori Nagashima, Masahiko Sakai, Toshiki Sakabe, Naoki Nishida, Keiichirou Kusakari (Nagoya Univ.) SS2009-41 |
Program-generation system GeneSys, which we have ever proposed, generates executable programs from first order equationa... [more] | SS2009-41 pp.37-42 |
| SS | 2008-12-19 10:30 |
Kochi | Kochi Univiersity of Technology | Decidability of Termination Properties for Term Rewriting Systems Consisting of Shallow Dependency Pairs Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari, Naoki Nishida (Nagoya Univ.) SS2008-45 |
In this paper, we show some decidable properties: termination, innermost termination and context-sensitive termination f... [more] | SS2008-45 pp.37-42 |
| SS | 2008-07-31 17:30 |
Hokkaido | Future University-Hakodate | A Reduction Order for Orienting Equations in Theorem Proving of Constrained TRSs Naoki Nishida, Tsubasa Sakata, Masahiko Sakai, Keiichirou Kusakari, Toshiki Sakabe (Nagoya Univ.) SS2008-20 |
In automated theorem proving, we often face cases where the procedure keeps running. To avoid such cases, the theorem p... [more] |
SS2008-20 pp.43-48 |
| SS | 2008-03-03 13:30 |
Nagasaki | Nagasaki Univ. | A Sufficient Condition for Termination of Transformations from Equations to Rewrite Rules Kiyotaka Mizuno, Naoki Nishida, Toshiki Sakabe, Masahiko Sakai, Keiichirou Kusakari (Nagoya Univ.) SS2007-62 |
Several procedures which transform pairs of term rewriting systems (TRSs, for short) and sets of equations into equivale... [more] | SS2007-62 pp.31-36 |
| SS | 2007-12-17 10:45 |
Shimane | Shimane Univ. | On the Acyclicity of Combinators Munehiro Iwami (Shimane Univ.) SS2007-41 |
Sumllyan proposed that combinator L with rewrite rule L x y -> x (y y) and combinator O with rewrite rule O x y -> y... [more] |
SS2007-41 pp.19-24 |
| SS | 2007-08-02 14:00 |
Hokkaido | Hokkaido Univ. | Implicit Induction for Proving Behavioral Equivalence by Equational Rewriting Yuji Sasada, Masahiko Sakai, Naoki Nishida, Toshiki Sakabe, Keiichirou Kusakari (Nagoya Univ.) SS2007-17 |
A behavioral specification is a description of what is supposed to happen. Two states are said to be behaviourally equi... [more] |
SS2007-17 pp.7-12 |
| SS | 2007-06-22 10:10 |
Ishikawa | JAIST | Argument Filtering Method on Second-Order Rewriting System Yasuo Isogai, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, Naoki Nishida (Nagoya Univ.) SS2007-13 |
Higher-order rewrite systems are computation models of functional programming languages, and the termination property is... [more] | SS2007-13 pp.23-28 |
| SS, KBSE | 2006-10-26 13:40 |
Ehime | Ehime University | Approach to Software Verification Based on Transforming from Procedural Programs to Rewrite Systems Yuki Furuichi, Naoki Nishida, Masahiko Sakai, Keiichirou Kusakari, Toshiki Sakabe (Nagoya Univ.) |
In the field of term rewriting, inductionless induction and rewriting induction have been widely studied as methods for... [more] |
SS2006-41 KBSE2006-17 pp.7-12 |
| SS, KBSE | 2006-10-26 16:15 |
Ehime | Ehime University | Example programs generated by GeneSys and proposal of Introduction rule Satoru Kondo, Masahiko Sakai, Naoki Nishida, Toshiki Sakabe, Keiichirou Kusakari (Nagoya Univ.) |
Program Generation System GeneSys is a method for generating executable programs from specifications described in first-... [more] | SS2006-46 KBSE2006-22 pp.37-42 |
| SS | 2006-06-22 14:00 |
Okayama | Transformation of Equational Rewriting Systems for Removing some Equations Koichi Miura, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe, Keiichirou Kusakari (Nagoya Univ.) |
In equational rewriting, which is rewriting modulo equations, the set of all direct successors from a given term is in g... [more] | SS2006-14 pp.7-12 |
|
| SS | 2006-02-03 10:30 |
Fukuoka | Fukuoka Laboratory for Emerging and Enabling Technology of SoC | Lexicographic Path Ordering for Proving Termination of Functional Programs Yumi Hoshino, Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe, Naoki Nishida (Nagoya Univ.) |
Term rewriting system is a computational model of functional programs, and termination is one of the important propertie... [more] | SS2005-85 pp.13-18 |
| SS | 2005-12-20 10:15 |
Kochi | Kochi Women's University | Enhancing Dependency Pair Method by Strong Computability in Simply-Typed Term Rewriting Systems Keiichirou Kusakari, Masahiko Sakai (Nagoya Univ.) |
We enhance the dependency pair method to prove termination by recursive structure analysis in the simply-typed term rewr... [more] | SS2005-65 pp.13-18 |
| SS | 2005-10-13 16:15 |
Saitama | Jumonji University | On Completeness of Outermost Strategy for Overlapping TRSs Atsushi Iwata, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe (Nagoya Univ.) |
Strategies in term rewriting systems (TRSs) indicate a position of a given term to be reduced. Since a term generally ha... [more] | SS2005-46 pp.39-44 |
| SS | 2005-06-24 10:45 |
Nagano | Shinshu Univ. Ohta-Kokusai-Kinenkan | On Proving Termination of Simply-Typed Term Rewriting Systems Based on Strong Computability Keiichirou Kusakari, Takahiro Sakurai, Naoki Nishida, Masahiko Sakai, Toshiki Sakabe (Nagoya Univ.) |
Terminating functional programs are safe in execution, and valuable because their reduction relations are suitable for i... [more] | SS2005-21 pp.19-24 |
| SS | 2005-06-24 11:45 |
Nagano | Shinshu Univ. Ohta-Kokusai-Kinenkan | Dependency Graph Method for Proving Termination of Narrowing Koichi Miura, Naoki Nishida, Masahiko Sakai, Keiichirou Kusakari, Toshiki Sakabe (Nagoya Univ.) |
Term rewriting systems with extra variables (called EV-TRSs) has an ability to represent inverse-computation programs, a... [more] | SS2005-23 pp.31-36 |
| COMP | 2005-03-18 10:25 |
Tokyo | Tokyo Institute of Technology | AC-termination by modified monotonic AC-compatible semantic path orderings Hideyuki Ochiai, Takahito Aoto, Yoshihito Toyama (Tohoku Univ.) |
AC term rewriting is a computational model that deals the rewrite relation modulo AC (associative-commutative law). Vari... [more] | COMP2004-76 pp.23-31 |
[Return to Top Page]