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

E. Balland, P. Brauner, R. Kopetz, P. Moreau, and A. Reilles, Tom: Piggybacking Rewriting on Java, Proceedings of the 18th Conference on Rewriting Techniques and Applications, pp.36-47, 2007.
DOI : 10.1007/978-3-540-73449-9_5

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

E. Balland and P. Moreau, Optimizing pattern matching compilation by program transformation, 3rd Workshop on Software Evolution through Transformations (SeTra'06). Electronic Communications of EASST, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00001127

Y. Boichut, T. Genet, T. Jensen, and L. L. Roux, Rewriting Approximations for Fast Prototyping of Static Analyzers, Proceedings of the 18th Conference on Rewriting Techniques and Applications, pp.48-62, 2007.
DOI : 10.1007/978-3-540-73449-9_6

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

Y. Boichut, P. Héam, and O. Kouchnarenko, Automatic Verification of Security Protocols Using Approximations, Research Report RR, vol.5727, 2005.
URL : https://hal.archives-ouvertes.fr/inria-00070291

M. Clavel, M. Palomino, and A. Riesco, Introducing the ITP tool: a tutorial, J. UCS, vol.12, issue.11, pp.1618-1650, 2006.

N. Dershowitz and J. Jouannaud, Handbook of Theoretical Computer Science, volume B, chapter 6: Rewrite Systems, pp.244-320, 1990.

S. Eker, J. Meseguer, and A. Sridharanarayanan, The Maude LTL Model Checker and Its Implementation, SPIN, volume 2648 of LNCS, pp.230-234, 2003.
DOI : 10.1007/3-540-44829-2_16

A. Farzan, C. Chen, J. Meseguer, and G. Rosu, Formal Analysis of Java Programs in JavaFAN, CAV, pp.501-505, 2004.
DOI : 10.1007/978-3-540-27813-9_46

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 and F. Klay, Rewriting for Cryptographic Protocol Verification, Proc. 17th CADE Conf., Pittsburgh (Pen., USA), volume 1831 of LNAI, 2000.
DOI : 10.1007/10721959_21

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

T. Genet, Y. Tang-talpin, V. Viet-triem, and . Tong, Verification of Copy Protection Cryptographic Protocol using Approximations of Term Rewriting Systems, Proceedings of Workshop on Issues in the Theory of Security, 2003.

T. Genet, V. Viet-triem, and . Tong, Timbuk 2.0 ? a Tree Automata Library, 2000.

R. Gilleron and S. Tison, Regular tree languages and rewrite systems, Fundamenta Informaticae, vol.24, pp.157-175, 1995.
URL : https://hal.archives-ouvertes.fr/inria-00538882

J. Meseguer and G. Rosu, Rewriting Logic Semantics: From Language Specifications to Formal Analysis Tools, IJCAR, pp.1-44, 2004.
DOI : 10.1007/978-3-540-25984-8_1

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

T. Takai, A Verification Technique Using Term Rewriting Systems and Abstract Interpretation, Proc. 15th RTA Conf, pp.119-133, 2004.
DOI : 10.1007/978-3-540-25979-4_9

. Thomson, Smartright technical white paper v1.0, 2001.