Addressable Approximations to Nonaddressable Data Graphs. - Yasuyoshi Inagaki; Toshiki Sakabe; Teruo Fukumura (J. Comput. Syst. Sci., 1978)

Specification of Abstract Data Types with Partially Defined Operations. - Toshiki Sakabe; Yasuyoshi Inagaki; Namio Honda (ICSE, 1982)

Algebraic Specification Method of Programming Languages. - Hidehiko Kita; Toshiki Sakabe; Yasuyoshi Inagaki (RIMS Symposia on Software Science and Engineering, 1984)

An Extension of the Testing Method for Processes Passing Infinite Values. - Shoji Yuen; Toshiki Sakabe; Yasuyoshi Inagaki (NAPAW, 1992)

Algebraic specification and automatic generation of compilers. - Masahiko Sakai; Toshiki Sakabe; Yasuyoshi Inagaki (Syst. Comput. Jpn., 1992)

A formal description of monitors by CCS. - Shoji Yuen; Toshiki Sakabe; Yasuyoshi Inagaki (Syst. Comput. Jpn., 1992)

Dynamic Term Rewriting Calculus and Its Application to Inductive Equational Reasoning. - Su Feng; Toshiki Sakabe; Yasuyoshi Inagaki (DISCO, 1993)

Mechanizing Explicit Inductive Equational Reasoning by DTRC. - Su Feng; Toshiki Sakabe; Yasuyoshi Inagaki (IEICE Trans. Inf. Syst., 1995)

TERSE: A Visual Environment for Supporting Analysis, Verification and Transformation of Term Rewriting Systems. - Nobuo Kawaguchi; Toshiki Sakabe; Yasuyoshi Inagaki (AMAST, 1996)

Narrowing-based simulation of term rewriting systems with extra variables. - Naoki Nishida 001; Masahiko Sakai; Toshiki Sakabe (WFLP, 2003)

Partial Inversion of Constructor Term Rewriting Systems. - Naoki Nishida 001; Masahiko Sakai; Toshiki Sakabe (RTA, 2005)

Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting. - Keiichirou Kusakari; Masahiko Sakai; Toshiki Sakabe (IEICE Trans. Inf. Syst., 2005)

Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems. - Keita Uchiyama; Masahiko Sakai; Toshiki Sakabe (WRS@RDP, 2007)

Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems. - Yoshiharu Kojima; Masahiko Sakai; Naoki Nishida 001; Keiichirou Kusakari; Toshiki Sakabe (Inf. Media Technol., 2009)

Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs. - Keita Uchiyama; Masahiko Sakai; Toshiki Sakabe (IEICE Trans. Inf. Syst., 2010)

Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity. - Naoki Nishida 001; Masahiko Sakai; Toshiki Sakabe (RTA, 2011)

On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs. - Tsubasa Sakata; Naoki Nishida 001; Toshiki Sakabe (WFLP, 2011)

Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems. - Yoshiharu Kojima; Masahiko Sakai; Naoki Nishida 001; Keiichirou Kusakari; Toshiki Sakabe (Inf. Media Technol., 2011)

Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity - Naoki Nishida 001; Masahiko Sakai; Toshiki Sakabe (Log. Methods Comput. Sci., 2012)

A Sound Type System for Typing Runtime Errors. - Akihisa Yamada 002; Keiichirou Kusakari; Toshiki Sakabe; Masahiko Sakai; Naoki Nishida 001 (Inf. Media Technol., 2012)

Determinization of conditional term rewriting systems. - Masanori Nagashima; Masahiko Sakai; Toshiki Sakabe (Theor. Comput. Sci., 2012)

Unifying the Knuth-Bendix, recursive path and polynomial orders. - Akihisa Yamada 002; Keiichirou Kusakari; Toshiki Sakabe (PPDP, 2013)

Nagoya Termination Tool. - Akihisa Yamada 002; Keiichirou Kusakari; Toshiki Sakabe (RTA-TLCA, 2014)

A unified ordering for termination proving. - Akihisa Yamada 002; Keiichirou Kusakari; Toshiki Sakabe (Sci. Comput. Program., 2015)