The following pages link to (Q2723425):
Displaying 27 items.
- Symbol different term rewrite systems (Q492918) (← links)
- Rigid tree automata and applications (Q553317) (← links)
- Reachability analysis over term rewriting systems (Q556686) (← links)
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules (Q845695) (← links)
- Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
- Injective synchronisation: An extension of the authentication hierarchy (Q860905) (← links)
- A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties (Q860906) (← links)
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
- A theoretical limit for safety verification techniques with regular fix-point computations (Q963463) (← links)
- Equational approximations for tree automata completion (Q968530) (← links)
- Closure properties and decision problems of dag automata (Q1041757) (← links)
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy (Q1637228) (← links)
- Match-bounded string rewriting systems (Q1762560) (← links)
- Alternating two-way AC-tree automata (Q2373699) (← links)
- Towards more precise rewriting approximations (Q2424681) (← links)
- Tree automata with equality constraints modulo equational theories (Q2426520) (← links)
- Tree automata for rewrite strategies (Q2456572) (← links)
- Transducer-based analysis of cryptographic protocols (Q2464141) (← links)
- On the relationships between models in protocol verification (Q2482448) (← links)
- Abstraction and resolution modulo AC: How to verify Diffie--Hellman-like protocols automatically (Q2484410) (← links)
- Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols (Q2643568) (← links)
- Synchronized Tree Languages for Reachability in Non-right-linear Term Rewrite Systems (Q2827837) (← links)
- Information based reasoning about security protocols (Q2841219) (← links)
- The Open-Source Fixed-Point Model Checker for Symbolic Analysis of Security Protocols (Q3184787) (← links)
- Handling Left-Quadratic Rules When Completing Tree Automata (Q4982086) (← links)
- Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives (Q5179050) (← links)
- On Proving Soundness of the Computationally Equivalent Transformation for Normal Conditional Term Rewriting Systems by Using Unravelings (Q5240136) (← links)
