Regular Tree Model Checking, CAV, 2002. ,
DOI : 10.1007/3-540-45657-0_47
Algorithmic Improvements in Regular Model Checking, CAV, 2003. ,
DOI : 10.1007/978-3-540-45069-6_25
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.13.7616
Simulation-Based Iteration of Tree Transducers, TACAS, 2005. ,
DOI : 10.1007/978-3-540-31980-1_3
Parameterized Verification of Infinite-State Processes with Global Conditions, CAV, 2007. ,
DOI : 10.1007/978-3-540-73368-3_17
Frédéric Haziza, and Ahmed Rezine. Parameterized tree systems, 2008. ,
Term Rewriting and All That, 1998. ,
Copster homepage, 2009. ,
Quantitative Refinement for Weighted Modal Transition Systems, MFCS, 2011. ,
DOI : 10.1007/978-3-642-22993-0_9
URL : https://hal.archives-ouvertes.fr/hal-01088046
Equational Abstraction Refinement for Certified Tree Regular Model Checking, ICFEM'12, 2012. ,
DOI : 10.1007/978-3-642-34281-3_22
URL : https://hal.archives-ouvertes.fr/hal-00759149
Rewriting Approximations for Fast Prototyping of Static Analyzers, RTA, LNCS, 2007. ,
DOI : 10.1007/978-3-540-73449-9_6
URL : https://hal.archives-ouvertes.fr/hal-00463418
Fast Equational Abstraction Refinement for Regular Tree Model Checking, 2011. ,
Approximation-based tree regular model-checking, Nord. J. Comput, vol.14, issue.3, pp.216-241, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00429345
Iterating transducers in the large (extended abstract) ,
Omega-Regular Model Checking, TACAS, 2004. ,
DOI : 10.1007/978-3-540-24730-2_41
Abstract rmc of complex dynamic data structures, SAS, 2006. ,
Extrapolating Tree Transformations, CAV, 2002. ,
DOI : 10.1007/3-540-45657-0_46
URL : https://hal.archives-ouvertes.fr/hal-00161115
Abstract Regular Tree Model Checking, Electronic Notes in Theoretical Computer Science, vol.149, issue.1, pp.37-48, 2006. ,
DOI : 10.1016/j.entcs.2005.11.015
URL : https://hal.archives-ouvertes.fr/hal-00156828
Interprétation abstraite en logique intuitionniste : extraction d'analyseurs Java certifiés, 2005. ,
Fuzzy tree automata. Fuzzy Sets Syst, pp.1450-1460, 2007. ,
Bottom-up automata on data trees and vertical xpath, STACS, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00573596
Lattice Automata: A Representation for Languages on Infinite Alphabets, and Some Applications to Verification, SAS, 2007. ,
DOI : 10.1007/978-3-540-74061-2_4
Verifying recursive active documents with positive data tree rewriting, FSTTCS, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00461272
Rewriting for Cryptographic Protocol Verification, 2000. ,
DOI : 10.1007/10721959_21
URL : https://hal.archives-ouvertes.fr/inria-00072731
Equational approximations for tree automata completion, Journal of Symbolic Computation, vol.45, issue.5, pp.574-597, 2010. ,
Abstract rewriting with concrete operations, RTA, pp.178-186, 1989. ,
DOI : 10.1007/3-540-51081-8_108
Symbolic model checking with rich assertional languages, CAV, 1997. ,
DOI : 10.1016/S0304-3975(00)00103-1
Lattice Automata, VMCAI, 2007. ,
DOI : 10.1007/978-3-540-69738-1_14
Equational Abstractions, Proc. 19th CADE Conf, pp.2-16, 2003. ,
Automated termination analysis of java bytecode by term rewriting, RTA, LIPIcs. Dagstuhl, 2010. ,
Verifying systems with infinite but regular state spaces, CAV, volume 1427 of LNCS, 1998. ,
DOI : 10.1007/BFb0028736
Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4 ,
Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt : Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Unité de recherche, 2004. ,