M. Abadi and C. Fournet, Mobile values, new names, and secure communication, 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages , POPL, pp.104-115, 2001.
DOI : 10.1145/373243.360213
URL : https://hal.archives-ouvertes.fr/hal-01423924

R. Abbassi, F. Jacquemard, M. Rusinowitch, and S. Fatmi, XML access control: from XACML to annotated schemas, The Second International Conference on Communications and Networking
DOI : 10.1109/COMNET.2010.5699810

P. A. Abdulla, B. Jonsson, P. Mahata, and J. , Regular Tree Model Checking, Proceedings of the 14th International Conference on Computer Aided Verification, CAV'02, pp.555-568, 2002.
DOI : 10.1007/3-540-45657-0_47
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.7184

S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases, 1995.

S. Abiteboul, O. Benjelloun, and T. Milo, The active xml project: an overview. The VLDB Journal, pp.1019-1040, 2008.

S. Abiteboul, P. Bourhis, and B. Marinoiu, Satisfiability and relevance for queries over active documents, Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '09, pp.87-96, 2009.
DOI : 10.1145/1559795.1559810
URL : https://hal.archives-ouvertes.fr/inria-00429645

R. Affeldt and H. Comon-lundh, Verification of security protocols with a bounded number of sessions based on resolution for rigid variables In Formal to Practical Security State-of-the-Art Survey, Lecture Notes in Computer Science, vol.5458, pp.1-20, 2009.

R. Alur and P. Madhusudan, Visibly pushdown languages, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.202-211, 2004.
DOI : 10.1145/1007352.1007390

R. Alur, S. Chaudhuri, and P. Madhusudan, Languages of Nested Trees, Proceedings of the 18th International Conference on Computer Aided Verification (CAV), pp.329-342, 2006.
DOI : 10.1007/11817963_31

R. Amadio and D. Lugiez, On the Reachability Problem in Cryptographic Protocols, Concurrency Theory, 11th Int. Conf. on Concurrency Theory, CONCUR, pp.380-394, 2000.
DOI : 10.1007/3-540-44618-4_28
URL : https://hal.archives-ouvertes.fr/inria-00072738

R. M. Amadio and W. Charatonik, On Name Generation and Set-Based Analysis in the Dolev-Yao Model, 13th International Conference on Concurrency Theory, CONCUR, pp.499-514, 2002.
DOI : 10.1007/3-540-45694-5_33

S. Anantharaman, P. Narendran, and M. Rusinowitch, Closure properties and decision problems of dag automata, Information Processing Letters, vol.94, issue.5, pp.231-240, 2005.
DOI : 10.1016/j.ipl.2005.02.004
URL : https://hal.archives-ouvertes.fr/hal-00077495

P. B. Andrews, Theorem Proving via General Mappings, Journal of the ACM, vol.28, issue.2, pp.193-214, 1981.
DOI : 10.1145/322248.322249

F. Baader and T. Nipkow, Term Rewriting and All That, 1998.

L. Bachmair and H. Ganzinger, Resolution Theorem Proving, Handbook of Automated Reasoning, chapter, 2001.
DOI : 10.1016/B978-044450813-3/50004-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.4450

L. Bachmair, H. Ganzinger, and U. Waldmann, Set constraints are the monadic class, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science, pp.75-83, 1993.
DOI : 10.1109/LICS.1993.287598

L. Bachmair, H. Ganzinger, C. Lynch, and W. Snyder, Basic Paramodulation, Information and Computation, vol.121, issue.2, pp.172-192, 1995.
DOI : 10.1006/inco.1995.1131
URL : http://doi.org/10.1006/inco.1995.1131

A. Barecka and W. Charatonik, The Parameterized Complexity of Chosen Problems for Finite Automata on Trees, proceedings of the 5th International Conference on Language and Automata Theory and Applications (LATA'09), 2011.
DOI : 10.1007/978-3-642-21254-3_9

L. Barguñó, C. Creus, G. Godoy, F. Jacquemard, and C. Vacher, 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

M. Benedikt and J. Cheney, Semantics, Types and Effects for XML Updates, Proceedings 12th International Symposium on Database Programming Languages (DBPL), pp.1-17, 2009.
DOI : 10.1145/1348250.1348255

V. Benzaken, G. Castagna, and A. Frisch, Cduce: An xml-centric general-purpose language, Proceedings of the ACM International Conference on Functional Programming, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00152619

A. Berlea and H. Seidl, Binary queries for document trees, Nord. J. Comput, vol.11, issue.1, pp.41-71, 2004.

B. Blanchet, An efficient cryptographic protocol verifier based on prolog rules, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., p.82, 2001.
DOI : 10.1109/CSFW.2001.930138
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.14.5150

A. Blumensath and E. Grädel, Automatic structures, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.51-62, 2000.
DOI : 10.1109/LICS.2000.855755

B. Bogaert, Automates d'arbres avec tests d'égalités, 1990.

B. Bogaert and S. Tison, Equality and disequality constraints on direct subterms in tree automata, 9th Symp. on Theoretical Aspects of Computer Science, STACS, pp.161-171, 1992.
DOI : 10.1007/3-540-55210-3_181

B. Bogaert, F. Seynhaeve, and S. Tison, The Recognizability Problem for Tree Automata with Comparisons between Brothers, Foundations of Software Science and Computation Structure, Second International Conference, FoSSaCS'99, volume 1578 of Lecture Notes in Computer Science, pp.150-164
DOI : 10.1007/3-540-49019-1_11

A. Boiret, Grammaires context-free pour les arbres sans rang, 2010.

M. Bojanczyk, A. Muscholl, T. Schwentick, L. Segoufin, and C. David, Twovariable logic on words with data, Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science, pp.7-16, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00151749

M. Boja?czyk, A. Muscholl, T. Schwentick, and L. Segoufin, Two-variable logic on data trees and xml reasoning, Journal of the ACM, vol.5613, issue.3, pp.1-13, 2009.

A. Bouajjani and T. Touili, Extrapolating Tree Transformations, Computer Aided Verification, pp.349-363, 2002.
DOI : 10.1007/3-540-45657-0_46
URL : https://hal.archives-ouvertes.fr/hal-00161115

A. Bouajjani and T. Touili, On Computing Reachability Sets of Process Rewrite Systems, Proceedings of the 16th International Conference on Term Rewriting and Applications (RTA), pp.484-499, 2005.
DOI : 10.1007/978-3-540-32033-3_35
URL : https://hal.archives-ouvertes.fr/hal-00161108

A. Bouajjani, J. Esparza, and O. Maler, Reachability analysis of pushdown automata: Application to model-checking, Lecture Notes in Computer Science, vol.1243, pp.135-150, 1997.
DOI : 10.1007/3-540-63141-0_10

A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili, Regular Model Checking, Proc. of the 12th Int. Conf. on Computer Aided Verification, pp.403-418, 2000.
DOI : 10.1007/10722167_31
URL : https://hal.archives-ouvertes.fr/hal-00159512

A. Bouajjani, P. Habermehl, A. Rogalewicz, and T. Vojnar, Abstract Regular Tree Model Checking of Complex Dynamic Data Structures, Static Analysis, pp.52-70, 2006.
DOI : 10.1007/11823230_5
URL : https://hal.archives-ouvertes.fr/hal-00150139

A. Bouajjani, P. Habermehl, Y. Jurski, and M. Sighireanu, Rewriting Systems with Data, Proceedings of the 16th international symposium on Fundamentals of Computation Theory, pp.1-22, 2007.
DOI : 10.1007/978-3-540-74240-1_1
URL : https://hal.archives-ouvertes.fr/hal-00157782

A. Bouhoula, Automated Theorem Proving by Test Set Induction, Journal of Symbolic Computation, vol.23, issue.1, pp.47-77, 1997.
DOI : 10.1006/jsco.1996.0076
URL : https://hal.archives-ouvertes.fr/inria-00074196

A. Bouhoula and F. Jacquemard, Automating sufficient completeness check for conditional and constrained trs, Proceedings of the 20th International Workshop on Unification, 2006.
DOI : 10.1016/j.jal.2011.09.001
URL : https://hal.archives-ouvertes.fr/inria-00579017

A. Bouhoula and F. Jacquemard, Verifying regular trace properties of security protocols with explicit destructors and implicit induction, Proc. of the Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA'07), pp.27-44, 2007.
URL : https://hal.archives-ouvertes.fr/inria-00579015

A. Bouhoula and F. Jacquemard, Automated Induction with Constrained Tree Automata, Proceedings of the 4th International Joint Conference on Automated Reasoning, pp.539-553, 2008.
DOI : 10.1007/978-3-540-71070-7_44
URL : https://hal.archives-ouvertes.fr/inria-00579004

A. Bouhoula and F. Jacquemard, Sufficient completeness verification for conditional and constrained TRS, Journal of Applied Logic, vol.10, issue.1, 2011.
DOI : 10.1016/j.jal.2011.09.001
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.3362

A. Bouhoula and J. Jouannaud, Automata-Driven Automated Induction, Information and Computation, vol.169, issue.1, pp.1-22, 2001.
DOI : 10.1006/inco.2001.3036
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.8766

A. Bouhoula and M. Rusinowitch, Implicit induction in conditional theories, Journal of Automated Reasoning, vol.31, issue.2, pp.189-235, 1995.
DOI : 10.1007/BF00881856
URL : https://hal.archives-ouvertes.fr/inria-00074627

A. Bouhoula, J. Jouannaud, and J. Meseguer, Specification and proof in membership equational logic, Theoretical Computer Science, vol.236, issue.1-2, pp.35-132, 2000.
DOI : 10.1016/S0304-3975(99)00206-6
URL : https://hal.archives-ouvertes.fr/inria-00099079

P. Bouyer, A. Petit, and D. Thérien, An Algebraic Characterization of Data and Timed Languages, Proceedings of the 12th International Conference on Concurrency Theory, CONCUR '01, pp.248-261, 2001.
DOI : 10.1007/3-540-44685-0_17

W. S. Brainerd, Semi-thue systems and representations of trees, 10th Annual Symposium on Switching and Automata Theory (swat 1969), pp.240-244, 1969.
DOI : 10.1109/SWAT.1969.19

L. Bravo, J. Cheney, and I. Fundulaki, ACCOn, Proceedings of the 11th international conference on Extending database technology Advances in database technology, EDBT '08, pp.715-719, 2008.
DOI : 10.1145/1353343.1353433

J. A. Bull and D. J. Otway, The authentication protocol, Defence Research Agency, 1997.

P. Buneman, W. Fan, J. Siméon, and S. Weinstein, Constraints for semistructured data and xml. SIGMOD Rec, pp.47-54, 2001.

S. C. Lim and S. H. Son, Access control of XML documents considering update operations, Proceedings of the 2003 ACM workshop on XML security , XMLSEC '03, 2003.
DOI : 10.1145/968559.968568

L. Cardelli and G. Ghelli, TQL: a query language for semistructured data based on the ambient logic, Mathematical Structures in Computer Science, vol.14, issue.3, pp.285-327, 2004.
DOI : 10.1017/S0960129504004141

J. Carme, J. Niehren, and M. Tommasi, Querying Unranked Trees with Stepwise Tree Automata, International Conference on Rewriting Techniques and Applications, pp.105-118, 2004.
DOI : 10.1007/978-3-540-25979-4_8
URL : https://hal.archives-ouvertes.fr/inria-00536529

A. Caron, Structures et Décision en Réécriture, 1993.

A. Caron, H. Comon, J. Coquidé, M. Dauchet, and F. Jacquemard, Pumping, cleaning and symbolic constraints solving, 21st Int, pp.436-449, 1994.
DOI : 10.1007/3-540-58201-0_88

J. Chabin and P. Réty, Visibly Pushdown Languages and Term Rewriting, Proceedings 6th International Symposium on Frontiers of Combining Systems, pp.252-266, 2007.
DOI : 10.1007/978-3-540-74621-8_17
URL : https://hal.archives-ouvertes.fr/inria-00462510

W. Charatonik, Automata on dag representations of finite trees, 1999.

W. Charatonik and L. Pacholski, Negative set constraints with equal- ity, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, pp.128-136, 1994.
DOI : 10.1109/lics.1994.316078
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.9276

W. Charatonik and L. Pacholski, Set constraints with projections, J. ACM, vol.5737, issue.23, pp.1-23, 2010.

W. Charatonik and A. Podelski, Set constraints with intersec- tion Information and Computation, pp.213-229, 2002.

T. Colcombet, Rewriting in the partial algebra of typed terms modulo AC, Electronic Notes in Theoretical Computer Science, vol.68, issue.6, 2002.
DOI : 10.1016/S1571-0661(04)80532-2

H. Comon, Sequentiality, second order monadic logic and tree automata, Proceedings , Tenth Annual IEEE Symposium on Logic in Computer Science (LICS), pp.508-517, 1995.
DOI : 10.1109/lics.1995.523285
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.6657

H. Comon and V. Cortier, Tree automata with one memory set constraints and cryptographic protocols, Theoretical Computer Science, vol.331, issue.1, pp.143-214
DOI : 10.1016/j.tcs.2004.09.036
URL : https://hal.archives-ouvertes.fr/inria-00000553

H. Comon and F. Jacquemard, Ground reducibility is EXPTIME-complete, Proceedings , 12 th Annual IEEE Symposium on Logic in Computer Science (LICS), pp.26-34, 1997.
DOI : 10.1109/lics.1997.614922
URL : https://hal.archives-ouvertes.fr/inria-00578859

H. Comon and F. Jacquemard, Ground reducibility is EXPTIME-complete. Information and Computation, pp.123-153, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00578859

H. Comon, M. Haberstrau, and J. P. Jouannaud, Syntacticness, cyclesyntacticness , and shallow theories Information and Computation, pp.154-191, 1994.
DOI : 10.1006/inco.1994.1043
URL : http://doi.org/10.1006/inco.1994.1043

H. Comon-lundh, Inductionless induction, Handbook of Automated Reasoning, pp.913-962, 2001.

H. Comon-lundh, F. Jacquemard, and N. Perrin, Tree Automata with Memory, Visibility and Structural Constraints, Proceedings of the 10th International Conference on Foundations of Software Science and Computation Structures, pp.168-182, 2007.
DOI : 10.1007/978-3-540-71389-0_13
URL : https://hal.archives-ouvertes.fr/inria-00579009

H. Comon-lundh, F. Jacquemard, and N. Perrin, Visibly Tree Automata with Memory and Constraints, Logical Methods in Computer Science, vol.4, issue.2, pp.10-2168, 2008.
DOI : 10.2168/LMCS-4(2:8)2008
URL : https://hal.archives-ouvertes.fr/inria-00578844

J. Coquidé, M. Dauchet, R. Gilleron, and S. Vágvölgyi, Bottom-up tree pushdown automata: classification and connection with rewrite systems, Theoretical Computer Science, vol.127, issue.1, pp.69-98, 1994.
DOI : 10.1016/0304-3975(94)90101-5

B. Courcelle, On Recognizable Sets and Tree Automata, Resolution of Equations in Algebraic Structures Algebraic techniques, pp.93-126, 1989.
DOI : 10.1016/B978-0-12-046370-1.50009-7

B. Courcelle, Graph Rewriting: An Algebraic and Logic Approach, pp.193-242, 1990.
DOI : 10.1016/B978-0-444-88074-1.50010-X

D. Zilio and D. Lugiez, XML schema, tree logic and sheaves automata, Applicable Algebra in Engineering, Communication and Computing, vol.2, issue.6, pp.337-377, 2006.
DOI : 10.1007/s00200-006-0016-7
URL : https://hal.archives-ouvertes.fr/hal-00109288

E. Damiani, S. D. Di-vimercati, S. Paraboschi, and P. Samarati, Securing XML Documents, Proceedings of the 7th International Conference on Extending Database Technology, pp.121-135, 2000.
DOI : 10.1007/3-540-46439-5_8

J. Dassow, G. Paun, and A. Salomaa, Grammars with Controlled Derivations, Handbook of Formal Languages, pp.101-154, 1997.
DOI : 10.1007/978-3-662-07675-0_3

M. Dauchet and S. Tison, The theory of ground rewrite systems is decidable, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science, pp.242-248, 1990.
DOI : 10.1109/LICS.1990.113750

M. Dauchet, S. Tison, T. Heuillard, and P. Lescanne, Decidability of confluence for ground term rewriting systems, Proceedings of the second Symposium on Logic in Computer Science (LICS), pp.353-359
DOI : 10.1007/BFb0028794

M. Dauchet, A. Caron, and J. Coquidé, Automata for Reduction Properties Solving, Journal of Symbolic Computation, vol.20, issue.2, pp.215-233, 1995.
DOI : 10.1006/jsco.1995.1048

C. David, L. Libkin, and T. Tan, Efficient reasoning about data trees via integer linear programming, Proceedings of the 14th International Conference on Database Theory (ICDT), ICDT '11, pp.18-29, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00835833

S. Delaune and F. Jacquemard, A decision procedure for the verification of security protocols with explicit destructors, Proceedings of the 11th ACM conference on Computer and communications security , CCS '04, pp.278-287, 2004.
DOI : 10.1145/1030083.1030121
URL : https://hal.archives-ouvertes.fr/inria-00579012

G. Delzanno, J. Raskin, and L. V. Begin, Towards the Automated Verification of Multithreaded Java Programs, Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS '02, pp.173-187, 2002.
DOI : 10.1007/3-540-46002-0_13

S. Demri and R. Lazi?, Ltl with the freeze quantifier and register automata

N. Dershowitz and J. Jouannaud, Rewrite systems Handbook of Theoretical Computer Science, volume volume B: Formal Models and Semantics, pp.243-320, 1990.

J. Orso and T. Touili, Regular hedge model checking, Proc. of the 4th IFIP International Conference on Theoretical Computer Science (TCS'06). IFIP, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00161094

I. Durand and A. Middeldorp, Decidable call-by-need computations in term rewriting Information and Computation Sénizergues. Bottom-up rewriting is inverse recognizability preserving, B6WGK-4F7VFHM-2 Proceedings of the 18th International Conference on Term Rewriting and Applications (RTA), pp.95-126, 2005.

I. Durand and M. Sylvestre, Left-linear Bounded TRSs are Inverse Recognizability Preserving, 22nd International Conference on Rewriting Techniques and Applications (RTA'11), volume 10 of Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, pp.361-3763135, 2011.
DOI : 10.1007/978-3-540-73449-9_10

I. Durand, G. Sénizergues, and M. Sylvestre, Termination of linear bounded term rewriting systems, Proceedings of the 21st International Conference on Rewriting Techniques and Applications of Leibniz International Proceedings in Informatics (LIPIcs) Schloss Dagstuhl?Leibniz-Zentrum fuer Informatik, pp.341-356, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00506552

J. Engelfriet, Top-down tree transducers with regular look-ahead. Theory of Computing Systems, pp.289-303, 1976.
DOI : 10.7146/dpb.v4i49.6468
URL : http://ojs.statsbiblioteket.dk/index.php/daimipb/article/download/6468/5587

J. Engelfriet, Three hierarchies of transducers, Mathematical Systems Theory, vol.37, issue.1, pp.95-125, 1981.
DOI : 10.1007/BF01786975

J. Engelfriet and H. Vogler, Macro tree transducers, Journal of Computer and System Sciences, vol.31, issue.1, pp.71-146, 1985.
DOI : 10.1016/0022-0000(85)90066-2

J. Engelfriet, S. Maneth, and H. Seidl, Deciding equivalence of top???down XML transformations in polynomial time, Journal of Computer and System Sciences, vol.75, issue.5, pp.271-286, 2009.
DOI : 10.1016/j.jcss.2009.01.001

R. Fagin, B. Kimelfeld, Y. Li, S. Raghavan, and S. Vaithyanathan, Rewrite rules for search database systems, Proceedings of the 30th symposium on Principles of database systems of data, PODS '11, pp.271-282, 2011.
DOI : 10.1145/1989284.1989322

W. Fan and L. Libkin, On XML integrity constraints in the presence of DTDs, Journal of the ACM, vol.49, issue.3, pp.368-406, 2002.
DOI : 10.1145/567112.567117

W. Fan and J. Siméon, Integrity constraints for xml, Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '00, pp.23-34, 2000.

W. Fan, C. Chan, and M. Garofalakis, Secure XML querying with security views, Proceedings of the 2004 ACM SIGMOD international conference on Management of data , SIGMOD '04, pp.587-598, 2004.
DOI : 10.1145/1007568.1007634
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.61.2679

C. G. Fermüller, A. Leitsch, U. Hustadt, and T. Tammet, Resolution Decision Procedures, pp.1791-1849, 2001.
DOI : 10.1016/B978-044450813-3/50027-8

E. Filiot, J. Talbot, and S. Tison, Satisfiability of a Spatial Logic with Tree Variables, Proceedings of the 21st International Workshop on Computer Science Logic, pp.130-145, 2007.
DOI : 10.1007/978-3-540-74915-8_13
URL : https://hal.archives-ouvertes.fr/inria-00148462

E. Filiot, J. Talbot, and S. Tison, Tree Automata with Global Constraints, 12th International Conference in Developments in Language Theory, pp.314-326, 2008.
DOI : 10.1007/978-3-540-85780-8_25
URL : https://hal.archives-ouvertes.fr/inria-00292027

N. Francis, C. David, and L. Libkin, A direct translation from xpath to nondeterministic automata, 5th Alberto Mendelzon International Workshop on Foundations of Data Management, 2011.

L. Fribourg, A strong restriction of the inductive completion procedure, Journal of Symbolic Computation, vol.8, issue.3, pp.253-276, 1989.
DOI : 10.1016/S0747-7171(89)80069-0

M. Frick, M. Grohe, and C. Koch, Query evaluation on compressed trees (extended abstract), Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, p.188, 2003.
DOI : 10.1109/lics.2003.1210058
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.127.5196

T. Frühwirth, E. Shapiro, M. Vardi, and E. Yardeni, Logic programs as types for logic programs, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science, pp.300-309, 1991.
DOI : 10.1109/LICS.1991.151654

I. Fundulaki and S. Maneth, Formalizing XML access control for update operations, Proceedings of the 12th ACM symposium on Access control models and technologies , SACMAT '07, pp.169-174, 2007.
DOI : 10.1145/1266840.1266868

K. Futatsugi, J. A. Goguen, J. Jouannaud, and J. Meseguer, Principles of OBJ2, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '85, pp.52-66, 1985.
DOI : 10.1145/318593.318610

H. Ganzinger and J. Stuber, Inductive theorem proving by consistency for first-order clauses, Proceedings of the Third International Workshop on Conditional Term Rewriting Systems, pp.226-241, 1993.

H. Ganzinger, F. Jacquemard, and M. Veanes, Rigid Reachability, Proc. ASIAN'98, 1998.
DOI : 10.1007/3-540-49366-2_2
URL : https://hal.archives-ouvertes.fr/inria-00098741

H. Ganzinger, F. Jacquemard, and M. Veanes, RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION, International Journal of Foundations of Computer Science, vol.11, issue.01, pp.3-27, 2000.
DOI : 10.1142/S012905410000003X
URL : https://hal.archives-ouvertes.fr/inria-00099097

A. Gascón, G. Godoy, and F. Jacquemard, Closure of Tree Automata Languages under Innermost Rewriting, Proceedings of the 8th International Workshop on Reduction Strategies in Rewriting and Programming, pp.23-38, 2008.
DOI : 10.1016/j.entcs.2009.03.033

T. Genet and F. Klay, Rewriting for Cryptographic Protocol Verification, Proc. of 17th Int. Conf. on Automated Deduction, pp.271-290, 2000.
DOI : 10.1007/10721959_21
URL : https://hal.archives-ouvertes.fr/inria-00072731

T. Genet and V. Rusu, Equational approximations for tree automata completion, 2124c281aa8809d67b302fd Symbolic Computation in Software Science, pp.574-597, 2010.
DOI : 10.1016/j.jsc.2010.01.009
URL : https://hal.archives-ouvertes.fr/inria-00495405

T. Genet and V. V. Tong, Reachability Analysis of Term Rewriting Systems with Timbuk, Proceedings of the Artificial Intelligence on Logic for Programming, LPAR '01, pp.695-706, 2001.
DOI : 10.1007/3-540-45653-8_48
URL : https://hal.archives-ouvertes.fr/inria-00072321

A. Geser, D. Hofbauer, J. Waldmann, and H. Zantema, On tree automata that certify termination of left-linear term rewriting systems Information and Computation, Special Issue: 16th International Conference on Rewriting Techniques and Applications, pp.512-534, 2007.

R. Gilleron, Decision problems for term rewriting systems and recognizable tree languages, Proceedings of the 8th annual symposium on Theoretical aspects of computer science (STACS), pp.148-159, 1991.
DOI : 10.1007/BFb0020795

R. Gilleron and S. Tison, Regular tree languages and rewrite systems, Fundam. Inform, vol.24, issue.12, pp.157-176, 1995.
URL : https://hal.archives-ouvertes.fr/inria-00538882

G. Godoy and H. Hernandez, Undecidable properties of flat term rewrite systems, Applicable Algebra in Engineering, Communication and Computing, vol.6, issue.1, pp.187-205, 2009.
DOI : 10.1007/s00200-009-0097-1

G. Godoy and E. Huntingford, Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems, Proceedings of the 18th International Conference of Rewriting Techniques and applications (RTA), pp.184-199, 2007.
DOI : 10.1007/978-3-540-73449-9_15

G. Godoy and F. Jacquemard, Unique Normalization for Shallow TRS, 20th International Conference on Rewriting Techniques and Applications (RTA), pp.63-77, 2009.
DOI : 10.1007/11805618_26
URL : https://hal.archives-ouvertes.fr/inria-00578959

G. Godoy and S. Tison, On the Normalization and Unique Normalization Properties of Term Rewrite Systems, Proc. 21st International Conference on Automated Deduction (CADE), pp.247-262, 2007.
DOI : 10.1007/978-3-540-73595-3_17
URL : https://hal.archives-ouvertes.fr/hal-00190004

G. Godoy and A. Tiwari, Deciding Fundamental Properties of Right-(Ground or Variable) Rewrite Systems by Rewrite Closure, Intl. Joint Conf. on Automated Deduction, IJCAR, pp.91-106, 2004.
DOI : 10.1007/978-3-540-25984-8_5

G. Godoy and A. Tiwari, Confluence of Shallow Right-Linear Rewrite Systems, 19th International Workshop of Computer Science Logic, CSL, pp.541-556, 2005.
DOI : 10.1007/11538363_37

G. Godoy, E. Huntingford, and A. Tiwari, Termination of Rewriting with Right-Flat Rules, 18th International Conference on Term Rewriting and Applications (RTA), pp.200-213, 2007.
DOI : 10.1007/978-3-540-73449-9_16

G. Godoy, O. Giménez, L. Ramos, and C. Àlvarez, The hom problem is decidable, Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, pp.485-494

G. Gottlob and C. Koch, Monadic datalog and the expressive power of languages for Web information extraction, Journal of the ACM, vol.51, issue.1, pp.74-113, 2004.
DOI : 10.1145/962446.962450

J. Goubault-larrecq, Deciding by resolution, Information Processing Letters, vol.95, issue.3, pp.401-408, 2005.
DOI : 10.1016/j.ipl.2005.04.007

J. Goubault-larrecq, Démonstration automatique. MPRI Lecture Notes, 2006.

J. Goubault-larrecq, M. Roger, and K. N. Verma, Abstraction and resolution modulo AC: How to verify Diffie???Hellman-like protocols automatically, The Journal of Logic and Algebraic Programming, vol.64, issue.2, pp.219-251, 2005.
DOI : 10.1016/j.jlap.2004.09.004
URL : http://doi.org/10.1016/j.jlap.2004.09.004

I. Guessarian, Pushdown tree automata, Mathematical Systems Theory, vol.2, issue.1, pp.237-263, 1983.
DOI : 10.1007/BF01744582
URL : https://hal.archives-ouvertes.fr/hal-00020941

P. Gyenizse and S. Vágvölgyi, Linear generalized semi-monadic rewrite systems effectively preserve recognizability, Theoretical Computer Science, vol.194, issue.1-2, pp.87-122, 1998.
DOI : 10.1016/S0304-3975(96)00333-7

P. Habermehl, R. Iosif, and T. Vojnar, Automata-based verification of programs with tree updates, Acta Informatica, vol.24, issue.3, pp.1-31, 2010.
DOI : 10.1007/s00236-009-0108-5
URL : https://hal.archives-ouvertes.fr/hal-00150145

D. Hofbauer and J. Waldmann, Deleting string rewriting systems preserve regularity, Theoretical Computer Science, vol.327, issue.3, pp.301-317, 2004.
DOI : 10.1016/j.tcs.2004.04.009

J. E. Hopcroft and J. D. Ullman, Introduction to automata theory, languages, and computation. Addison-Wesley series in computer science, 1979.

G. P. Huet and J. Hullot, Proofs by induction in equational theories with constructors, Journal of Computer and System Sciences, vol.25, issue.2, pp.239-266, 1982.
DOI : 10.1016/0022-0000(82)90006-X
URL : https://hal.archives-ouvertes.fr/inria-00076533

F. Jacquemard, Decidable approximations of term rewriting systems, Proceedings of the 7th International Conference on Rewriting Techniques and Applications (RTA), volume 1103 of Lecture Notes in Computer Science, pp.362-376, 1996.
DOI : 10.1007/3-540-61464-8_65

F. Jacquemard, Reachability and confluence are undecidable for flat term rewriting systems, Information Processing Letters, vol.87, issue.5, pp.265-270, 2003.
DOI : 10.1016/S0020-0190(03)00310-7
URL : https://hal.archives-ouvertes.fr/inria-00578875

F. Jacquemard and M. Rusinowitch, Closure of Hedge-Automata Languages by Hedge Rewriting, Proceedings of the 19th International Conference on Rewriting Techniques and Applications, pp.157-171, 2008.
DOI : 10.1007/978-3-540-70590-1_11
URL : https://hal.archives-ouvertes.fr/inria-00329803

F. Jacquemard and M. Rusinowitch, Rewrite closure of Hedgeautomata languages Research Report LSV-08-05, 2008.

F. Jacquemard and M. Rusinowitch, Rewrite-based verification of XML updates, Proceedings of the 12th international ACM SIGPLAN symposium on Principles and practice of declarative programming, PPDP '10, pp.119-130
DOI : 10.1145/1836089.1836105
URL : https://hal.archives-ouvertes.fr/inria-00578916

F. Jacquemard, C. Meyer, and C. Weidenbach, Unification in extensions of shallow equational theories, 9th Int. Conf. on Rewriting Techniques and Applications, RTA, pp.76-90, 1998.
DOI : 10.1007/BFb0052362
URL : https://hal.archives-ouvertes.fr/inria-00098740

F. Jacquemard, M. Rusinowitch, and L. Vigneron, Tree automata with equality constraints modulo equational theories, Proceedings of the 3rd International Joint Conference on Automated Reasoning (IJCAR'06), pp.557-571, 1007.
DOI : 10.1007/11814771_45
URL : https://hal.archives-ouvertes.fr/inria-00579011

F. Jacquemard, M. Rusinowitch, and L. Vigneron, Tree automata with equality constraints modulo equational theories, Journal of Logic and Algebraic Programming, pp.182-208, 2008.
DOI : 10.1007/11814771_45
URL : https://hal.archives-ouvertes.fr/inria-00579011

F. Jacquemard, M. Rusinowitch, and L. Vigneron, Tace: Library of tree automata with constraints, 2008.

F. Jacquemard, F. Klay, and C. Vacher, 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

F. Jacquemard, F. Klay, and C. Vacher, Rigid tree automata and applications, Information and Computation, vol.209, issue.3, pp.486-512, 2011.
DOI : 10.1016/j.ic.2010.11.015
URL : https://hal.archives-ouvertes.fr/inria-00578820

F. Jacquemard, Y. Kojima, and M. Sakai, Controlled Term Rewriting, Proceedings of the 8th International Symposium Frontiers of Combining Systems (FroCoS), pp.179-194, 2011.
DOI : 10.1007/3-540-59340-3_7
URL : https://hal.archives-ouvertes.fr/hal-00643160

F. Jacquemard, E. Lozes, R. Treinen, and J. Villard, Multiple Congruence Relations, First-Order Theories on Terms, and the Frames of the Applied Pi-Calculus, Theory of Security and Applications (TOSCA), 2011.
DOI : 10.1007/978-3-642-27375-9_10
URL : https://hal.archives-ouvertes.fr/inria-00578896

N. D. Jones, N. Andersen, J. Jouannaud, and E. Kounalis, Flow analysis of lazy higher-order functional programs, Proc. 1st IEEE Symposium on Logic in Computer Science, pp.120-136, 1986.
DOI : 10.1016/j.tcs.2006.12.030

M. Jurdzinski and R. Lazic, Alternation-free modal mu-calculus for data trees, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.131-140, 2007.
DOI : 10.1109/LICS.2007.11

D. Kapur and D. R. Musser, Proof by consistency, Artificial Intelligence, vol.31, issue.2, pp.125-157, 1987.
DOI : 10.1016/0004-3702(87)90017-8

M. Kay, Xsl transformations (xslt) 2.0. W3c working draft, World Wide Web Consortium, 2003.

C. Kirchner, H. Kirchner, and M. Rusinowitch, Deduction with symbolic constraints. Revue d'Intelligence Artificielle, pp.9-52, 1990.
URL : https://hal.archives-ouvertes.fr/inria-00077103

F. Klaedtke and H. Ruess, Parikh automata and monadic second-order logics with linear cardinality constraints, 2002.

N. Klarlund and A. Møller, MONA Version 1.4 User Manual Notes Series NS-01-1. Available from http, BRICS, 2001.

C. Koch, Efficient Processing of Expressive Node-Selecting Queries on XML Data in Secondary Storage, Proceedings of the 29th international conference on Very large data bases, pp.249-260, 2003.
DOI : 10.1016/B978-012722442-8/50030-6

J. Kochems and L. Ong, Improved functional flow and reachability analyses using indexed linear tree grammars, Proceedings of the 22nd International Conference on Rewriting Techniques and Applications (RTA) Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp.187-202, 2011.

Y. Kojima and M. Sakai, Innermost Reachability and Context Sensitive Reachability Properties Are Decidable for Linear Right-Shallow Term Rewriting Systems, Proceedings of the 19th International Conference on Rewriting Techniques and Applications (RTA), pp.187-201, 2008.
DOI : 10.1007/978-3-540-70590-1_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.159.6621

G. Kucherov and M. Tajine, Decidability of Regularity and Related Properties of Ground Normal Form Languages, Information and Computation, vol.118, issue.1, pp.91-100, 1995.
DOI : 10.1006/inco.1995.1054

S. Y. Kuroda, Classes of languages and linear-bounded automata, Information and Control, vol.7, issue.2, pp.207-223, 1964.
DOI : 10.1016/S0019-9958(64)90120-2

C. Löding, Ground Tree Rewriting Graphs of Bounded Tree Width, Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS'02), pp.559-570, 2002.
DOI : 10.1007/3-540-45841-7_46

C. Löding and A. Spelten, Transition Graphs of Rewriting Systems over Unranked Trees, 32nd International Symposium Proceedings, pp.67-77, 2007.
DOI : 10.1007/978-3-540-74456-6_8

C. Löding and K. Wong, On nondeterministic unranked tree automata with sibling constraints, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) of Leibniz International Proceedings in Informatics (LIPIcs), pp.311-322, 2009.

M. Lohrey and S. Maneth, The complexity of tree automata and XPath on grammar-compressed trees, Theoretical Computer Science, vol.363, issue.2, pp.196-210, 2006.
DOI : 10.1016/j.tcs.2006.07.024

S. Lucas, Context-Sensitive Rewriting Strategies, Information and Computation, vol.178, issue.1, pp.294-343, 2002.
DOI : 10.1016/S0890-5401(02)93176-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.43.5387

D. Lugiez, Multitree automata that count, Theoretical Computer Science, vol.333, issue.1-2, pp.225-263, 2005.
DOI : 10.1016/j.tcs.2004.10.023
URL : http://doi.org/10.1016/j.tcs.2004.10.023

D. Lugiez, Forward analysis of dynamic network of pushdown systems is easier without order, Proceedings of the 3rd International Workshop on Reachability Problems , RP '09, pp.127-140, 2009.

D. Lugiez and P. Schnoebelen, The regular viewpoint on PA-processes, Theoretical Computer Science, vol.274, issue.1-2, pp.89-115, 2002.
DOI : 10.1016/S0304-3975(00)00306-6
URL : https://hal.archives-ouvertes.fr/inria-00073287

S. Maneth, A. Berlea, T. Perst, and H. Seidl, XML type checking with macro tree transducers, Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '05, pp.283-294, 2005.
DOI : 10.1145/1065167.1065203
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.549

S. Maneth, T. Perst, and H. Seidl, Exact XML Type Checking in Polynomial Time, Proceedings of the 11th International Conference on Database Theory, pp.254-268, 2007.
DOI : 10.1007/11965893_18

W. Martens and F. Neven, Frontiers of tractability for typechecking simple xml transformations, Proceedings of the Twenty-third ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp.23-34, 2004.

M. Marx, E. Bertino, S. Christodoulakis, D. Plexousakis, V. Christophides et al., XPath with Conditional Axis Relations, Advances in Database Technology -EDBT 2004, pp.579-580, 2004.
DOI : 10.1007/978-3-540-24741-8_28

T. Milo, D. Suciu, and V. Vianu, Typechecking for XML transformers, Journal of Computer and System Sciences, vol.66, issue.1, pp.66-97, 2003.
DOI : 10.1016/S0022-0000(02)00030-2
URL : http://doi.org/10.1016/s0022-0000(02)00030-2

I. Mitsuhashi, M. Oyamaguchi, and F. Jacquemard, The Confluence Problem for Flat TRSs, Proc. 8th Intl. Conf. on Artificial Intelligence and Symbolic Computation, pp.68-81, 2006.
DOI : 10.1007/11856290_8
URL : https://hal.archives-ouvertes.fr/inria-00579010

J. Mongy, Transformation de noyaux reconnaissables d'arbres. Forêts RATEG, 1981.

. Moore, Computational complexity of the problem of tree generation under fine-grained access control policies, Information and Computation, vol.209, issue.3, pp.548-567, 2011.
DOI : 10.1016/j.ic.2010.11.019

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

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

M. Murata, D. Lee, and M. Mani, Taxonomy of XML schema languages using formal language theory, Extreme Markup Languages, 2000.
DOI : 10.1145/1111627.1111631

M. Murata, D. Lee, M. Mani, and K. Kawaguchi, Taxonomy of XML schema languages using formal language theory, ACM Transactions on Internet Technology, vol.5, issue.4, pp.660-704, 2005.
DOI : 10.1145/1111627.1111631

M. Murata, A. Tozawa, M. Kudo, and S. Hada, XML access control using static analysis, ACM Transactions on Information and System Security, vol.9, issue.3, pp.292-324, 2006.
DOI : 10.1145/1178618.1178621
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.452.2060

T. Nagaya and Y. Toyama, Decidability for Left-Linear Growing Term Rewriting Systems, Information and Computation, vol.178, issue.2, pp.499-514, 2002.
DOI : 10.1006/inco.2002.3157
URL : http://dx.doi.org/10.1006/inco.2002.3157

A. Neumann and H. Seidl, Locating Matches of Tree Patterns in Forests, Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp.134-145, 1998.
DOI : 10.1007/978-3-540-49382-2_12

F. Neven and T. Schwentick, Query automata over finite trees, Theoretical Computer Science, vol.275, issue.1-2, pp.633-674, 2002.
DOI : 10.1016/S0304-3975(01)00301-2
URL : http://doi.org/10.1016/s0304-3975(01)00301-2

F. Neven and J. Van-den-bussche, Expressiveness of structured document query languages based on attribute grammars, Journal of the ACM, vol.49, issue.1, pp.56-100, 2002.
DOI : 10.1145/505241.505245

F. Neven, T. Schwentick, and V. Vianu, Towards Regular Languages over Infinite Alphabets, Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, MFCS '01, pp.560-572, 2001.
DOI : 10.1007/3-540-44683-4_49
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.2304

J. Niehren, L. Planque, J. Talbot, and S. Tison, N-Ary Queries by Tree Automata, Proceedings of the 10th International Symposium on Database Programming Languages (DBPL), pp.217-231, 2005.
DOI : 10.1007/11601524_14
URL : https://hal.archives-ouvertes.fr/inria-00536522

F. Nielson, H. R. Nielson, and H. Seidl, Cryptographic Analysis in Cubic Time, Electronic Notes in Theoretical Computer Science, vol.62, 2001.
DOI : 10.1016/S1571-0661(04)00316-0

F. Nielson, H. R. Nielson, and H. Seidl, Normalizable Horn Clauses, Strongly Recognizable Relations, and Spi, Static Analysis, 9th Int. Symp., SAS, pp.20-35, 2002.
DOI : 10.1007/3-540-45789-5_5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.1256

R. Nieuwenhuis and A. Rubio, Paramodulation-Based Theorem Proving, chapter Handbook of Automated Reasoning, pp.371-443, 2001.

H. Ohsaki, Beyond Regularity: Equational Tree Automata for Associative and Commutative Theories, Proceedings of CSL 2001, 2001.
DOI : 10.1007/3-540-44802-0_38

H. Ohsaki and T. Takai, Decidability and Closure Properties of Equational Tree Languages, 13th Int. Conf. on Rewriting Techniques and Applications, RTA, pp.114-128, 2002.
DOI : 10.1007/3-540-45610-4_9

H. Ohsaki and T. Takai, Decidability and Closure Properties of Equational Tree Languages, 13th Int. Conf. on Rewriting Techniques and Applications (RTA), pp.114-128, 2002.
DOI : 10.1007/3-540-45610-4_9

H. Ohsaki, H. Seki, and T. Takai, Recognizing Boolean Closed A-Tree Languages with Membership Conditional Rewriting Mechanism, Proc. of the 14th Int. Conference on Rewriting Techniques and Applications (RTA 2003), pp.483-498, 2003.
DOI : 10.1007/3-540-44881-0_34

H. Ohsaki, J. Talbot, S. Tison, and Y. Roos, Monotone AC-Tree Automata, 12th International Conference on Logic for Programming Artificial Intelligence and Reasoning, 2005.
DOI : 10.1007/11591191_24
URL : https://hal.archives-ouvertes.fr/inria-00536693

M. Penttonen, One-sided and two-sided context in formal grammars, Information and Control, vol.25, issue.4, pp.371-392, 1974.
DOI : 10.1016/S0019-9958(74)91049-3

T. Perst and H. Seidl, Macro forest transducers, Information Processing Letters, vol.89, issue.3, pp.141-149, 2004.
DOI : 10.1016/j.ipl.2003.05.001
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.686.2441

. Th and . Place, Decidable Characterizations for Tree Logics Thèse de doctorat, Laboratoire Spécification et Vérification, 2010.

P. Réty and J. Vuotto, Tree automata for rewrite strategies, Journal of Symbolic Computation, vol.40, issue.1, pp.749-794, 2005.
DOI : 10.1016/j.jsc.2004.12.008

A. Reußand and H. Seidl, Bottom-up tree automata with term constraints, Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning, pp.581-593, 2010.

A. Riazanov and A. Voronkov, Splitting Without Backtracking, Proc. of the 17th Int. Joint Conf. on Artificial Intelligence, IJCAI, pp.611-617, 2001.

J. Robie, D. Chamberlin, M. Dyck, D. Florescu, J. Melton et al., Xquery update facility 1.0, 2011.

K. Salomaa, Deterministic tree pushdown automata and monadic tree rewriting systems, Journal of Computer and System Sciences, vol.37, issue.3, pp.367-394, 1988.
DOI : 10.1016/0022-0000(88)90014-1
URL : http://doi.org/10.1016/0022-0000(88)90014-1

K. M. Schimpf and J. Gallier, Tree pushdown automata, Journal of Computer and System Sciences, vol.30, issue.1, pp.25-40, 1985.
DOI : 10.1016/0022-0000(85)90002-9
URL : http://doi.org/10.1016/0022-0000(85)90002-9

T. Schwentick, Automata for XML???A survey, Journal of Computer and System Sciences, vol.73, issue.3, pp.289-315, 2007.
DOI : 10.1016/j.jcss.2006.10.003

S. Schwoon, Model-Checking Pushdown Systems, 2002.

H. Seidl, Haskell overloading is DEXPTIME-complete, Information Processing Letters, vol.52, issue.2, pp.57-600020, 1994.
DOI : 10.1016/0020-0190(94)00130-8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.8086

H. Seidl, Program Analysis through Finite Tree Automata, Lecture Notes in Computer Science, vol.95, issue.3, p.3, 2009.
DOI : 10.1007/978-3-540-69166-2_14

H. Seidl and K. N. Verma, Cryptographic Protocol Verification Using Tractable Classes of Horn Clauses, Program Analysis and Compilation, pp.97-119, 2007.
DOI : 10.1007/978-3-540-71322-7_5

H. Seidl and K. N. Verma, Flat and one-variable clauses, ACM Transactions on Computational Logic, vol.9, issue.4, 2008.
DOI : 10.1145/1380572.1380577

H. Seidl and K. N. Verma, Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case, Proceedings 20th International Conference on Rewriting Techniques and Applications (RTA), pp.118-132, 2009.
DOI : 10.1007/11532231_25

H. Seidl, T. Schwentick, and A. Muscholl, Numerical document queries, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.155-166, 2003.
DOI : 10.1145/773153.773169
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.4976

H. Seidl, T. Schwentick, A. Muscholl, and P. Habermehl, Counting in Trees for Free, Proc. ICALP'04, pp.1136-1149, 2004.
DOI : 10.1007/978-3-540-27836-8_94
URL : https://hal.archives-ouvertes.fr/hal-00159525

H. Seidl, T. Schwentick, and A. Muscholl, Counting in trees, Logic and Automata: History and Perspectives Logic and Games, pp.575-612, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00358327

H. Seki, T. Takai, Y. Fujinaka, and Y. Kaji, Layered Transducing Term Rewriting System and Its Recognizability Preserving Property, Int. Conf. on Rewriting Techniques and Applications (RTA), pp.98-113, 2002.
DOI : 10.1007/3-540-45610-4_8
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.4888

G. Sénizergues, Formal languages & word-rewriting, Term Rewriting, pp.75-94, 1993.
DOI : 10.1007/3-540-59340-3_7

T. Takai, Y. Kaji, and H. Seki, Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability, 11th International Conference on Rewriting Techniques and Applications (RTA), pp.246-260, 2000.
DOI : 10.1007/10721975_17

J. Thatcher and J. Wright, Generalized finite automata theory with an application to a decision problem of second-order logic, Mathematical Systems Theory, vol.12, issue.1, pp.57-81, 1968.
DOI : 10.1007/BF01691346

W. Thomas, Languages, Automata, and Logic, Handbook of Formal Languages, pp.389-455, 1997.
DOI : 10.1007/978-3-642-59126-6_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.8502

S. Tison, Tree automata and term rewrite systems Invited tutorial at the 11th Int, Conf. on Rewriting Techniques and Applications, RTA, 2000.

M. Tommasi, Automates d'arbres avec tests d'égalité entre cousins germains, 1992.

T. Touili, Computing transitive closures of hedge transformations, Proc. 1st International Workshop on Verification and Evaluation of Computer and Communication Systems (VECOS'07), eWIC Series, 2007.
DOI : 10.1504/IJCCBS.2012.045079
URL : https://hal.archives-ouvertes.fr/hal-00161088

T. Truderung, Selecting Theories and Recursive Protocols, Proceedings of the 16th International Conference on Concurrency Theory (CONCUR), pp.217-232, 2005.
DOI : 10.1007/11539452_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.488.1561

C. Vacher, Automates à contraintes globales pour la vérification de propriétés de sécurité, Thèse de doctorat, 2010.

S. Vágvölgyi and R. Gilleron, For a rewrite system it is decidable whether the set of irreducible ground terms is recognizable, Bulletin of the EATCS, vol.48, pp.197-209, 1992.

M. Y. Vardi and P. Wolper, An automata-theoretic approach to automatic program verification Logic in Computer Science, pp.332-344, 1986.

M. Veanes, On computational complexity of basic decision problems of finite tree automata, 1997.

K. N. Verma, Two-Way Equational Tree Automata, ENS Cachan, 2003.

K. N. Verma and J. Goubault-larrecq, Alternating two-way AC-tree automata Information and Computation, pp.817-869, 2007.

K. N. Verma and J. Goubault-larrecq, Alternating two-way AC-tree automata Information and Computation, pp.817-869, 2007.

K. N. Verma, H. Seidl, and T. Schwentick, On the Complexity of Equational Horn Clauses, 20th Int. Conf. on Automated Deduction (CADE), pp.337-352, 2005.
DOI : 10.1007/11532231_25

R. Verma, Complexity of normal form properties and reductions for rewriting problems, Fundamenta Informaticae, 2008.

R. M. Verma, M. Rusinowitch, and D. Lugiez, Algorithms and reductions for rewriting problems, Fundam. Inf, vol.46, pp.257-276, 2001.
DOI : 10.1007/BFb0052369
URL : https://hal.archives-ouvertes.fr/inria-00073431

V. Vianu, A web odyssey: from codd to xml, Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, PODS '01, pp.1-15, 2001.

Y. Wang and M. Sakai, Decidability of Termination for Semi-constructor TRSs, Left-Linear Shallow TRSs and Related Systems, Proceedings of the 17th International Conference on Rewriting Techniques and Applications (RTA), pp.343-356, 2006.
DOI : 10.1007/11805618_26

C. Weidenbach, D. Dimova, A. Fietzke, R. Kumar, M. Suda et al., SPASS Version 3.5, 22nd International Conference on Automated Deduction (CADE), pp.140-145
DOI : 10.1007/978-3-540-73595-3_38

P. Wolper and B. Boigelot, Verifying systems with infinite but regular state spaces, Proceedings of the 10th International Conference on Computer Aided Verification, CAV '98, pp.88-97, 1998.
DOI : 10.1007/BFb0028736

K. Wong and C. Löding, Unranked tree automata with sibling equalities and disequalities, Proceedings of 34th International Colloquium on Automata, Languages and Programming (ICALP), pp.875-887, 2007.

N. B. Youssef, A. Bouhoula, and F. Jacquemard, Automatic verification of conformance of firewall configurations to security policies, Proceedings of the 14th IEEE Symposium on Computers and Communications (ISCC), pp.526-531, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00578926

H. Zhang, D. Kapur, and M. S. Krishnamoorthy, A mechanizable induction principle for equational specifications, Proc. 9th Int. Conf. on Automated Deduction, pp.162-181, 1988.
DOI : 10.1007/BFb0012831