Reachability Analysis over Term Rewriting Systems

Abstract 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.

[1]  Valérie Viet Triem Tong,et al.  Reachability Analysis of Term Rewriting Systems with Timbuk , 2001, LPAR.

[2]  Sophie Tison,et al.  The theory of ground rewrite systems is decidable , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[3]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[4]  Sándor Vágvölgyi,et al.  Linear Generalized Semi-Monadic Rewrite Systems Effectively Preserve Recognizability , 1998, Theor. Comput. Sci..

[5]  Thomas Genet,et al.  Decidable Approximations of Sets of Descendants and Sets of Normal Forms , 1998, RTA.

[6]  Chang Liu,et al.  Term rewriting and all that , 2000, SOEN.

[7]  Thomas Genet,et al.  Reachability in Conditional Term Rewriting Systems , 2003, Electron. Notes Theor. Comput. Sci..

[8]  H. Brown,et al.  Computational Problems in Abstract Algebra , 1971 .

[9]  Sándor Vágvölgyi,et al.  Bottom-Up Tree Pushdown Automata and Rewrite Systems , 1991, RTA.

[10]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[11]  Jan van Leeuwen,et al.  Handbook Of Theoretical Computer Science, Vol. A , 1990 .

[12]  X. Leroy.  The Objective Caml system release 3.09 Documentation and user''s manual , 2005 .

[13]  Paliath Narendran,et al.  On sufficient-completeness and related properties of term rewriting systems , 1987, Acta Informatica.

[14]  Sophie Tison,et al.  Regular Tree Languages and Rewrite Systems , 1995, Fundam. Informaticae.

[15]  Nachum Dershowitz,et al.  Canonical Conditional Rewrite Systems , 1988, CADE.

[16]  Tobias Nipkow,et al.  A decidability result about sufficient-completeness of axiomatically specified abstract data types , 1983, Theoretical Computer Science.

[17]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[18]  Lawrence Charles Paulson,et al.  Isabelle/HOL: A Proof Assistant for Higher-Order Logic , 2002 .

[19]  Donald E. Knuth,et al.  Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

[20]  H. Comon.  Sufficient Completness, Term Rewriting Systems and Anti-Unification , 1986 .

[21]  Walter S. Brainerd,et al.  Tree Generating Regular Systems , 1969, Inf. Control..

[22]  Claude Kirchner,et al.  An overview of ELAN , 1998, WRLA.

[23]  Florent Jacquemard,et al.  Decidable Approximations of Term Rewriting Systems , 1996, RTA.

[24]  Pierre Réty,et al.  Regular Sets of Descendants by Some Rewrite Strategies , 2002, RTA.

[25]  Hiroyuki Seki,et al.  Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability , 2000, RTA.

[26]  Kai Salomaa,et al.  Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems , 1988, J. Comput. Syst. Sci..

[27]  Lawrence C. Paulson,et al.  Proving properties of security protocols by induction , 1997, Proceedings 10th Computer Security Foundations Workshop.

[28]  Thomas Genet,et al.  Verification of Copy-Protection Cryptographic Protocol using Approximations of Term Rewriting System , 2003 .

[29]  Xavier Leroy.  The objective caml system release 3 , 2001 .

[30]  Emmanuel Kounalis,et al.  Completeness in Data Type Specifications , 1985, European Conference on Computer Algebra.

[31]  Hiroyuki Seki,et al.  Layered Transducing Term Rewriting System and Its Recognizability Preserving Property , 2002, RTA.

[32]  Pierre Réty.  Regular Sets of Descendants for Constructor-Based Rewrite Systems , 1999, LPAR.

[33]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[34]  Thomas Genet,et al.  Rewriting for Cryptographic Protocol Verification , 2000, CADE.