Handling Non Left-Linear Rules when Completing Tree Automata

This paper addresses the following general problem of tree regular model-checking: decide whether the intersection of R*(L) and Lp is empty, where R* is the reflexive and transitive closure of a successor relation induced by a term rewriting system R, and L and Lp are both regular tree languages. We develop an automatic approximation-based technique to handle this -- undecidable in general -- problem in the case when term rewriting system rules are non left-linear.

[1]  Pierre Réty,et al.  Regular Sets of Descendants by Leftmost Strategy , 2002, Electron. Notes Theor. Comput. Sci..

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

[3]  Ahmed Bouajjani,et al.  Abstract regular (tree) model checking , 2012, International Journal on Software Tools for Technology Transfer.

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

[5]  Olga Kouchnarenko,et al.  Automatic Verification of Security Protocols Using Approximations , 2005 .

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

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

[8]  Olga Kouchnarenko,et al.  Finer Is Better: Abstraction Refinement for Rewriting Approximations , 2008, RTA.

[9]  Toshinori Takai,et al.  ACTAS : A System Design for Associative and Commutative Tree Automata Theory , 2005, Electron. Notes Theor. Comput. Sci..

[10]  Adriano Valenzano,et al.  Automatic Detection of Attacks on Cryptographic Protocols: A Case Study , 2005, DIMVA.

[11]  Véronique Cortier,et al.  A survey of algebraic properties used in cryptographic protocols , 2006, J. Comput. Secur..

[12]  Yassine Lakhnech,et al.  Pattern-based abstraction for verifying secrecy in protocols , 2005, International Journal on Software Tools for Technology Transfer.

[13]  Olga Kouchnarenko,et al.  Handling Algebraic Properties in Automatic Analysis of Security Protocols , 2006, ICTAC.

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

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

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

[17]  Yohan Boichut,et al.  Rewriting Approximations for Fast Prototyping of Static Analyzers , 2007, RTA.

[18]  Valérie Viet Triem Tong,et al.  Reachability Analysis over Term Rewriting Systems , 2004, Journal of Automated Reasoning.

[19]  Tayssir Touili,et al.  Extrapolating Tree Transformations , 2002, CAV.

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

[21]  Ahmed Bouajjani,et al.  Abstract Regular Tree Model Checking of Complex Dynamic Data Structures , 2006, SAS.

[22]  Pierre-Cyrille Héam,et al.  A theoretical limit for safety verification techniques with regular fix-point computations , 2008, Inf. Process. Lett..

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

[24]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[25]  Parosh Aziz Abdulla,et al.  Regular Tree Model Checking , 2002, CAV.

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

[27]  Takashi Nagaya,et al.  Decidability for Left-Linear Growing Term Rewriting Systems , 1998, Inf. Comput..