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

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

G. Feuillade, T. Genet, and V. Viet-triem-tong, Reachability Analysis over Term Rewriting Systems, Journal of Automated Reasoning, vol.37, issue.1?2, pp.341-383, 2004.
DOI : 10.1007/s10817-004-6246-0

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

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

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

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, Rewrite Closure and CF Hedge Automata, 2012.
DOI : 10.1007/978-3-642-37064-9_33

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

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

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

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

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