. References, Modeling and verifying active xml artifacts, IEEE Data Eng. Bull, vol.32, issue.3, pp.10-15, 2009.

. Barguñó, The Emptiness Problem for Tree Automata with Global Constraints, 2010 25th Annual IEEE Symposium on Logic in Computer Science, pp.263-272, 2010.
DOI : 10.1109/LICS.2010.28

. Boichut, Finer Is Better: Abstraction Refinement for Rewriting Approximations, Rewriting Techniques and Application, RTA'08, pp.48-62, 2008.
DOI : 10.1007/978-3-540-70590-1_4

URL : https://hal.archives-ouvertes.fr/hal-00563422

. Boichut, Rewriting Approximations for Fast Prototyping of Static Analyzers, Lecture Notes in Computer Science, vol.4533, issue.07, pp.48-62, 2007.
DOI : 10.1007/978-3-540-73449-9_6

URL : https://hal.archives-ouvertes.fr/hal-00463418

. Boichut, Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives, Electronic Notes in Theoretical Computer Science, vol.239, pp.57-72, 2009.
DOI : 10.1016/j.entcs.2009.05.030

URL : https://hal.archives-ouvertes.fr/hal-00561374

. Bojanczyk, Two-variable logic on data trees and XML reasoning, J. ACM, vol.56, issue.3, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00151833

. Bouajjani, Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata, International Conference on Implementation and Applications of Automata, pp.57-67, 2008.
DOI : 10.1007/978-3-540-70844-5_7

. Comon, Tree Automata Techniques and Applications, 2007.

. Comon-lundh, Visibly Tree Automata with Memory and Constraints, Logical Methods in Computer Science, vol.4, issue.2, 2008.
DOI : 10.2168/LMCS-4(2:8)2008

URL : https://hal.archives-ouvertes.fr/inria-00578844

. Courbis, TAGED Approximations for Temporal Properties Model-Checking, International Conference on Implementation and Applications of Automata, pp.135-144, 2009.
DOI : 10.1007/10721975_17

URL : https://hal.archives-ouvertes.fr/inria-00380048

E. Filiot, Logics for n-ary queries in trees, 2008.
URL : https://hal.archives-ouvertes.fr/tel-00330524

. Filiot, Tree Automata with Global Constraints, 12th International Conference on Developments in Language Theory (DLT), pp.314-326, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00292027

. Héam, SAT Solvers for Queries over Tree Automata with Constraints, Third International Conference on Software Testing, Verification, and Validation Workshops, pp.343-348, 2010.

. Jacquemard, Rigid Tree Automata, Proceedings of the 3rd International Conference on Language and Automata Theory and Applications (LATA'09), pp.446-457, 2009.
DOI : 10.1007/978-3-540-71389-0_13

URL : https://hal.archives-ouvertes.fr/inria-00579001

M. Murata, Hedge automata: a formal model for XML schemata, 1999.

V. Tabakov, D. Tabakov, and M. Vardi, Experimental Evaluation of Classical Automata Constructions, Logic for Programming, Artificial Intelligence, and Reasoning, pp.396-411, 2005.
DOI : 10.1007/11591191_28

. Antichains, A new algorithm for checking universality of finite automata, Lecture Notes in Computer Science, vol.4144, pp.17-30

I. Centre-de-recherche, ?. Nancy, and L. Est, Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès