Pages that link to "Item:Q556686"
From MaRDI portal
The following pages link to Reachability analysis over term rewriting systems (Q556686):
Displaying 25 items.
- Symbol different term rewrite systems (Q492918) (← links)
- Reachability, confluence, and termination analysis with state-compatible automata (Q515687) (← links)
- Termination criteria for tree automata completion (Q730470) (← links)
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules (Q845695) (← links)
- On tree automata that certify termination of left-linear term rewriting systems (Q876043) (← links)
- A theoretical limit for safety verification techniques with regular fix-point computations (Q963463) (← links)
- Equational approximations for tree automata completion (Q968530) (← links)
- A note on partially ordered tree automata (Q975463) (← links)
- Complexity analysis of term-rewriting systems (Q1262761) (← links)
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy (Q1637228) (← links)
- Reachability-based acyclicity analysis by abstract interpretation (Q1944776) (← links)
- Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
- Some decidability results on one-pass reductions (Q2423761) (← links)
- One-variable context-free hedge automata (Q2424690) (← links)
- A Completion Method to Decide Reachability in Rewrite Systems (Q2964463) (← links)
- (Q2980977) (← links)
- Controlled Term Rewriting (Q3172893) (← links)
- Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies (Q3454088) (← links)
- TAGED Approximations for Temporal Properties Model-Checking (Q3637350) (← links)
- Handling Left-Quadratic Rules When Completing Tree Automata (Q4982086) (← links)
- Completeness of tree automata completion (Q4993342) (← links)
- Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives (Q5179050) (← links)
- On Reachability Analysis of Pushdown Systems with Transductions: Application to Boolean Programs with Call-by-Reference (Q5357718) (← links)
- Towards an Efficient Implementation of Tree Automata Completion (Q5505416) (← links)
- SAT-based automated completion for reachability analysis (Q6666788) (← links)