default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNaoki Nishida 0001
Person information
- affiliation: Nagoya University, Japan
- not to be confused with: Naoki Nishida 0003
Other persons with the same name
- Naoki Nishida 0002 — Nara Institute of Science, Japan
- Naoki Nishida 0003 — Nagoya University, Japan
- Naoki Nishida 0004 — Kwansei Gakuin University, Hyoko, Japan
- Naoki Nishida 0005 — King Abdullah University of Science and Technology, Thuwal, Saudi Arabia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j18]Misaki Kojima
, Naoki Nishida, Yutaka Matsubara:
Transforming concurrent programs with semaphores into logically constrained term rewrite systems. J. Log. Algebraic Methods Program. 143: 101033 (2025)- 2024
- [j17]Misaki Kojima, Naoki Nishida:
A Sufficient Condition of Logically Constrained Term Rewrite Systems for Decidability of All-path Reachability Problems with Constant Destinations. J. Inf. Process. 32: 417-435 (2024) - [c39]Takahito Aoto, Naoki Nishida, Jonas Schöpf:
Equational Theories and Validity for Logically Constrained Term Rewriting. FSCD 2024: 31:1-31:21 - [c38]Misaki Kojima, Naoki Nishida:
On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems Under Process Fairness. RP 2024: 54-70 - [i6]Takahito Aoto, Naoki Nishida, Jonas Schöpf:
Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version). CoRR abs/2405.01174 (2024) - 2023
- [j16]Misaki Kojima, Naoki Nishida:
Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting. J. Log. Algebraic Methods Program. 135: 100903 (2023) - [c37]Misaki Kojima, Naoki Nishida:
From Starvation Freedom to All-Path Reachability Problems in Constrained Rewriting. PADL 2023: 161-179 - [i5]Ayuka Matsumi, Naoki Nishida, Misaki Kojima, Donghoon Shin:
On Singleton Self-Loop Removal for Termination of LCTRSs with Bit-Vector Arithmetic. CoRR abs/2307.14094 (2023) - 2022
- [j15]Shujun Zhang, Naoki Nishida:
Transforming orthogonal inductive definition sets into confluent term rewrite systems. J. Log. Algebraic Methods Program. 127: 100779 (2022) - [c36]Shujun Zhang, Naoki Nishida:
On Transforming Cut- and Quantifier-Free Cyclic Proofs into Rewriting-Induction Proofs. FLOPS 2022: 262-281 - 2021
- [j14]Naoki Nishida, Minami Niwa:
Determinization of inverted grammar programs via context-free expressions. J. Log. Algebraic Methods Program. 122: 100688 (2021) - [j13]Carlos Galindo, Naoki Nishida, Josep Silva, Salvador Tamarit:
Reversible CSP Computations. IEEE Trans. Parallel Distributed Syst. 32(6): 1425-1436 (2021) - 2020
- [c35]Carlos Galindo, Naoki Nishida, Josep Silva, Salvador Tamarit:
ReverCSP: Time-Travelling in CSP Computations. RC 2020: 239-245 - [p1]James Hoey, Ivan Lanese, Naoki Nishida, Irek Ulidowski, Germán Vidal:
A Case Study for Reversible Computing: Reversible Debugging of Concurrent Programs. Selected Results of the COST Action IC1405 2020: 108-127
2010 – 2019
- 2019
- [c34]Naoki Nishida, Germán Vidal:
Characterizing Compatible View Updates in Syntactic Bidirectionalization. RC 2019: 67-83 - 2018
- [j12]Naoki Nishida, Adrián Palacios, Germán Vidal:
Reversible computation in term rewriting. J. Log. Algebraic Methods Program. 94: 128-149 (2018) - [j11]Ivan Lanese, Naoki Nishida, Adrián Palacios, Germán Vidal:
A theory of reversibility for Erlang. J. Log. Algebraic Methods Program. 100: 71-97 (2018) - [j10]Takahiro Nagao, Naoki Nishida:
Rewriting induction for constrained inequalities. Sci. Comput. Program. 155: 76-102 (2018) - [c33]Ivan Lanese, Naoki Nishida, Adrián Palacios, Germán Vidal:
CauDEr: A Causal-Consistent Reversible Debugger for Erlang. FLOPS 2018: 247-263 - [c32]Naoki Nishida, Yuya Maeda:
Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems. FSCD 2018: 26:1-26:20 - [c31]Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, Harald Zankl:
Confluence Competition 2018. FSCD 2018: 32:1-32:5 - [c30]Naoki Nishida, Sarah Winkler:
Loop Detection by Logically Constrained Term Rewriting. VSTTE 2018: 309-321 - [c29]Yoshiaki Kanazawa, Naoki Nishida:
On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems. WPTE@FSCD 2018: 34-52 - [c28]Naoki Nishida, Yuya Maeda:
On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions. WPTE@FSCD 2018: 68-87 - [i4]Ivan Lanese, Naoki Nishida, Adrián Palacios, Germán Vidal:
A Theory of Reversibility for Erlang. CoRR abs/1806.07100 (2018) - 2017
- [j9]José Iborra, Naoki Nishida, Germán Vidal, Akihisa Yamada:
Relative Termination via Dependency Pairs. J. Autom. Reason. 58(3): 391-411 (2017) - [j8]Carsten Fuhs, Cynthia Kop, Naoki Nishida:
Verifying Procedural Programs via Constrained Rewriting Induction. ACM Trans. Comput. Log. 18(2): 14:1-14:50 (2017) - [c27]Shinnosuke Mizutani, Naoki Nishida:
Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction. WPTE@FSCD 2017: 35-51 - [c26]Tomohiro Sasano, Naoki Nishida, Masahiko Sakai, Tomoya Ueyama:
Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers. WPTE@FSCD 2017: 82-97 - [i3]Naoki Nishida, Adrián Palacios, Germán Vidal:
Reversible Computation in Term Rewriting. CoRR abs/1710.02804 (2017) - 2016
- [c25]Naoki Nishida, Adrián Palacios, Germán Vidal:
A Reversible Semantics for Erlang. LOPSTR 2016: 259-274 - [c24]Takahiro Nagao, Naoki Nishida:
Proving inductive validity of constrained inequalities. PPDP 2016: 50-61 - [c23]Naoki Nishida, Adrián Palacios, Germán Vidal:
Reversible Term Rewriting. FSCD 2016: 28:1-28:18 - [c22]Ryota Nakayama, Naoki Nishida, Masahiko Sakai:
Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems. WPTE@FSCD 2016: 62-77 - [i2]Naoki Nishida, Adrián Palacios, Germán Vidal:
Towards Reversible Computation in Erlang. CoRR abs/1608.05521 (2016) - 2015
- [j7]Naoki Nishida, Germán Vidal:
A framework for computing finite SLD trees. J. Log. Algebraic Methods Program. 84(2): 197-217 (2015) - [c21]Takahito Aoto, Nao Hirokawa, Julian Nagele, Naoki Nishida, Harald Zankl:
Confluence Competition 2015. CADE 2015: 101-104 - [c20]José Iborra, Naoki Nishida, Germán Vidal, Akihisa Yamada:
Reducing Relative Termination to Dependency Pair Problems. CADE 2015: 163-178 - [c19]Cynthia Kop, Naoki Nishida:
Constrained Term Rewriting tooL. LPAR 2015: 549-557 - [e1]Yuki Chiba, Santiago Escobar, Naoki Nishida, David Sabel, Manfred Schmidt-Schauß:
2nd International Workshop on Rewriting Techniques for Program Transformations and Evaluation, WPTE@RDP 2015, July 2, 2015, Warsaw, Poland. OASIcs 46, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-94-1 [contents] - 2014
- [j6]Naoki Nishida, Germán Vidal:
Conversion to tail recursion in term rewriting. J. Log. Algebraic Methods Program. 83(1): 53-63 (2014) - [c18]Cynthia Kop, Naoki Nishida:
Automatic Constrained Rewriting Induction towards Verifying Procedural Programs. APLAS 2014: 334-353 - [c17]Karl Gmeiner, Naoki Nishida:
Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems. WPTE@RTA/TLCA 2014: 3-14 - [c16]Masanori Nagashima, Tomofumi Kato, Masahiko Sakai, Naoki Nishida:
Inverse Unfold Problem and Its Heuristic Solving. WPTE@RTA/TLCA 2014: 27-38 - [c15]Naoki Nishida, Makishi Yanagisawa, Karl Gmeiner:
On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings. WPTE@RTA/TLCA 2014: 39-50 - [i1]Cynthia Kop, Naoki Nishida:
Towards Verifying Procedural Programs using Constrained Rewriting Induction. CoRR abs/1409.0166 (2014) - 2013
- [c14]Cynthia Kop, Naoki Nishida:
Term Rewriting with Logical Constraints. FroCos 2013: 343-358 - [c13]Naoki Nishida, Germán Vidal:
A Finite Representation of the Narrowing Space. LOPSTR 2013: 54-71 - [c12]Naoki Nishida, Masahiko Sakai, Yasuhiro Nakano:
On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms. TTATT 2013: 1-10 - 2012
- [j5]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) - [j4]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) - [c11]Naoki Nishida, Germán Vidal:
Computing More Specific Versions of Conditional Rewriting Systems. LOPSTR 2012: 137-154 - [c10]Minami Niwa, Naoki Nishida, Masahiko Sakai:
Improving Determinization of Grammar Programs for Program Inversion. LOPSTR 2012: 155-175 - 2011
- [j3]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) - [c9]Naoki Nishida, Masahiko Sakai, Toshiki Sakabe:
Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity. RTA 2011: 267-282 - [c8]Naoki Nishida, Germán Vidal:
Program Inversion for Tail Recursive Functions. RTA 2011: 283-298 - [c7]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
- [j2]Naoki Nishida, Germán Vidal:
Termination of narrowing via termination of rewriting. Appl. Algebra Eng. Commun. Comput. 21(3): 177-225 (2010) - [c6]Naoki Nishida, Masahiko Sakai:
Proving Injectivity of Functions via Program Inversion in Term Rewriting. FLOPS 2010: 288-303
2000 – 2009
- 2009
- [j1]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) - [c5]José Iborra, Naoki Nishida, Germán Vidal:
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing. LOPSTR 2009: 52-66 - 2008
- [c4]Naoki Nishida, Masahiko Sakai:
Completion after Program Inversion of Injective Functions. WRS@RTA 2008: 39-56 - 2006
- [c3]Naoki Nishida, Tomohiro Mizutani, Masahiko Sakai:
Transformation for Refining Unraveled Conditional Term Rewriting Systems. WRS@FLoC 2006: 75-95 - 2005
- [c2]Naoki Nishida, Masahiko Sakai, Toshiki Sakabe:
Partial Inversion of Constructor Term Rewriting Systems. RTA 2005: 264-278 - 2003
- [c1]Naoki Nishida, Masahiko Sakai, Toshiki Sakabe:
Narrowing-based simulation of term rewriting systems with extra variables. WFLP 2003: 52-69
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 2025-01-09 20:39 CET 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:
