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

L. Bachmair, A. Tiwari, and L. Vigneron, Abstract Congruence Closure, Journal of Automated Reasoning, vol.31, issue.2, pp.129-168, 2003.
DOI : 10.1023/B:JARS.0000009518.26415.49
URL : https://hal.archives-ouvertes.fr/inria-00099511

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-oliet et al., All About Maude, A High-Performance Logical Framework, Lecture Notes in Computer Science, vol.4350, 2007.

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-4341, 2004.
DOI : 10.1007/s10817-004-6246-0
URL : https://hal.archives-ouvertes.fr/inria-00071609

T. Genet, Decidable approximations of sets of descendants and sets of normal forms, Proc. 9th RTA Conf., Tsukuba (Japan), volume 1379 of LNCS, pp.151-165, 1998.
DOI : 10.1007/BFb0052368
URL : https://hal.archives-ouvertes.fr/inria-00073364

T. Genet, Reachability analysis of rewriting for software verification Université de Rennes 1 Habilitation document, 2009.

T. Genet, Termination criteria for tree automata completion, Journal of Logical and Algebraic Methods in Programming, vol.85, issue.1, pp.2014-53
DOI : 10.1016/j.jlamp.2015.05.003
URL : https://hal.archives-ouvertes.fr/hal-01194533

T. Genet, Towards Static Analysis of Functional Programs Using Tree Automata Completion, Proceedings of WRLA'14, 2014.
DOI : 10.1007/978-3-319-12904-4_8
URL : https://hal.archives-ouvertes.fr/hal-00921814

T. Genet and R. Rusu, Equational approximations for tree automata completion, Journal of Symbolic Computation, vol.45, issue.5, pp.574-597, 2010.
DOI : 10.1016/j.jsc.2010.01.009
URL : https://hal.archives-ouvertes.fr/inria-00495405

T. Genet, V. Viet-triem, and . Tong, Timbuk ? a Tree Automata Library, IRISA / Université de Rennes, vol.1, 2001.

T. Takai, Y. Kaji, and H. Seki, Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability, Proc. 11th RTA Conf., Norwich (UK), volume 1833 of LNCS, 2000.
DOI : 10.1007/10721975_17