The following pages link to Naoki Nishida (Q969618):
Displaying 42 items.
- Termination of narrowing via termination of rewriting (Q969619) (← links)
- Loop detection by logically constrained term rewriting (Q1629968) (← links)
- Cauder: a causal-consistent reversible debugger for Erlang (Q1648893) (← links)
- Reversible computation in term rewriting (Q1683707) (← links)
- A theory of reversibility for Erlang (Q1785852) (← links)
- Determinization of inverted grammar programs via context-free expressions (Q1979968) (← links)
- ReverCSP: time-travelling in CSP computations (Q2039907) (← links)
- Transforming orthogonal inductive definition sets into confluent term rewrite systems (Q2141298) (← links)
- On transforming cut- and quantifier-free cyclic proofs into rewriting-induction proofs (Q2163179) (← links)
- A framework for computing finite SLD trees (Q2258840) (← links)
- Relative termination via dependency pairs (Q2360875) (← links)
- A reversible semantics for Erlang (Q2409740) (← links)
- Conversion to tail recursion in term rewriting (Q2436518) (← links)
- Automatic Constrained Rewriting Induction towards Verifying Procedural Programs (Q2789055) (← links)
- (Q2844056) (← links)
- Computing More Specific Versions of Conditional Rewriting Systems (Q2848903) (← links)
- Improving Determinization of Grammar Programs for Program Inversion (Q2848904) (← links)
- Term Rewriting with Logical Constraints (Q2849501) (← links)
- Transformation for Refining Unraveled Conditional Term Rewriting Systems (Q2866802) (← links)
- Soundness of Unravelings for Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity (Q2904621) (← links)
- A Finite Representation of the Narrowing Space (Q3453648) (← links)
- Confluence Competition 2015 (Q3454083) (← links)
- Reducing Relative Termination to Dependency Pair Problems (Q3454090) (← links)
- Constrained Term Rewriting tooL (Q3460083) (← links)
- Goal-Directed and Relative Dependency Pairs for Proving the Termination of Narrowing (Q3558285) (← links)
- Proving Injectivity of Functions via Program Inversion in Term Rewriting (Q3558345) (← links)
- Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems (Q4993358) (← links)
- (Q4993364) (← links)
- (Q4994129) (← links)
- Completion after Program Inversion of Injective Functions (Q5170160) (← links)
- On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs (Q5200103) (← links)
- Characterizing Compatible View Updates in Syntactic Bidirectionalization (Q5237214) (← links)
- Notes on Structure-Preserving Transformations of Conditional Term Rewrite Systems (Q5240131) (← links)
- Inverse Unfold Problem and Its Heuristic Solving (Q5240134) (← links)
- On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings (Q5240136) (← links)
- Verifying Procedural Programs via Constrained Rewriting Induction (Q5278212) (← links)
- Reversible Term Rewriting (Q5369493) (← links)
- Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity (Q5389086) (← links)
- Program Inversion for Tail Recursive Functions (Q5389087) (← links)
- Term Rewriting and Applications (Q5703855) (← links)
- Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting (Q6052950) (← links)
- Transforming concurrent programs with semaphores into logically constrained term rewrite systems (Q6671788) (← links)
