SAT Solvers for Queries over Tree Automata with Constraints

Tree automata turned out to be a very convenient framework for modeling and proving properties on infinite systems like communication protocols, Java programs and also in the context of XML programming. Unfortunately, these works are not always supported by efficient verification and validation tools. This paper investigates the use of two SAT solvers --- MiniSat and picoSat --- to evaluate queries over tree automata with global equality and disequality constraints (TAGEDs for short). Unlike general tree automata, TAGEDs allow to express constraints useful for e.g., evaluating queries over XML documents, like 'in the document, two nodes do not have the same key'. These queries being based on the membership problem which is NP-complete for TAGEDs, we propose an efficient SAT encoding of the membership problem for TAGEDs and we show its correctness and soundness. The paper reports on the experimental results, and implementation details are given.

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

[2]  Michaël Rusinowitch,et al.  Rewrite-based verification of XML updates , 2010, PPDP.

[3]  Thomas Schwentick,et al.  Two-variable logic on data trees and XML reasoning , 2009, JACM.

[4]  Sebastian Mödersheim,et al.  The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications , 2005, CAV.

[5]  Michaël Rusinowitch,et al.  Tree automata with equality constraints modulo equational theories , 2006, J. Log. Algebraic Methods Program..

[6]  Chao Wang,et al.  SAT-Based Verification Methods and Applications in Hardware Verification , 2006, SFM.

[7]  Serge Abiteboul,et al.  Modeling and Verifying Active XML Artifacts , 2009, IEEE Data Eng. Bull..

[8]  Jean-Marc Talbot,et al.  Tree Automata with Global Constraints , 2008, Int. J. Found. Comput. Sci..

[9]  Makoto Murata,et al.  Hedge automata: a formal model for xml schemata , 1999 .

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

[11]  Malay K. Ganai,et al.  Efficient SAT-based bounded model checking for software verification , 2008, Theor. Comput. Sci..

[12]  Panagiotis Manolios,et al.  Faster SAT solving with better CNF generation , 2009, 2009 Design, Automation & Test in Europe Conference & Exhibition.

[13]  Armin Biere,et al.  Bounded Model Checking Using Satisfiability Solving , 2001, Formal Methods Syst. Des..

[14]  Max Dauchet,et al.  Automata for Reduction Properties Solving , 1995, J. Symb. Comput..

[15]  Christof Löding,et al.  Unranked Tree Automata with Sibling Equalities and Disequalities , 2007, ICALP.

[16]  Thomas Schwentick,et al.  Automata for XML - A survey , 2007, J. Comput. Syst. Sci..

[17]  Florent Jacquemard,et al.  Visibly Tree Automata with Memory and Constraints , 2008, Log. Methods Comput. Sci..

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

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

[20]  Sophie Tison,et al.  Equality and Disequality Constraints on Direct Subterms in Tree Automata , 1992, STACS.

[21]  Thomas Schwentick,et al.  Counting in Trees for Free , 2004, ICALP.

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

[23]  Florent Jacquemard,et al.  Rigid Tree Automata , 2009, LATA.

[24]  Jean-Marc Talbot,et al.  Tree Automata Techniques and Applications , 2008 .

[25]  Alessandro Armando,et al.  An Optimized Intruder Model for SAT-based Model-Checking of Security Protocols , 2005, ARSPA@IJCAR.

[26]  Olga Kouchnarenko,et al.  Approximation-based Tree Regular Model-Checking , 2008, Nord. J. Comput..

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

[28]  Panagiotis Manolios,et al.  BAT: The Bit-Level Analysis Tool , 2007, CAV.

[29]  Véronique Cortier,et al.  Tree automata with one memory set constraints and cryptographic protocols , 2005, Theor. Comput. Sci..

[30]  Moshe Y. Vardi,et al.  Efficient LTL compilation for SAT-based model checking , 2005, ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005..

[31]  Olga Kouchnarenko,et al.  Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives , 2009, INFINITY.

[32]  Olga Kouchnarenko,et al.  TAGED Approximations for Temporal Properties Model-Checking , 2009, CIAA.