S. Du-langage, L'environnement servirait d'une part à gérer les points-fixes et d'autre part à éviter des calculs inutiles (par memoization)

P. Saman, J. M. Amarasinghe, M. S. Anderson, . Lam, and W. Amy, Lim ? « An overview of a compiler for scalable parallel machines, LCPC'93 : Proceedings of the Sixth Workshop on Languages and Compilers for Parallel Computing, pp.253-272, 1993.

W. Andrew and M. J. Appel, Gonçalves ? « Hash-consing garbage collection, p.28, 1993.

M. Zena, . Ariola, and W. Jan, Klop ? « Equational term graph rewriting Categories, types, and structures : an introduction to category theory for the working computer scientist, Fundamenta Informaticae, vol.26, issue.116, pp.207-240, 1991.

U. Assmann and ?. Edge, Addition Rewrite Systems and Their Relevance to Program Analysis », 5th Workshop on Graph Grammars and Their Application To Computer Science, Lecture Notes in Computer Science, vol.1073, p.112, 19941995-11.

P. Henk, Barendregt ? The lambda calculus : its syntax and semantics, North-Holland, p.15, 1984.

E. Balland, P. Brauner, and ?. , Term-graph Rewriting in Tom Using Relative Positions, Electronic Notes in Theoretical Computer Science, vol.203, issue.1, pp.3-17, 2007.
DOI : 10.1016/j.entcs.2008.03.030
URL : https://hal.archives-ouvertes.fr/inria-00129515

E. Balland, Y. Boichut, T. Genet, P. Moreau, and ?. , Towards an Efficient Implementation of Tree Automata Completion, Lecture Notes in Computer Science, vol.5140, pp.67-82, 2008.
DOI : 10.1007/978-3-540-79980-1_6
URL : https://hal.archives-ouvertes.fr/inria-00304010

E. Balland, P. Brauner, R. Kopetz, P. Moreau, A. Reilles et al., Tom: Piggybacking Rewriting on Java, RTA'07 : 18th International 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

B. Bce-]-«-site-officiel-de, Byte Code Engineering Library, p.152

Y. Boichut, T. Genet, T. Jensen, and L. , Rewriting Approximations for Fast Prototyping of Static Analyzers, RTA'07 : Proceedings of the 18th International Conference on Rewriting Techniques and Applications Principles of superdeduction », LICS'07 : Proceedings of the 22nd Annual IEEE Symposium on Logic In Computer Science (L. Ong, pp.48-62, 2007.
DOI : 10.1007/978-3-540-73449-9_6
URL : https://hal.archives-ouvertes.fr/hal-00463418

J. Bézivin, F. Jouault, and ?. , Using ATL for Checking Models, Electronic Notes in Theoretical Computer Science, vol.152, pp.69-81, 2006.
DOI : 10.1016/j.entcs.2006.01.015

E. Balland, C. Kirchner, P. Moreau, and ?. ». Islands, Formal Islands, 11th International Conference of Algebraic Methodology and Software Technology, pp.51-65, 2006.
DOI : 10.1007/11784180_7
URL : https://hal.archives-ouvertes.fr/inria-00001146

M. Bezem, J. Klop, and R. De-vr?er, Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science, vol.15, issue.6 11, p.16, 2003.

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

E. Balland, P. Moreau, and ?. , Term-Graph Rewriting Via Explicit Paths, RTA'08 : 19th International Conference on Rewriting Techniques and Applications, pp.32-47, 2008.
DOI : 10.1007/978-3-540-70590-1_3
URL : https://hal.archives-ouvertes.fr/inria-00173535

G. Bonfante and J. -. , Yves Marion et Romain Péchoux ? « A characterization of alternating log time by first order functional programs, LPAR'06 : Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning, pp.90-104, 2006.

E. Balland, P. Moreau, A. Reilles, ?. Bytecode-rewriting-in-tomk, S. Araki et al., Electronic Notes in Theoretical Computer Science 142 [BS02] Claus Brabrand et Michael I. Schwartzbach ? « Growing languages with metamorphic syntax macros », PEPM'02 : Proceedings of the 2002 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation [CC77] Patrick Cousot et Radhia Cousot ? « Abstract interpretation : a unified lattice model for static analysis of programs by construction or approximation of fixpoints (Cyclic) term graph rewriting is adequate for rational parallel term rewriting, [BRL03] L. Burdy, A. Requet et J.-L. Lanet ? « Java applet correctness : A developer-oriented approach », FME'03 : Formal Methods : International Symposium of Formal Methods Europe Thèse POPL'77 : Proceedings of the 4th ACM SIGACT- SIGPLAN symposium on Principles of programming languages et Hongjun Zheng ? « Bandera : extracting finite-state models from java source code », ICSE'00 : Proceedings of the 22nd international conference on Software engineering, pp.19-33, 1977.

M. Clavel, S. Eker, P. Lincoln, ?. Maude, ]. E. Clarke et al., specification and programming in rewriting logic Sistla ? « Automatic verification of finite-state concurrent systems using temporal logic specifications », TO- PLAS, CG95] Andrea Corradini et Fabio Gadducci ? « Cpo models for infinite term rewriting », AMAST'95 : Proceedings of the 4th International Conference in Algebraic Methodology and Software Technology, pp.63-244, 1986.

G. György-csertan, I. Huszerl, Z. Majzik, and . Pap, Andréas Pataricza et Daniel Varro ? « Viatra : Visual automated transformations for formal verification and validation of uml models, ASE'02 : Proceedings of the 17th IEEE International Conference on Automated Software Engineering, pp.267-270, 2002.

K. Kirchner-claude, ?. Radu-et-moreau-pierre-etienne, ». Antipattern-matching-modulo, and L. , Anti-pattern Matching Modulo, 08 : Proceedings of the 2nd International Conference on Language and Automata Theory and Applications, pp.275-286, 1997.
DOI : 10.1007/978-3-540-88282-4_26

A. Van-deursen, Domain-specific languages, ACM SIGPLAN Notices, vol.35, issue.6, pp.26-36, 2000.
DOI : 10.1145/352029.352035

D. J. Dougherty, P. Lescanne, L. Liquori, and ?. , Addressed term rewriting systems: application to a typed object calculus, Mathematical Structures in Computer Science, vol.16, issue.04, pp.667-709, 1998.
DOI : 10.1017/S096012950600541X
URL : https://hal.archives-ouvertes.fr/hal-01148846

H. Ehrig, G. Engels, and H. Kreowski, Rozenberg (éds.) ? Handbook on Graph Grammars and Computing by Graph Transformation : Applications , Languages, and Tools, World Scientific, vol.2, p.113, 1999.

C. Elliott, Sigbjorn Finne et Oege de Moor ? « Compiling embedded languages », SAIG'00 :Semantics, Applications, and Implementation of Program Generation, pp.9-27, 2000.

A. Eisenberg, J. Melton, and ?. , SQLJ Part 0, now known as SQL/OLB (Object-Language Bindings), ACM SIGMOD Record, vol.27, issue.4, pp.94-100, 1998.
DOI : 10.1145/306101.306144

C. Flanagan, K. Rustan, M. Leino, M. Lillibridge, G. Nelson et al., Saxe et Raymie Stata ? « Extended static checking for java, PLDI'02 : Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, pp.234-245, 2002.

N. Stephen, . Freund, C. John, ?. Mitchell, . Java-bytecode-language et al., 140 [FM07] Jean-Christophe Filliâtre et Claude Marché ? « The why/krakatoa/caduceus platform for deductive program verification, CAV'07 : Proceedings of the 19th International Conference on Computer Aided Verification Fujaba official web site, pp.147-166, 1999.

G. Geiss, D. Veit-batz, and . Grund, Sebastian Hack et Adam Szalkowski ? « Grgen : A fast spo based graph rewriting tool, ICGT'06 : Third International Conference on Graph Transformation, pp.383-397, 2006.

E. Gamma and R. Helm, Design Patterns: Abstraction and Reuse of Object-Oriented Design, Lecture Notes in Computer Science, vol.707, pp.406-431, 1993.
DOI : 10.1007/3-540-47910-4_21

[. Gamma and R. Helm, Ralph Johnson et John Vlissides ? Design patterns : elements of reusable object-oriented software, p.34, 1995.

E. Steven and . Ganz, Amr Sabry et Walid Taha ? « Macros as multi-stage computations : Type-safe, generative, binding macros in macroml Roel Wuyts, Stéphane Ducasse et Maja D'Hondt ? « Inter-language reflection : A conceptual model and its implementation, ICFP'01 : International Conference on Functional Programming, pp.74-85, 2001.

T. Joseph-goguen, J. Winkler, and . Meseguer, Cambridge, 1993. 60 [Hoa69] C. A. R. Hoare ? « An axiomatic basis for computer programming, HP91] Berthold Hoffmann et Detlef Plump ? « Implementing term rewriting by jungle evaluation », RAIRO'91 : Theoretical Informatics and Applications David Hovemeyer et William Pugh ? « Finding bugs is easy », SIGPLAN Notices, pp.576-580, 1969.

A. Igarashi and C. Benjamin, Pierce ? « On inner classes, pp.56-89, 2002.

A. Igarashi, B. Pierce, P. Wadler, and ?. Featherweight-java, A minimal core calculus for java and gj », TOPLAS'99, ACM Transactions on Programming Languages and Systems, pp.132-146, 1999.

P. Simon and ?. Jones, Compiling haskell by program transformation : A report from the trenches, Proceedings of the European Symposium on Programming Des fondements de la virologie informatique vers une immunologie formelle Thèse de Doctorat d'Université, Institut National Polytechnique de LorraineKah87] Gilles Kahn ? « Natural semantics », STACS'87 : 4th Annual Symposium on Theoretical Aspects of Computer Sciences, pp.18-44, 1987.

E. Sonya, D. Keene, and . Gerson, Object-oriented programming in Common LISP : a programmer's guide to CLOS, Proceedings of the 15th European Conference on Object-Oriented Programming, pp.48-327, 1989.

C. Kirchner, H. Kirchner, and ?. Rewriting, solving , proving », A preliminary version of a book is available at www, p.123, 1999.

C. Kirchner, F. Kirchner, H. Kirchner, and ?. , Strategic computations and deductions », To appear in : Festschrift for Peter Andrews, p.16, 2008.

C. Kirchner, H. Kirchner, M. Vittek, and ?. , Implementing computational systems with constraints », CP'93 : Proceedings First Workshop on Principles and Practice of Constraint Programming, pp.166-175, 1993.

S. Abramsky, D. Gabbay, and T. Maibaum, Handbook of Logic in Computer Science, p.15, 1990.

H. Kirchner, P. Moreau, and ?. , Promoting rewriting to a programming language : A compiler for non-deterministic rewrite programs in associative-commutative theories », KM08] Radu Kopetz et Pierre-Etienne Moreau ? « Software quality improvement via pattern matching », FASE'08 : Proceedings of the 11th Conference on Fundamental Approaches to Software Engineering, pp.207-251, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00100926

K. Trygve, K. , E. Visser, and ?. , Strategic graph rewriting : Transforming and traversing terms with references Online publication, Proceedings of the 6th International Workshop on Reduction Strategies in Rewriting and Programming, p.110, 2006.

D. Lacey and ?. , Program transformation using temporal logic specifications, Thèse Rustan M. Leino ? « Specifying and verifying programs in spec# », Ershov Memorial Conference, pp.102-122, 2003.

T. Gary, C. Leavens, K. Ruby, M. Rustan, and . Leino, Erik Poll et Bart Jacobs ? « Jml (poster session) : notations and tools supporting detailed design in java, OOPSLA'00 : Addendum to the 2000 proceedings of the conference on Object-oriented programming, systems, languages, and applications (Addendum), pp.105-106, 2000.

J. Melton, A. Eisenberg, ?. Understanding, S. , and J. Together, A guide to SQLJ, JDBC, and related technologies, p.49, 2000.

J. Matthews, R. Bruce-findler, and ?. , Operational semantics for multi-language programs, POPL'07 : Proceedings of the 34th Symposium on Principles of Programming Languages [MHS05] Marjan Mernik Heering et Anthony M. Sloane ? « When and how to develop domain-specific languages, pp.3-10, 2005.

N. Martí-oliet, José Meseguer et Alberto Verdejo ? « Towards a strategy language for Maude », WRLA'04 : Proceedings of the Fifth International Workshop on Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, pp.417-441, 2005.

C. Marche and C. , Paulin-Mohring et X. Urbain ? « The krakatoa tool for certification of java/javacard programs annotated in jml, Journal of Logic and Algebraic Programming, pp.89-106, 2004.

P. Moreau, ql : Object-oriented queries made easy, 12th Conference on Compiler Construction Lecture Notes in Computer Science GTTSE'07 : Generative and Transformational Techniques in Software Engineering II, International Summer School, pp.61-76, 2003.

N. Nystrom, M. R. Clarkson, C. Andrew, ?. Myers, and . Polyglot, Quang-Huy Nguyen ? « Rewriting calculus and automation of proofs in proof assistants, 12th International Conference on Compiler Construction Thèse de Doctorat d'UniversitéNO98] Tobias Nipkow et David Von Oheimb ? « JavaLight is type-safe ? definitely », POPL'98 Proceedings of the 25th ACM Symposium on Principles of Programming Languages et Matthias Zenger ? « An Overview of the Scala Programming Language Odersky et P. Wadler ? « Pizza into Java : Translating theory into practice », POPL'97 : Proceedings of the 24th ACM Symposium on Principles of Programming Languages, pp.138-152, 1997.

. Pmd-]-«, Site officiel de l'outil pmd » ? http://pmd.sourceforge.net, p.143

A. Pnueli and ?. , The temporal logic of programs », FSCS'77 : 18th Engelhardt ? Data refinement : Modeloriented proof methods and their comparison, Cambridge Tracts in Theoretical Computer Science, Annual Symposium on Foundations of Computer Science IEEE, vol.87, issue.47, pp.46-57, 1977.

A. Reilles and ?. , Canonical Abstract Syntax Trees, WRLA'06 : Proceedings of the 6th International Workshop on Rewriting Logic and its Applications, pp.77-81, 2006.
DOI : 10.1016/j.entcs.2007.06.014
URL : https://hal.archives-ouvertes.fr/inria-00000967

A. Rensink and ?. Groove, A graph transformation tool set for the simulation and analysis of graph grammars Rozenberg (éd.) ? « Handbook of graph grammars and computing by graph transformation », ch. Algebraic Approach to Graph Transformation Part II : Single Pushout Approach and Comparison with Double Pushout Approach, RW02] A. Rudys et D. Wallach ? « Enforcing java run-time properties using bytecode rewriting Proceedings of the International Symposium on Software Security. Tokyo, Japan, Lecture Notes in Computer Science, pp.112-247, 1997.

[. Sheard, Zine el-abidine Benaissa et Emir Pasalic ? « Dsl implementation using staging and monads, PLAN '99 : Proceedings of the 2nd conference on Domain-specific languages, pp.81-94, 1999.

M. Schäfer, T. Ekman, ?. Oege-de-moor, E. Sound, . Renaming et al., Ehrig et M. Pfender ? « Graph-grammars -an algebraic approach, 08 : 23rd Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (G. Kiczales Proceedings of the Fourteenth Annual Symposium on Switching and Automata Theory Iowa Extensible pattern matching via a lightweight language extension », SIGPLAN Notices, pp.150-167, 1973.

]. F. Spo05, ?. Spoto, and . Julia, A generic static analyser for the java bytecode « Visual programming with graph rewriting systems, FTfJP'05 : Proc. of the 7th Workshop on Formal Techniques for Java-like Programs 11th IEEE Symp. on Visual Languages, pp.326-335, 1995.

G. Taentzer and ?. Agg, 99 : International Workshop and Symposium on Applications of Graph Transformation with Industrial Relevance 111 [Tah99] Walid Taha ? « Multi-stage programming : Its theory and applications, Thèse, Oregon Graduate Institute of Science and Technology, 1999. 6, 53 [VBT98] Eelco Visser, Zine-el-Abidine Benaissa et Andrew Tolmach ? « Building program optimizers with rewriting strategies », ICFP'98 : Proceedings of the 3rd ACM SIGPLAN International Conference on Functional Programming, pp.481-488, 1998.

M. Vittek and ?. Elan, Un cadre logique pour le prototypage de langages de programmation avec contraintes Université Henri Poincaré -Nancy I, Octobre 1994 Arnaud Payement et Oege de Moor ? « Scripting refactorings with jungl », OOPSLA'06 : Companion to the 21th ACM SIG- PLAN conference on Object-oriented programming languages, systems, and applications 145 [Wad87] Philip Wadler ? « Views : a way for pattern matching to cohabit with data abstraction, Joost Visser ? « Visitor combination and traversal control », OOPSLA'01 : Proceedings of the 16th ACM SIGPLAN conference on Object oriented programming Thèse de Doctorat d'Université POPL'87 : Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languagesWad90] Philip Wadler ? « Comprehending monads », LFP '90 : Proceedings of the 1990 ACM conference on LISP and functional programming, pp.270-282, 1987.

.. Graphes-de-stratégies-avec-le-combinateur-muvar, 97 (a) Avant µ-expansion : arbre représentant 97 (b) Après µ-expansion : graphe représentant BottomUp, p.97

S. Approche, .. De-transformation-de-graphes, .. Diagramme-du-pushout, and S. Dérivation, 106 (a), p.106

.. Inlining-de-la-stratégie-top-down and .. Stratégie-compilée, 154 (a) Stratégie composée d'origine, p.154

A. , C. D-'une-boucle-java, and .. , 161 (a), p.161