Sufficient completeness, term rewriting systems and “anti-unification”
Proc. of the 8th international conference on Automated deduction
Deterministic tree pushdown automata and monadic tree rewriting systems
Journal of Computer and System Sciences
Bottom-up tree pushdown automata and rewrite systems
RTA-91 Proceedings of the 4th international conference on Rewriting techniques and applications
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
Theoretical Computer Science
Term rewriting and all that
Completeness in Data Type Specifications
EUROCAL '85 Research Contributions from the European Conference on Computer Algebra-Volume 2
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Regular Sets of Descendants by Some Rewrite Strategies
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
RTA '02 Proceedings of the 13th International Conference on Rewriting Techniques and Applications
A decidability result about sufficient-completeness of axiomatically specified abstract data types
Proceedings of the 6th GI-Conference on Theoretical Computer Science
Decidable Approximations of Term Rewriting Systems
RTA '96 Proceedings of the 7th International Conference on Rewriting Techniques and Applications
Decidable Approximations of Sets of Descendants and Sets of Normal Forms
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
Canonical Conditional Rewrite Systems
Proceedings of the 9th International Conference on Automated Deduction
Rewriting for Cryptographic Protocol Verification
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Proving Properties of Security Protocols by Induction
CSFW '97 Proceedings of the 10th IEEE workshop on Computer Security Foundations
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Regular Tree Languages And Rewrite Systems
Fundamenta Informaticae
Descendants of a recognizable tree language for sets of linear monadic term rewrite rules
Information Processing Letters
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation
A theoretical limit for safety verification techniques with regular fix-point computations
Information Processing Letters
A note on partially ordered tree automata
Information Processing Letters
Languages Modulo Normalization
FroCoS '07 Proceedings of the 6th international symposium on Frontiers of Combining Systems
Finer Is Better: Abstraction Refinement for Rewriting Approximations
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Combining Equational Tree Automata over AC and ACI Theories
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Towards an Efficient Implementation of Tree Automata Completion
AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
Certifying a Tree Automata Completion Checker
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Handling Left-Quadratic Rules When Completing Tree Automata
Electronic Notes in Theoretical Computer Science (ENTCS)
Approximating Term Rewriting Systems: A Horn Clause Specification and Its Implementation
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives
Electronic Notes in Theoretical Computer Science (ENTCS)
TAGED Approximations for Temporal Properties Model-Checking
CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
Approximation-based tree regular model-checking
Nordic Journal of Computing
Equational approximations for tree automata completion
Journal of Symbolic Computation
Rewriting approximations for fast prototyping of static analyzers
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Rewrite-based verification of XML updates
Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming
Functional term rewriting systems towards symbolic model-checking
International Journal of Critical Computer-Based Systems
Characterizing conclusive approximations by logical formulae
RP'11 Proceedings of the 5th international conference on Reachability problems
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Term rewriting for access control
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
Handling exp, χ (and timestamps) in protocol analysis
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Handling algebraic properties in automatic analysis of security protocols
ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Feasible trace reconstruction for rewriting approximations
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
Rewriting approximations for properties verification over CCS specifications
FSEN'11 Proceedings of the 4th IPM international conference on Fundamentals of Software Engineering
Equational abstraction refinement for certified tree regular model checking
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
A completion algorithm for lattice tree automata
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
| Hi-index | 0.00 |
This paper surveys some techniques and tools for achieving reachability analysis over term rewriting systems. The core of those techniques is a generic tree automata completion algorithm used to compute in an exact or approximated way the set of descendants (or reachable terms). This algorithm has been implemented in the \textsf{Timbuk} tool. Furthermore, we show that many classes with regular sets of descendants of the literature corresponds to specific instances of the tree automata completion algorithm and can thus be efficiently computed by \textsf{Timbuk}. An extension of the completion algorithm to conditional term rewriting systems and some applications are also presented.