 | 2008 |
|---|
| 10 |       | 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) |
| 2005 |
|---|
| 9 | | Naoki Nishida,
Masahiko Sakai,
Toshiki Sakabe:
Partial Inversion of Constructor Term Rewriting Systems.
RTA 2005: 264-278 |
| 8 | | 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) |
| 2003 |
|---|
| 7 | | Naoki Nishida,
Masahiko Sakai,
Toshiki Sakabe:
Narrowing-based simulation of term rewriting systems with extra variables.
Electr. Notes Theor. Comput. Sci. 86(3): (2003) |
| 1996 |
|---|
| 6 |  | Nobuo Kawaguchi,
Toshiki Sakabe,
Yasuyoshi Inagaki:
TERSE: A Visual Environment for Supporting Analysis, Verification and Transformation of Term Rewriting Systems.
AMAST 1996: 571-574 |
| 1993 |
|---|
| 5 | | Su Feng,
Toshiki Sakabe,
Yasuyoshi Inagaki:
Dynamic Term Rewriting Calculus and Its Application to Inductive Equational Reasoning.
DISCO 1993: 256-271 |
| 1992 |
|---|
| 4 | | Shoji Yuen,
Toshiki Sakabe,
Yasuyoshi Inagaki:
An Extension of the Testing Method for Processes Passing Infinite Values.
NAPAW 1992: 155-173 |
| 1984 |
|---|
| 3 | | Hidehiko Kita,
Toshiki Sakabe,
Yasuyoshi Inagaki:
Algebraic Specification Method of Programming Languages.
RIMS Symposia on Software Science and Engineering 1984: 144-157 |
| 1982 |
|---|
| 2 | | Toshiki Sakabe,
Yasuyoshi Inagaki,
Namio Honda:
Specification of Abstract Data Types with Partially Defined Operations.
ICSE 1982: 218-224 |
| 1978 |
|---|
| 1 | | Yasuyoshi Inagaki,
Toshiki Sakabe,
Teruo Fukumura:
Addressable Approximations to Nonaddressable Data Graphs.
J. Comput. Syst. Sci. 17(1): 1-34 (1978) |
