Toshiki Sakabe - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 20 from 20

2015

A unified ordering for termination provingAkihisa Yamada 0002, Keiichirou Kusakari, Toshiki Sakabe. SCP, 111:110-134, 2015. [doi]

2014

Nagoya Termination ToolAkihisa Yamada 0002, Keiichirou Kusakari, Toshiki Sakabe. RTA 2014: 466-475 [doi]

2013

Unifying the Knuth-Bendix, recursive path and polynomial ordersAkihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe. ppdp 2013: 181-192 [doi]

2012

Determinization of conditional term rewriting systemsMasanori Nagashima, Masahiko Sakai, Toshiki Sakabe. TCS, 464:72-89, 2012. [doi]

2011

Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to LinearityNaoki Nishida, Masahiko Sakai, Toshiki Sakabe. RTA 2011: 267-282 [doi]

On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency GraphsTsubasa Sakata, Naoki Nishida, Toshiki Sakabe. wflp 2011: 138-155 [doi]

2010

Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency PairsKeita Uchiyama, Masahiko Sakai, Toshiki Sakabe. ieicet, 93-D(5):953-962, 2010. [doi]

2008

Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting SystemsKeita Uchiyama, Masahiko Sakai, Toshiki Sakabe. ENTCS, 204:21-34, 2008. [doi]

2005

Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order RewritingKeiichirou Kusakari, Masahiko Sakai, Toshiki Sakabe. ieicet, 88-D(12):2715-2726, 2005. [doi]

Partial Inversion of Constructor Term Rewriting SystemsNaoki Nishida, Masahiko Sakai, Toshiki Sakabe. RTA 2005: 264-278 [doi]

2003

Narrowing-based simulation of term rewriting systems with extra variablesNaoki Nishida, Masahiko Sakai, Toshiki Sakabe. ENTCS, 86(3):52-69, 2003. [doi]

1996

TERSE: A Visual Environment for Supporting Analysis, Verification and Transformation of Term Rewriting SystemsNobuo Kawaguchi, Toshiki Sakabe, Yasuyoshi Inagaki. amast 1996: 571-574

1995

Mechanizing Explicit Inductive Equational Reasoning by DTRCSu Feng, Toshiki Sakabe, Yasuyoshi Inagaki. ieicet, 78-D(2):113-121, 1995. [doi]

1993

Dynamic Term Rewriting Calculus and Its Application to Inductive Equational ReasoningSu Feng, Toshiki Sakabe, Yasuyoshi Inagaki. disco 1993: 256-271

1992

Algebraic specification and automatic generation of compilersMasahiko Sakai, Toshiki Sakabe, Yasuyoshi Inagaki. scjapan, 23(2):1-13, 1992. [doi]

A formal description of monitors by CCSShoji Yuen, Toshiki Sakabe, Yasuyoshi Inagaki. scjapan, 23(1):1-14, 1992. [doi]

An Extension of the Testing Method for Processes Passing Infinite ValuesShoji Yuen, Toshiki Sakabe, Yasuyoshi Inagaki. napaw 1993: 155-173

1984

Algebraic Specification Method of Programming LanguagesHidehiko Kita, Toshiki Sakabe, Yasuyoshi Inagaki. rims 1986: 144-157

1982

Specification of Abstract Data Types with Partially Defined OperationsToshiki Sakabe, Yasuyoshi Inagaki, Namio Honda. ICSE 1982: 218-224

1978

Addressable Approximations to Nonaddressable Data GraphsYasuyoshi Inagaki, Toshiki Sakabe, Teruo Fukumura. jcss, 17(1):1-34, 1978.

Sign in or sign up to see more results.

runs on WebDSL