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

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

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 F. De-comite, A gap between linear and non linear term-rewriting systems, On Rewriting Techniques and Applications, pp.95-104, 1987.
DOI : 10.1007/3-540-17220-3_9

I. Durand and G. Sénizergues, Bottom-Up Rewriting Is Inverse Recognizability Preserving, Proceedings of the 18th International Conference on Term Rewriting and Applications (RTA), pp.107-121, 2007.
DOI : 10.1007/978-3-540-73449-9_10
URL : https://hal.archives-ouvertes.fr/hal-00306277

J. Engelfriet, E. M. Schmidt, O. Io, and . Ii, IO and OI. II, Journal of Computer and System Sciences, vol.16, issue.1, pp.67-99, 1978.
DOI : 10.1016/0022-0000(78)90051-X

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

Z. Fülöp, E. Jurvanen, M. Steinby, and S. Vágvölgyi, On one-pass term rewriting, Mathematical Foundations of Computer Science Lecture Notes in Computer Science, vol.1450, pp.248-256, 1998.
DOI : 10.1007/BFb0055774

Z. Fülöp, E. Jurvanen, M. Steinby, and S. Vágvölgyi, On one-pass term rewriting, Acta Cybernetica, vol.14, issue.1, pp.83-98, 1999.

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

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 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, 7th International Conference on Language and Automata Theory and Application, 2013.
DOI : 10.1007/978-3-642-37064-9_33
URL : https://hal.archives-ouvertes.fr/hal-00767719

N. D. Jones and N. Andersen, Flow analysis of lazy higher-order functional programs, Theoretical Computer Science, vol.375, issue.1-3, pp.120-136, 2007.
DOI : 10.1016/j.tcs.2006.12.030

Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar, Symbolic model checking with rich assertional languages, Theoretical Computer Science, vol.256, issue.1-2, pp.93-112, 2001.
DOI : 10.1016/S0304-3975(00)00103-1

J. Kochems and C. L. Ong, Improved functional flow and reachability analyses using indexed linear tree grammars, 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.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

S. Lucas, Context-sensitive rewriting strategies. Information and Computation, pp.294-343, 2002.

R. D. Marc and . Bezem, Term Rewriting Systems by Terese, volume 55 of Cambridge Tracts in Theoretical Computer Science, 2003.

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

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

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

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

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

G. Sénizergues, Some decision problems about controlled rewriting systems, Theoretical Computer Science, vol.71, issue.3, pp.281-346, 1990.
DOI : 10.1016/0304-3975(90)90048-M