Reachability in conditional term rewriting systems
From MaRDI portal
Recommendations
Cites work
- Elimination of conditions
- scientific article; zbMATH DE number 1614701 (Why is no real title available?)
- scientific article; zbMATH DE number 4092758 (Why is no real title available?)
- scientific article; zbMATH DE number 1231535 (Why is no real title available?)
- scientific article; zbMATH DE number 2090069 (Why is no real title available?)
- Maude: specification and programming in rewriting logic
- Reachability analysis of term rewriting systems with Timbuk
- Reachability in conditional term rewriting systems
- Toward the concurrent implementation of computational systems
Cited in
(27)- Decidability of reachability for disjoint union of term rewriting systems
- A finiteness condition for rewriting systems
- Sentence-normalized conditional narrowing modulo in rewriting logic and Maude
- Reversible computation in term rewriting
- A coinductive approach to proving reachability properties in logically constrained term rewriting systems
- Determinization of conditional term rewriting systems
- Some decidability results on one-pass reductions
- Homomorphism theorem and unreachability for \(\omega\) rewriting systems
- Specification inference using context-free language reachability
- A Completion Method to Decide Reachability in Rewrite Systems
- Complexity of conditional term rewriting
- scientific article; zbMATH DE number 1799527 (Why is no real title available?)
- Characterizing conclusive approximations by logical formulae
- Controlled term rewriting
- Feasible Trace Reconstruction for Rewriting Approximations
- scientific article; zbMATH DE number 4043235 (Why is no real title available?)
- scientific article; zbMATH DE number 19765 (Why is no real title available?)
- Ground reachability and joinability in linear term rewriting systems are fixed parameter tractable with respect to depth
- Reachability in conditional term rewriting systems
- Narrowing trees for syntactically deterministic conditional term rewriting systems
- On proving soundness of the computationally equivalent transformation for normal conditional term rewriting systems by using unravelings
- Deciding Satisfiability of Positive Second Order Joinability Formulae
- Basic rewriting via logic programming, with an application to the reachability problem
- Reachability analysis over term rewriting systems
- Conditional term rewriting and first-order theorem proving
- Reachability Analysis for Termination and Confluence of Rewriting
- A theoretical limit for safety verification techniques with regular fix-point computations
This page was built for publication: Reachability in conditional term rewriting systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4916227)
