The following pages link to Timbuk (Q18478):
Displaying 48 items.
- The emptiness problem for tree automata with at least one global disequality constraint is NP-hard (Q344514) (← links)
- Symbol different term rewrite systems (Q492918) (← links)
- Reachability, confluence, and termination analysis with state-compatible automata (Q515687) (← links)
- Reachability analysis over term rewriting systems (Q556686) (← 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)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- Reachability analysis of fragments of mobile ambients in AC term rewriting (Q939167) (← 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)
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy (Q1637228) (← links)
- Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
- Generalized rewrite theories, coherence completion, and symbolic methods (Q2291817) (← links)
- Some decidability results on one-pass reductions (Q2423761) (← links)
- One-variable context-free hedge automata (Q2424690) (← links)
- A logic of reachable patterns in linked data-structures (Q2643337) (← links)
- (Q2848483) (← links)
- (Q2849582) (← links)
- Narrowing and Rewriting Logic: from Foundations to Applications (Q2873786) (← links)
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata (Q2894267) (← links)
- Rewriting Approximations for Properties Verification over CCS Specifications (Q2894572) (← links)
- (Q2980977) (← links)
- Reachability Analysis of Term Rewriting Systems with Timbuk (Q2996202) (← links)
- Controlled Term Rewriting (Q3172893) (← links)
- (Q3181700) (← links)
- (Q3431408) (← links)
- Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies (Q3454088) (← links)
- Finer Is Better: Abstraction Refinement for Rewriting Approximations (Q3522008) (← links)
- Combining Equational Tree Automata over AC and ACI Theories (Q3522015) (← links)
- Handling Algebraic Properties in Automatic Analysis of Security Protocols (Q3525147) (← links)
- Feasible Trace Reconstruction for Rewriting Approximations (Q3527288) (← links)
- TAGED Approximations for Temporal Properties Model-Checking (Q3637350) (← links)
- HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA (Q3646168) (← links)
- How to Tackle Integer Weighted Automata Positivity (Q3646253) (← links)
- (Q4412859) (← links)
- Reachability in Conditional Term Rewriting Systems (Q4916227) (← links)
- Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories (Q4927423) (← links)
- Handling Left-Quadratic Rules When Completing Tree Automata (Q4982086) (← links)
- (Q4993342) (← links)
- Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives (Q5179050) (← links)
- Rewriting Approximations for Fast Prototyping of Static Analyzers (Q5432332) (← links)
- Symbolic Model Checking of Infinite-State Systems Using Narrowing (Q5432339) (← links)
- Towards an Efficient Implementation of Tree Automata Completion (Q5505416) (← links)
- The Isabelle Collections Framework (Q5747660) (← links)
- Tiburon: A Weighted Tree Automata Toolkit (Q5757236) (← links)
- Foundations of Software Science and Computation Structures (Q5899103) (← links)
