Toshiki Sakabe

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