Cited in
(64)- HANDLING NON LEFT-LINEAR RULES WHEN COMPLETING TREE AUTOMATA
- Reachability analysis of term rewriting systems with Timbuk
- Generalized rewrite theories, coherence completion, and symbolic methods
- Towards an Efficient Implementation of Tree Automata Completion
- A theoretical limit for safety verification techniques with regular fix-point computations
- Feasible Trace Reconstruction for Rewriting Approximations
- Tree automata for detecting attacks on protocols with algebraic cryptographic primitives
- Foundations of Software Science and Computation Structures
- Term orderings for non-reachability of (conditional) rewriting
- \texttt{Autowrite}: a tool for term rewrite systems and tree automata
- A note on partially ordered tree automata
- Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
- How to Tackle Integer Weighted Automata Positivity
- The Isabelle collections framework
- VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata
- scientific article; zbMATH DE number 1950261 (Why is no real title available?)
- TAGED Approximations for Temporal Properties Model-Checking
- scientific article; zbMATH DE number 5141412 (Why is no real title available?)
- Reachability analysis of fragments of mobile ambients in AC term rewriting
- Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy
- Handling left-quadratic rules when completing tree automata
- Term rewriting with prefix context constraints and bottom-up strategies
- Finer Is Better: Abstraction Refinement for Rewriting Approximations
- Handling Algebraic Properties in Automatic Analysis of Security Protocols
- Approximation-based tree regular model-checking
- Equational approximations for tree automata completion
- Completeness of tree automata completion
- Narrowing and rewriting logic: from foundations to applications
- Controlled term rewriting
- Combining Equational Tree Automata over AC and ACI Theories
- Reachability in conditional term rewriting systems
- Reachability analysis of innermost rewriting
- HERMES
- Autowrite
- Tiburon
- TREX
- ELAN
- AVISPA
- FSA
- LETHAL
- InvA
- TORPA
- Maude-NPA
- NRL
- MTBDD
- C-SHORe
- McCLIM
- Tree Automata
- Symbolic Model Checking of Infinite-State Systems Using Narrowing
- The emptiness problem for tree automata with at least one global disequality constraint is NP-hard
- Tiburon: A Weighted Tree Automata Toolkit
- Rewriting Approximations for Fast Prototyping of Static Analyzers
- Symbol different term rewrite systems
- Reachability analysis over term rewriting systems
- Termination criteria for tree automata completion
- Formalizing and analyzing the Needham-Schroeder symmetric-key protocol by rewriting
- Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
- Rewriting approximations for properties verification over CCS specifications
- On tree automata that certify termination of left-linear term rewriting systems
- A logic of reachable patterns in linked data-structures
- Reachability, confluence, and termination analysis with state-compatible automata
- Some decidability results on one-pass reductions
- One-variable context-free hedge automata
- Decidable classes of tree automata mixing local and global constraints modulo flat theories
This page was built for software: Timbuk
