default search action
Toshiki Sakabe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
- [j12]Akihisa Yamada
, Keiichirou Kusakari, Toshiki Sakabe:
A unified ordering for termination proving. Sci. Comput. Program. 111: 110-134 (2015) - 2014
- [c12]Akihisa Yamada
Nagoya Termination Tool. RTA-TLCA 2014: 466-475 - [i2]Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe:
A Unified Ordering for Termination Proving. CoRR abs/1404.6245 (2014) - [i1]Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe:
Nagoya Termination Tool. CoRR abs/1404.6626 (2014) - 2013
- [c11]Akihisa Yamada
Unifying the Knuth-Bendix, recursive path and polynomial orders. PPDP 2013: 181-192 - 2012
- [j11]Naoki Nishida, Masahiko Sakai
Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity. Log. Methods Comput. Sci. 8(3) (2012) - [j10]Akihisa Yamada, Keiichirou Kusakari, Toshiki Sakabe, Masahiko Sakai, Naoki Nishida:
A Sound Type System for Typing Runtime Errors. Inf. Media Technol. 7(2): 667-675 (2012) - [j9]Masanori Nagashima, Masahiko Sakai
Determinization of conditional term rewriting systems. Theor. Comput. Sci. 464: 72-89 (2012) - 2011
- [j8]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): 1185-1208 (2011) - [c10]Naoki Nishida, Masahiko Sakai
Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity. RTA 2011: 267-282 - [c9]Tsubasa Sakata, Naoki Nishida, Toshiki Sakabe:
On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs. WFLP 2011: 138-155 - 2010
- [j7]Keita Uchiyama, Masahiko Sakai
Decidability of Termination and Innermost Termination for Term Rewriting Systems with Right-Shallow Dependency Pairs. IEICE Trans. Inf. Syst. 93-D(5): 953-962 (2010)
2000 – 2009
- 2009
- [j6]Yoshiharu Kojima, Masahiko Sakai, Naoki Nishida, Keiichirou Kusakari, Toshiki Sakabe:
Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems. Inf. Media Technol. 4(4): 802-814 (2009) - 2007
- [c8]Keita Uchiyama, Masahiko Sakai
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems. WRS@RDP 2007: 21-34 - 2005
- [j5]Keiichirou Kusakari, Masahiko Sakai
Primitive Inductive Theorems Bridge Implicit Induction Methods and Inductive Theorems in Higher-Order Rewriting. IEICE Trans. Inf. Syst. 88-D(12): 2715-2726 (2005) - [c7]Naoki Nishida, Masahiko Sakai
Partial Inversion of Constructor Term Rewriting Systems. RTA 2005: 264-278 - 2003
- [c6]Naoki Nishida, Masahiko Sakai
Narrowing-based simulation of term rewriting systems with extra variables. WFLP 2003: 52-69
1990 – 1999
- 1996
- [c5]Nobuo Kawaguchi
TERSE: A Visual Environment for Supporting Analysis, Verification and Transformation of Term Rewriting Systems. AMAST 1996: 571-574 - 1995
- [j4]Su Feng, Toshiki Sakabe, Yasuyoshi Inagaki:
Mechanizing Explicit Inductive Equational Reasoning by DTRC. IEICE Trans. Inf. Syst. 78-D(2): 113-121 (1995) - 1993
- [c4]Su Feng, Toshiki Sakabe, Yasuyoshi Inagaki:
Dynamic Term Rewriting Calculus and Its Application to Inductive Equational Reasoning. DISCO 1993: 256-271 - 1992
- [j3]Shoji Yuen, Toshiki Sakabe, Yasuyoshi Inagaki:
A formal description of monitors by CCS. Syst. Comput. Jpn. 23(1): 1-14 (1992) - [j2]Masahiko Sakai
Algebraic specification and automatic generation of compilers. Syst. Comput. Jpn. 23(2): 1-13 (1992) - [c3]Shoji Yuen, Toshiki Sakabe, Yasuyoshi Inagaki:
An Extension of the Testing Method for Processes Passing Infinite Values. NAPAW 1992: 155-173
1980 – 1989
- 1984
- [c2]Hidehiko Kita, Toshiki Sakabe, Yasuyoshi Inagaki:
Algebraic Specification Method of Programming Languages. RIMS Symposia on Software Science and Engineering 1984: 144-157 - 1982
- [c1]Toshiki Sakabe, Yasuyoshi Inagaki, Namio Honda:
Specification of Abstract Data Types with Partially Defined Operations. ICSE 1982: 218-224
1970 – 1979
- 1978
- [j1]Yasuyoshi Inagaki, Toshiki Sakabe, Teruo Fukumura:
Addressable Approximations to Nonaddressable Data Graphs. J. Comput. Syst. Sci. 17(1): 1-34 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 01:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: