 | 2009 |
|---|
| 16 |       | Naoki Nishida,
Masahiko Sakai:
Completion after Program Inversion of Injective Functions.
Electr. Notes Theor. Comput. Sci. 237: 39-56 (2009) |
| 15 | | Keiichirou Kusakari,
Masahiko Sakai:
Static Dependency Pair Method for Simply-Typed Term Rewriting and Related Techniques.
IEICE Transactions 92-D(2): 235-247 (2009) |
| 2008 |
|---|
| 14 | | Yoshiharu Kojima,
Masahiko Sakai:
Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems.
RTA 2008: 187-201 |
| 13 | | Keita Uchiyama,
Masahiko Sakai,
Toshiki Sakabe:
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems.
Electr. Notes Theor. Comput. Sci. 204: 21-34 (2008) |
| 12 | | Masahiko Sakai,
Yi Wang:
Undecidable Properties on Length-Two String Rewriting Systems.
Electr. Notes Theor. Comput. Sci. 204: 53-69 (2008) |
| 2007 |
|---|
| 11 | | Keiichirou Kusakari,
Masahiko Sakai:
Enhancing dependency pair method using strong computability in simply-typed term rewriting.
Appl. Algebra Eng. Commun. Comput. 18(5): 407-431 (2007) |
| 10 | | Naoki Nishida,
Tomohiro Mizutani,
Masahiko Sakai:
Transformation for Refining Unraveled Conditional Term Rewriting Systems.
Electr. Notes Theor. Comput. Sci. 174(10): 75-95 (2007) |
| 2006 |
|---|
| 9 | | Yi Wang,
Masahiko Sakai:
Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems.
RTA 2006: 343-356 |
| 2005 |
|---|
| 8 | | Naoki Nishida,
Masahiko Sakai,
Toshiki Sakabe:
Partial Inversion of Constructor Term Rewriting Systems.
RTA 2005: 264-278 |
| 7 | | Keiichirou Kusakari,
Masahiko Sakai,
Toshiki Sakabe:
Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting.
IEICE Transactions 88-D(12): 2715-2726 (2005) |
| 6 | | Masahiko Sakai,
Keiichirou Kusakari:
On Dependency Pair Method for Proving Termination of Higher-Order Rewrite Systems.
IEICE Transactions 88-D(3): 583-593 (2005) |
| 2003 |
|---|
| 5 | | Naoki Nishida,
Masahiko Sakai,
Toshiki Sakabe:
Narrowing-based simulation of term rewriting systems with extra variables.
Electr. Notes Theor. Comput. Sci. 86(3): (2003) |
| 2002 |
|---|
| 4 | | Hideto Kasuya,
Masahiko Sakai,
Kiyoshi Agusa:
Descendants and Head Normalization of Higher-Order Rewrite Systems.
FLOPS 2002: 198-211 |
| 1998 |
|---|
| 3 | | Masahiko Sakai,
Yoshihito Toyama:
Semantics and Strong Sequentiality of Priority Term Rewriting Systems.
Theor. Comput. Sci. 208(1-2): 87-110 (1998) |
| 1997 |
|---|
| 2 | | Takeshi Hamaguchi,
Masahiko Sakai,
Shinichirou Yamamoto,
Kiyoshi Agusa:
Algebraic specification with provision for the automatic addition of error descriptions.
Systems and Computers in Japan 28(1): 1-9 (1997) |
| 1996 |
|---|
| 1 | | Masahiko Sakai,
Yoshihito Toyama:
Semantics and Strong Sequentiality of Priority Term Rewriting Systems.
RTA 1996: 377-391 |
