Toshiki Sakabe

Publication Activity (10 Years)

Years Active: 1978-2015
Publications (10 Years): 0

Top Topics

Term Rewrite Systems

Top Venues

Sci. Comput. Program.

Publications

Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe
A unified ordering for termination proving. Sci. Comput. Program. 111 (2015)
Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe
Nagoya Termination Tool. RTA-TLCA (2014)
Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe
A Unified Ordering for Termination Proving. CoRR (2014)
Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe
Nagoya Termination Tool. CoRR (2014)
Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe
Unifying the Knuth-Bendix, recursive path and polynomial orders. PPDP (2013)
Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe, Masahiko Sakai, Naoki Nishida
A Sound Type System for Typing Runtime Errors. Inf. Media Technol. 7 (2) (2012)
Masanori Nagashima, Masahiko Sakai, Toshiki Sakabe
Determinization of conditional term rewriting systems. Theor. Comput. Sci. 464 (2012)
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity Log. Methods Comput. Sci. 8 (3) (2012)
Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe
Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems. Inf. Media Technol. 6 (4) (2011)
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity. RTA (2011)
Tsubasa Sakata, Naoki Nishida, Toshiki Sakabe
On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs. WFLP (2011)
Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe
Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs. IEICE Trans. Inf. Syst. (5) (2010)
Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems. Electron. Notes Theor. Comput. Sci. 204 (2008)
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
Partial Inversion of Constructor Term Rewriting Systems. RTA (2005)
Keiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe
Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting. IEICE Trans. Inf. Syst. (12) (2005)
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
Narrowing-based simulation of term rewriting systems with extra variables. Electron. Notes Theor. Comput. Sci. 86 (3) (2003)
Nobuo Kawaguchi, Toshiki Sakabe, Yasuyoshi Inagaki
TERSE: A Visual Environment for Supporting Analysis, Verification and Transformation of Term Rewriting Systems. AMAST (1996)
Su Feng, Toshiki Sakabe, Yasuyoshi Inagaki
Mechanizing Explicit Inductive Equational Reasoning by DTRC. IEICE Trans. Inf. Syst. (2) (1995)
Su Feng, Toshiki Sakabe, Yasuyoshi Inagaki
Dynamic Term Rewriting Calculus and Its Application to Inductive Equational Reasoning. DISCO (1993)
Shoji Yuen, Toshiki Sakabe, Yasuyoshi Inagaki
An Extension of the Testing Method for Processes Passing Infinite Values. NAPAW (1992)
Masahiko Sakai, Toshiki Sakabe, Yasuyoshi Inagaki
Algebraic specification and automatic generation of compilers. Systems and Computers in Japan 23 (2) (1992)
Shoji Yuen, Toshiki Sakabe, Yasuyoshi Inagaki
A formal description of monitors by CCS. Systems and Computers in Japan 23 (1) (1992)
Hidehiko Kita, Toshiki Sakabe, Yasuyoshi Inagaki
Algebraic Specification Method of Programming Languages. RIMS Symposia on Software Science and Engineering (1984)
Toshiki Sakabe, Yasuyoshi Inagaki, Namio Honda
Specification of Abstract Data Types with Partially Defined Operations. ICSE (1982)
Yasuyoshi Inagaki, Toshiki Sakabe, Teruo Fukumura
Addressable Approximations to Nonaddressable Data Graphs. J. Comput. Syst. Sci. 17 (1) (1978)