Naoki Nishida

Orcid: 0000-0001-8697-4970

Affiliations:
  • Nagoya University, Japan


According to our database1, Naoki Nishida authored at least 61 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Sufficient Condition of Logically Constrained Term Rewrite Systems for Decidability of All-path Reachability Problems with Constant Destinations.
J. Inf. Process., 2024

Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version).
CoRR, 2024

On Solving All-Path Reachability Problems for Starvation Freedom of Concurrent Rewrite Systems Under Process Fairness.
Proceedings of the Reachability Problems - 18th International Conference, 2024

Equational Theories and Validity for Logically Constrained Term Rewriting.
Proceedings of the 9th International Conference on Formal Structures for Computation and Deduction, 2024

2023
Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting.
J. Log. Algebraic Methods Program., October, 2023

On Singleton Self-Loop Removal for Termination of LCTRSs with Bit-Vector Arithmetic.
CoRR, 2023

From Starvation Freedom to All-Path Reachability Problems in Constrained Rewriting.
Proceedings of the Practical Aspects of Declarative Languages, 2023

2022
Transforming orthogonal inductive definition sets into confluent term rewrite systems.
J. Log. Algebraic Methods Program., 2022

On Transforming Cut- and Quantifier-Free Cyclic Proofs into Rewriting-Induction Proofs.
Proceedings of the Functional and Logic Programming - 16th International Symposium, 2022

2021
Reversible CSP Computations.
IEEE Trans. Parallel Distributed Syst., 2021

Determinization of inverted grammar programs via context-free expressions.
J. Log. Algebraic Methods Program., 2021

2020
A Case Study for Reversible Computing: Reversible Debugging of Concurrent Programs.
Proceedings of the Reversible Computation: Extending Horizons of Computing, 2020

ReverCSP: Time-Travelling in CSP Computations.
Proceedings of the Reversible Computation - 12th International Conference, 2020

2019
Characterizing Compatible View Updates in Syntactic Bidirectionalization.
Proceedings of the Reversible Computation - 11th International Conference, 2019

2018
Rewriting induction for constrained inequalities.
Sci. Comput. Program., 2018

Reversible computation in term rewriting.
J. Log. Algebraic Methods Program., 2018

A theory of reversibility for Erlang.
J. Log. Algebraic Methods Program., 2018

On Transforming Narrowing Trees into Regular Tree Grammars Generating Ranges of Substitutions.
Proceedings of the Proceedings Fifth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2018

On Transforming Functions Accessing Global Variables into Logically Constrained Term Rewriting Systems.
Proceedings of the Proceedings Fifth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2018

Loop Detection by Logically Constrained Term Rewriting.
Proceedings of the Verified Software. Theories, Tools, and Experiments, 2018

Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems.
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

Confluence Competition 2018.
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

CauDEr: A Causal-Consistent Reversible Debugger for Erlang.
Proceedings of the Functional and Logic Programming - 14th International Symposium, 2018

2017
Verifying Procedural Programs via Constrained Rewriting Induction.
ACM Trans. Comput. Log., 2017

Relative Termination via Dependency Pairs.
J. Autom. Reason., 2017

Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers.
Proceedings of the Proceedings Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2017

Transforming Proof Tableaux of Hoare Logic into Inference Sequences of Rewriting Induction.
Proceedings of the Proceedings Fourth International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2017

2016
Sound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems.
Proceedings of the Proceedings Third International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2016

Towards Reversible Computation in Erlang.
CoRR, 2016

Reversible Term Rewriting.
Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

Proving inductive validity of constrained inequalities.
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, 2016

A Reversible Semantics for Erlang.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2016

2015
A framework for computing finite SLD trees.
J. Log. Algebraic Methods Program., 2015

Constrained Term Rewriting tooL.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2015

Reducing Relative Termination to Dependency Pair Problems.
Proceedings of the Automated Deduction - CADE-25, 2015

Confluence Competition 2015.
Proceedings of the Automated Deduction - CADE-25, 2015

2014
Conversion to tail recursion in term rewriting.
J. Log. Algebraic Methods Program., 2014

Towards Verifying Procedural Programs using Constrained Rewriting Induction.
CoRR, 2014

On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings.
Proceedings of the First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2014

Inverse Unfold Problem and Its Heuristic Solving.
Proceedings of the First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2014

Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems.
Proceedings of the First International Workshop on Rewriting Techniques for Program Transformations and Evaluation, 2014

Automatic Constrained Rewriting Induction towards Verifying Procedural Programs.
Proceedings of the Programming Languages and Systems - 12th Asian Symposium, 2014

2013
On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms.
Proceedings of the Proceedings Second International Workshop on Trends in Tree Automata and Tree Transducers, 2013

A Finite Representation of the Narrowing Space.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2013

Term Rewriting with Logical Constraints.
Proceedings of the Frontiers of Combining Systems, 2013

2012
A Sound Type System for Typing Runtime Errors.
Inf. Media Technol., 2012

Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity
Log. Methods Comput. Sci., 2012

Improving Determinization of Grammar Programs for Program Inversion.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2012

Computing More Specific Versions of Conditional Rewriting Systems.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2012

2011
Decidability of Reachability for Right-shallow Context-sensitive Term Rewriting Systems.
Inf. Media Technol., 2011

On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs.
Proceedings of the Functional and Constraint Logic Programming, 2011

Program Inversion for Tail Recursive Functions.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity.
Proceedings of the 22nd International Conference on Rewriting Techniques and Applications, 2011

2010
Termination of narrowing via termination of rewriting.
Appl. Algebra Eng. Commun. Comput., 2010

Proving Injectivity of Functions via Program Inversion in Term Rewriting.
Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009
Context-sensitive Innermost Reachability is Decidable for Linear Right-shallow Term Rewriting Systems.
Inf. Media Technol., 2009

Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2009

2008
Completion after Program Inversion of Injective Functions.
Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming, 2008

2006
Transformation for Refining Unraveled Conditional Term Rewriting Systems.
Proceedings of the Sixth International Workshop on Reduction Strategies in Rewriting and Programming, 2006

2005
Partial Inversion of Constructor Term Rewriting Systems.
Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

2003
Narrowing-based simulation of term rewriting systems with extra variables.
Proceedings of the 12th International Workshop on Functional and Constraint Logic Programming, 2003


  Loading...