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

T. Schwentick, X. Automata-for, and . Survey, 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

T. Touili, Computing transitive closures of hedge transformations, International Journal of Critical Computer-Based Systems, vol.3, issue.1/2, pp.132-150, 2012.
DOI : 10.1504/IJCCBS.2012.045079
URL : https://hal.archives-ouvertes.fr/hal-00161088

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

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

G. Feuillade, T. Genet, V. Viet-triem, and . Tong, Reachability Analysis over Term Rewriting Systems, Journal of Automated Reasoning, vol.37, issue.1?2, pp.3-4, 2004.
DOI : 10.1007/s10817-004-6246-0
URL : https://hal.archives-ouvertes.fr/inria-00071609

A. Bouajjani and T. Touili, On Computing Reachability Sets of Process Rewrite Systems, Proceedings 16th Int. Conf. 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

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

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

A. Tozawa, Towards static type checking for XSLT, Proceedings of the 2001 ACM Symposium on Document engineering , DocEng '01, pp.18-27, 2001.
DOI : 10.1145/502187.502191

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

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

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

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, 2010.
DOI : 10.1145/1836089.1836105
URL : https://hal.archives-ouvertes.fr/inria-00578916

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

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

A. Solimando, G. Delzanno, and G. Guerrini, Automata-based Static Analysis of XML Document Adaptation, Proceedings 3d International Symposium on Games, Automata, Logics and Formal Verification, pp.85-98, 2012.
DOI : 10.4204/EPTCS.96.7

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

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

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

L. Bravo, J. Cheney, I. Fundulaki, and R. Segovia, Consistency and repair for XML write-access control policies, The VLDB Journal, vol.29, issue.2, pp.843-867, 2012.
DOI : 10.1007/s00778-012-0273-y

F. Jacquemard and M. Rusinowitch, Rewrite Closure and CF Hedge Automata, Proceedings of the 7th International Conference on Language and Automata Theory and Applications (LATA), pp.371-382, 2013.
DOI : 10.1007/978-3-642-37064-9_33
URL : https://hal.archives-ouvertes.fr/hal-00767719

J. Cocke and J. T. Schwartz, Programming languages and their compilers: Preliminary notes, 1970.

D. H. Younger, Recognition and parsing of context-free languages in time n3, Information and Control, vol.10, issue.2, pp.189-208, 1967.
DOI : 10.1016/S0019-9958(67)80007-X

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

M. Bojanczyk and I. Walukiewicz, Forest algebras, in: Logic and Automata: History and Perspectives, pp.107-132, 2008.

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/hal-00526987

W. Karianto 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.
DOI : 10.1007/978-3-540-73420-8_75
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.5167

J. Coquide, M. Dauchet, R. Gilleron, and S. Vagvolgyi, 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
URL : https://hal.archives-ouvertes.fr/inria-00538881

N. 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

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, Y. Kojima, and M. Sakai, Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies, 25th International Conference on Automated Deduction, 2015.
DOI : 10.1007/978-3-319-21401-6_9
URL : https://hal.archives-ouvertes.fr/hal-01149319

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

A. Spelten, Rewriting Systems over Unranked Trees, 2006.

R. Gilleron, Decision problems for term rewrite systems and recognizable tree languages, th Annual Symposium on Theoretical Aspects of Computer Science, pp.148-159, 1991.
DOI : 10.1007/bfb0020795
URL : https://hal.archives-ouvertes.fr/inria-00538875