Naoki Nishida

From MaRDI portal
Person:969618

Available identifiers

zbMath Open nishida.naokiMaRDI QIDQ969618

List of research outcomes





PublicationDate of PublicationType
Transforming concurrent programs with semaphores into logically constrained term rewrite systems2025-01-27Paper
Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting2023-09-25Paper
On transforming cut- and quantifier-free cyclic proofs into rewriting-induction proofs2022-08-10Paper
Transforming orthogonal inductive definition sets into confluent term rewrite systems2022-05-25Paper
Determinization of inverted grammar programs via context-free expressions2021-09-03Paper
ReverCSP: time-travelling in CSP computations2021-07-05Paper
https://portal.mardi4nfdi.de/entity/Q49941292021-06-17Paper
Narrowing trees for syntactically deterministic conditional term rewriting systems2021-06-15Paper
https://portal.mardi4nfdi.de/entity/Q49933642021-06-15Paper
Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems2019-10-24Paper
Inverse Unfold Problem and Its Heuristic Solving2019-10-24Paper
On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings2019-10-24Paper
Characterizing Compatible View Updates in Syntactic Bidirectionalization2019-10-17Paper
Loop detection by logically constrained term rewriting2018-12-07Paper
A theory of reversibility for Erlang2018-10-01Paper
Cauder: a causal-consistent reversible debugger for Erlang2018-07-09Paper
Reversible computation in term rewriting2017-12-01Paper
Reversible term rewriting2017-10-17Paper
A reversible semantics for Erlang2017-10-13Paper
Verifying procedural programs via constrained rewriting induction2017-07-13Paper
Relative termination via dependency pairs2017-06-29Paper
Automatic constrained rewriting induction towards verifying procedural programs2016-02-26Paper
Constrained term rewriting tooL2016-01-12Paper
Reducing relative termination to dependency pair problems2015-12-02Paper
Confluence Competition 20152015-12-02Paper
A Finite Representation of the Narrowing Space2015-11-30Paper
A framework for computing finite SLD trees2015-02-27Paper
Completion after program inversion of injective functions2014-07-22Paper
Conversion to tail recursion in term rewriting2014-02-25Paper
Transformation for refining unraveled conditional term rewriting systems2013-12-06Paper
Term Rewriting with Logical Constraints2013-09-20Paper
Computing more specific versions of conditional rewriting systems2013-09-13Paper
Improving determinization of grammar programs for program inversion2013-09-13Paper
Narrowing-based simulation of term rewriting systems with extra variables and its termination proof2013-08-27Paper
Soundness of unravelings for conditional term rewriting systems via ultra-properties related to linearity2012-08-15Paper
Program inversion for tail recursive functions2012-04-24Paper
Soundness of unravelings for deterministic conditional term rewriting systems via ultra-properties related to linearity2012-04-24Paper
On proving termination of constrained term rewrite systems by eliminating edges from dependency graphs2011-07-29Paper
Termination of narrowing via termination of rewriting2010-05-07Paper
Goal-directed and relative dependency pairs for proving the termination of narrowing2010-05-04Paper
Proving injectivity of functions via program inversion in term rewriting2010-05-04Paper
Term Rewriting and Applications2005-11-11Paper

Research outcomes over time

This page was built for person: Naoki Nishida