Reachability analysis of term rewriting systems with Timbuk
From MaRDI portal
Recommendations
Cited in
(19)- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
- Generalized rewrite theories, coherence completion, and symbolic methods
- A logic of reachable patterns in linked data-structures
- Narrowing and rewriting logic: from foundations to applications
- Reachability analysis of innermost rewriting
- Finer Is Better: Abstraction Refinement for Rewriting Approximations
- Feasible Trace Reconstruction for Rewriting Approximations
- Reachability in conditional term rewriting systems
- Symbol different term rewrite systems
- Completeness of tree automata completion
- Bounded communication reachability analysis of process rewrite systems with ordered parallelism
- Reachability analysis of innermost rewriting
- Towards an Efficient Implementation of Tree Automata Completion
- Reachability analysis over term rewriting systems
- Reducing non-occurrence of specified runtime errors to all-path reachability problems of constrained rewriting
- SAT-based automated completion for reachability analysis
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Equational approximations for tree automata completion
This page was built for publication: Reachability analysis of term rewriting systems with Timbuk
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996202)
