Naoki Nishida

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 32

Top Topics

Reversible Watermarking

Top Venues

J. Log. Algebraic Methods Program.

Publications

Takahito Aoto, Naoki Nishida, Jonas Schöpf
Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version). CoRR (2024)
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 (2024)
Takahito Aoto, Naoki Nishida, Jonas Schöpf
Equational Theories and Validity for Logically Constrained Term Rewriting. FSCD (2024)
Misaki Kojima, Naoki Nishida
From Starvation Freedom to All-Path Reachability Problems in Constrained Rewriting. PADL (2023)
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 (2023)
Ayuka Matsumi, Naoki Nishida, Misaki Kojima, Donghoon Shin
On Singleton Self-Loop Removal for Termination of LCTRSs with Bit-Vector Arithmetic. CoRR (2023)
Shujun Zhang, Naoki Nishida
Transforming orthogonal inductive definition sets into confluent term rewrite systems. J. Log. Algebraic Methods Program. 127 (2022)
Shujun Zhang, Naoki Nishida
On Transforming Cut- and Quantifier-Free Cyclic Proofs into Rewriting-Induction Proofs. FLOPS (2022)
Carlos Galindo, Naoki Nishida, Josep Silva, Salvador Tamarit
Reversible CSP Computations. IEEE Trans. Parallel Distributed Syst. 32 (6) (2021)
Naoki Nishida, Minami Niwa
Determinization of inverted grammar programs via context-free expressions. J. Log. Algebraic Methods Program. 122 (2021)
Carlos Galindo, Naoki Nishida, Josep Silva, Salvador Tamarit
ReverCSP: Time-Travelling in CSP Computations. RC (2020)
Naoki Nishida, Germán Vidal
Characterizing Compatible View Updates in Syntactic Bidirectionalization. RC (2019)
Ivan Lanese, Naoki Nishida, Adrián Palacios, Germán Vidal
A theory of reversibility for Erlang. J. Log. Algebraic Methods Program. 100 (2018)
Naoki Nishida, Adrián Palacios, Germán Vidal
Reversible computation in term rewriting. J. Log. Algebraic Methods Program. 94 (2018)
Takahiro Nagao, Naoki Nishida
Rewriting induction for constrained inequalities. Sci. Comput. Program. 155 (2018)
Ivan Lanese, Naoki Nishida, Adrián Palacios, Germán Vidal
CauDEr: A Causal-Consistent Reversible Debugger for Erlang. FLOPS (2018)
Takahito Aoto, Makoto Hamana, Nao Hirokawa, Aart Middeldorp, Julian Nagele, Naoki Nishida, Kiraku Shintani, Harald Zankl
Confluence Competition 2018. FSCD (2018)
Naoki Nishida, Yuya Maeda
On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions. WPTE@FSCD (2018)
Naoki Nishida, Sarah Winkler
Loop Detection by Logically Constrained Term Rewriting. VSTTE (2018)
Ivan Lanese, Naoki Nishida, Adrián Palacios, Germán Vidal
A Theory of Reversibility for Erlang. CoRR (2018)
Yoshiaki Kanazawa, Naoki Nishida
On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems. WPTE@FSCD (2018)
Naoki Nishida, Yuya Maeda
Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems. FSCD (2018)
Tomohiro Sasano, Naoki Nishida, Masahiko Sakai, Tomoya Ueyama
Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers. WPTE@FSCD (2017)
José Iborra, Naoki Nishida, Germán Vidal, Akihisa Yamada
Relative Termination via Dependency Pairs. J. Autom. Reason. 58 (3) (2017)
Naoki Nishida, Adrián Palacios, Germán Vidal
Reversible Computation in Term Rewriting. CoRR (2017)
Shinnosuke Mizutani, Naoki Nishida
Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction. WPTE@FSCD (2017)
Carsten Fuhs, Cynthia Kop, Naoki Nishida
Verifying Procedural Programs via Constrained Rewriting Induction. ACM Trans. Comput. Log. 18 (2) (2017)
Takahiro Nagao, Naoki Nishida
Proving inductive validity of constrained inequalities. PPDP (2016)
Ryota Nakayama, Naoki Nishida, Masahiko Sakai
Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems. WPTE@FSCD (2016)
Naoki Nishida, Adrián Palacios, Germán Vidal
Towards Reversible Computation in Erlang. CoRR (2016)
Naoki Nishida, Adrián Palacios, Germán Vidal
Reversible Term Rewriting. FSCD (2016)
Naoki Nishida, Adrián Palacios, Germán Vidal
A Reversible Semantics for Erlang. LOPSTR (2016)
Cynthia Kop, Naoki Nishida
Constrained Term Rewriting tooL. LPAR (2015)
José Iborra, Naoki Nishida, Germán Vidal, Akihisa Yamada
Reducing Relative Termination to Dependency Pair Problems. CADE (2015)
Takahito Aoto, Nao Hirokawa, Julian Nagele, Naoki Nishida, Harald Zankl
Confluence Competition 2015. CADE (2015)
Naoki Nishida, Germán Vidal
A framework for computing finite SLD trees. J. Log. Algebraic Methods Program. 84 (2) (2015)
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)
Masanori Nagashima, Tomofumi Kato, Masahiko Sakai, Naoki Nishida
Inverse Unfold Problem and Its Heuristic Solving. WPTE@RTA/TLCA (2014)
Naoki Nishida, Germán Vidal
Conversion to tail recursion in term rewriting. J. Log. Algebraic Methods Program. 83 (1) (2014)
Karl Gmeiner, Naoki Nishida
Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems. WPTE@RTA/TLCA (2014)
Cynthia Kop, Naoki Nishida
Towards Verifying Procedural Programs using Constrained Rewriting Induction. CoRR (2014)
Cynthia Kop, Naoki Nishida
Automatic Constrained Rewriting Induction towards Verifying Procedural Programs. APLAS (2014)
Cynthia Kop, Naoki Nishida
Term Rewriting with Logical Constraints. FroCos (2013)
Naoki Nishida, Masahiko Sakai, Yasuhiro Nakano
On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms. TTATT (2013)
Naoki Nishida, Germán Vidal
A Finite Representation of the Narrowing Space. LOPSTR (2013)
Minami Niwa, Naoki Nishida, Masahiko Sakai
Improving Determinization of Grammar Programs for Program Inversion. LOPSTR (2012)
Naoki Nishida, Germán Vidal
Computing More Specific Versions of Conditional Rewriting Systems. LOPSTR (2012)
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)
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) (2011)
Naoki Nishida, Germán Vidal
Program Inversion for Tail Recursive Functions. RTA (2011)
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity. RTA (2011)
Tsubasa Sakata, Naoki Nishida, Toshiki Sakabe
On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs. WFLP (2011)
Naoki Nishida, Germán Vidal
Termination of narrowing via termination of rewriting. Appl. Algebra Eng. Commun. Comput. 21 (3) (2010)
Naoki Nishida, Masahiko Sakai
Proving Injectivity of Functions via Program Inversion in Term Rewriting. FLOPS (2010)
José Iborra, Naoki Nishida, Germán Vidal
Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing. LOPSTR (2009)
Naoki Nishida, Masahiko Sakai
Completion after Program Inversion of Injective Functions. Electron. Notes Theor. Comput. Sci. 237 (2009)
Naoki Nishida, Tomohiro Mizutani, Masahiko Sakai
Transformation for Refining Unraveled Conditional Term Rewriting Systems. Electron. Notes Theor. Comput. Sci. 174 (10) (2007)
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
Partial Inversion of Constructor Term Rewriting Systems. RTA (2005)
Naoki Nishida, Masahiko Sakai, Toshiki Sakabe
Narrowing-based simulation of term rewriting systems with extra variables. Electron. Notes Theor. Comput. Sci. 86 (3) (2003)