Toshiki Sakabe

According to our database, Toshiki Sakabe authored at least 24 papers between 1978 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2015

A unified ordering for termination proving.

Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe

Sci. Comput. Program., 2015

2014

Nagoya Termination Tool.

Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe

Proceedings of the Rewriting and Typed Lambda Calculi - Joint International Conference, 2014

2013

Unifying the Knuth-Bendix, recursive path and polynomial orders.

Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe

Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

2012

Determinization of conditional term rewriting systems.

Masanori Nagashima, Masahiko Sakai, Toshiki Sakabe

Theor. Comput. Sci., 2012

A Sound Type System for Typing Runtime Errors.

Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe, Masahiko Sakai, Naoki Nishida

Inf. Media Technol., 2012

Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity

Naoki Nishida, Masahiko Sakai, Toshiki Sakabe

Log. Methods Comput. Sci., 2012

2011

Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems.

Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe

Inf. Media Technol., 2011

On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs.

Tsubasa Sakata, Naoki Nishida, Toshiki Sakabe

Proceedings of the Functional and Constraint Logic Programming, 2011

Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity.

Naoki Nishida, Masahiko Sakai, Toshiki Sakabe

Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

2010

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

2009

Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems.

Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe

Inf. Media Technol., 2009

2007

Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems.

Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe

Proceedings of the 7th International Workshop on Reduction Strategies in Rewriting and Programming, 2007

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

Partial Inversion of Constructor Term Rewriting Systems.

Naoki Nishida, Masahiko Sakai, Toshiki Sakabe

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

2003

Narrowing-based simulation of term rewriting systems with extra variables.

Naoki Nishida, Masahiko Sakai, Toshiki Sakabe

Proceedings of the 12th International Workshop on Functional and Constraint Logic Programming, 2003

1996

TERSE: A Visual Environment for Supporting Analysis, Verification and Transformation of Term Rewriting Systems.

Nobuo Kawaguchi, Toshiki Sakabe, Yasuyoshi Inagaki

Proceedings of the Algebraic Methodology and Software Technology, 1996

1995

Mechanizing Explicit Inductive Equational Reasoning by DTRC.

Su Feng, Toshiki Sakabe, Yasuyoshi Inagaki

IEICE Trans. Inf. Syst., 1995

1993

Dynamic Term Rewriting Calculus and Its Application to Inductive Equational Reasoning.

Su Feng, Toshiki Sakabe, Yasuyoshi Inagaki

Proceedings of the Design and Implementation of Symbolic Computation Systems, 1993

1992

A formal description of monitors by CCS.

Shoji Yuen, Toshiki Sakabe, Yasuyoshi Inagaki

Syst. Comput. Jpn., 1992

Algebraic specification and automatic generation of compilers.

Masahiko Sakai, Toshiki Sakabe, Yasuyoshi Inagaki

Syst. Comput. Jpn., 1992

An Extension of the Testing Method for Processes Passing Infinite Values.

Shoji Yuen, Toshiki Sakabe, Yasuyoshi Inagaki

Proceedings of the NAPAW 92, 1992

1984

Algebraic Specification Method of Programming Languages.

Hidehiko Kita, Toshiki Sakabe, Yasuyoshi Inagaki

Proceedings of the RIMS Symposia on Software Science and Engineering II, 1984

1982

Specification of Abstract Data Types with Partially Defined Operations.

Toshiki Sakabe, Yasuyoshi Inagaki, Namio Honda

Proceedings of the Proceedings, 1982

1978

Addressable Approximations to Nonaddressable Data Graphs.

Yasuyoshi Inagaki, Toshiki Sakabe, Teruo Fukumura

J. Comput. Syst. Sci., 1978