1. Oana Andrei, Maribel Fernández, Hélène Kirchner, Guy Melançon, Olivier Namet & Bruno Pinaud (2011): PORGY: Strategy-Driven Interactive Transformation of Graphs. In: Rachid Echahed: 6th Int. Work. on Computing with Terms and Graphs 48, pp. 54–68, doi:10.4204/EPTCS.48.7.
  2. Oana Andrei & Hélène Kirchner (2009): A Higher-Order Graph Calculus for Autonomic Computing. In: Graph Theory, Computational Intelligence and Thought. Golumbic Festschrift, Lecture Notes in Computer Science 5420. Springer, pp. 15–26, doi:10.1007/978-3-642-02029-2_2.
  3. David Auber, Daniel Archambault, Romain Bourqui, Antoine Lambert, Morgan Mathiaut, Patrick Mary, Maylis Delest, Jonathan Dubois & Guy Mélançon (2012): The Tulip 3 Framework: A Scalable Software Library for Information Visualization Applications Based on Relational Data. Technical Report RR-7860. Inria.
  4. Emilie Balland, Paul Brauner, Radu Kopetz, Pierre-Etienne Moreau & Antoine Reilles (2007): Tom: Piggybacking Rewriting on Java. In: Franz Baader: RTA, LNCS 4533. Springer, pp. 36–47, doi:10.1007/978-3-540-73449-9_5.
  5. H.P. Barendregt, M.C.J.D. van Eekelen, J.R.W. Glauert, J. R. Kennaway, M.J. Plasmeijer & M.R. Sleep (1987): Term graph rewriting. In: Proc. of PARLE, Parallel Architectures and Languages Europe, LNCS 259-II. Springer-Verlag, pp. 141–158, doi:10.1007/3-540-17945-3_8.
  6. Klaus Barthelmann (1996): How To Construct A Hyperedge Replacement System For A Context-Free Set Of Hypergraphs. Technical Report. Universität Mainz, Institut für Informatik.
  7. Peter Borovanský, Claude Kirchner, Hélène Kirchner, Pierre-Etienne Moreau & Christophe Ringeissen (1998): An overview of ELAN. EPTCS 15, pp. 55–70, doi:10.1016/S1571-0661(05)82552-6.
  8. Tony Bourdier, Horatiu Cirstea, Daniel J. Dougherty & Hélène Kirchner (2009): Extensional and Intensional Strategies. In: Proc. 9th Int. Work. on Reduction Strategies in Rewriting and Programming, pp. 1–19, doi:10.4204/EPTCS.15.1.
  9. Martin Bravenboer, Karl Trygve Kalleberg, Rob Vermaas & Eelco Visser (2008): Stratego/XT 0.17. A Language and Toolset for Program Transformation. Science of Computer Programming, Special issue on Experimental Systems and Tools, doi:10.1016/j.scico.2007.11.003.
  10. Andrea Corradini, Ugo Montanari, Francesca Rossi, Hartmut Ehrig, Reiko Heckel & Michael Löwe (1997): Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach. In: Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations. World Scientific, pp. 163–246, doi:10.1142/9789812384720_0003.
  11. Edsger W. Dijkstra (1982): Selected writings on computing — a personal perspective. Texts and monographs in computer science. Springer, doi:10.1007/978-1-4612-5695-3.
  12. Claudia Ermel, Michael Rudolf & Gabriele Taentzer (1997): The AGG Approach: Language and Environment. In: Hartmut Ehrig, Gregor Engels, Hans-Jörg Kreowski & Grzegorz Rozenberg: Handbook of Graph Grammars and Computing by Graph Transformations, Vol. 2: Applications, Languages, and Tools. World Scientific, pp. 551–603.
  13. Maribel Fernandez, Hélène Kirchner, Ian Mackie & Bruno Pinaud (2014): Visual Modelling of Complex Systems: Towards an Abstract Machine for PORGY. In: Lecture Notes in Computer Science 8493. Springer, pp. To appear. See also
  14. Maribel Fernández, Hélène Kirchner & Olivier Namet (2012): A Strategy Language for Graph Rewriting. In: Germán Vidal: Logic-Based Program Synthesis and Transformation, LNCS 7225. Springer, pp. 173–188, doi:10.1007/978-3-642-32211-2_12.
  15. Rubino Geiß, Gernot Veit Batz, Daniel Grund, Sebastian Hack & Adam Szalkowski (2006): GrGen: A Fast SPO-Based Graph Rewriting Tool. In: Proc. of ICGT, LNCS 4178. Springer, pp. 383–397, doi:10.1007/11841883_27.
  16. Annegret Habel, Jürgen Müller & Detlef Plump (2001): Double-pushout graph transformation revisited. Mathematical Structures in Computer Science 11(5), pp. 637–688, doi:10.1017/S0960129501003425.
  17. Annegret Habel & Detlef Plump (2001): Computational Completeness of Programming Languages Based on Graph Transformation. In: Foundations of Software Science and Computation Structures, 4th Int. Conference, FOSSACS 2001, Proc., LNCS 2030. Springer, pp. 230–245. Available at
  18. M. Hanus, H. Kuchen & J.J. Moreno-Navarro (1995): Curry: A Truly Functional Logic Language. In: Proc. ILPS'95 Work. on Visions for the Future of Logic Programming, pp. 95–107.
  19. Simon L. Peyton Jones (2003): Haskell 98 language and libraries: the revised report. Cambridge Univ. Press.
  20. Claude Kirchner, Florent Kirchner & Hélène Kirchner (2008): Strategic Computation and Deduction. In: Christoph Benzmüller, Chad E. Brown, Jörg Siekmann & Richard Statman: Reasoning in Simple Type Theory. Festchrift in Honour of Peter B. Andrews on His 70th Birthday, Studies in Logic and the Foundations of Mathematics 17. College Publications, pp. 339–364. Available at
  21. Yves Lafont (1990): Interaction Nets. In: Proc. of the 17th ACM Symposium on Principles of Programming Languages (POPL'90). ACM Press, pp. 95–108, doi:10.1145/96709.96718.
  22. Narciso Martí-Oliet, José Meseguer & Alberto Verdejo (2005): Towards a Strategy Language for Maude. EPTCS 117, pp. 417–441, doi:10.1016/j.entcs.2004.06.020.
  23. Ulrich Nickel, Jörg Niere & Albert Zündorf (2000): The FUJABA environment. In: ICSE, pp. 742–745, doi:10.1145/337180.337620.
  24. Bruno Pinaud, Guy Melançon & Jonathan Dubois (2012): PORGY: A Visual Graph Rewriting Environment for Complex Systems. Computer Graphics Forum 31(3), pp. 1265–1274, doi:10.1111/j.1467-8659.2012.03119.x.
  25. M. J. Plasmeijer & M. C. J. D. van Eekelen (1993): Functional Programming and Parallel Graph Rewriting. Addison-Wesley.
  26. Gordon D. Plotkin (2004): A structural approach to operational semantics. J. Log. Algebr. Program. 60-61, pp. 17–139, doi:10.1016/j.jlap.2004.03.009.
  27. Detlef Plump (1998): Term Graph Rewriting. In: Hartmut Ehrig, Gregor Engels, Hans-Jörg Kreowski & Grzegorz Rozenberg: Handbook of Graph Grammars and Computing by Graph Transformations, Vol. 2: Applications, Languages, and Tools. World Scientific, pp. 3–61.
  28. Detlef Plump (2009): The Graph Programming Language GP. In: Symeon Bozapalidis & George Rahonis: CAI, LNCS 5725. Springer, pp. 99–122, doi:10.1007/978-3-642-03564-7_6.
  29. Arend Rensink (2003): The GROOVE Simulator: A Tool for State Space Generation. In: AGTIVE, LNCS 3062. Springer, pp. 479–485, doi:10.1007/978-3-540-25959-6_40.
  30. Andy Schürr, Andreas J. Winter & Albert Zündorf (1997): The PROGRES Approach: Language and Environment.. In: Hartmut Ehrig, Gregor Engels, Hans-Jörg Kreowski & Grzegorz Rozenberg: Handbook of Graph Grammars and Computing by Graph Transformations, Vol. 2: Applications, Languages, and Tools. World Scientific, pp. 479–546, doi:10.1142/9789812384720_0007.
  31. J.R. Ullman (1976): An Algorithm for Subgraph Isomorphism. Journal of the ACM 23(1), pp. 31–42, doi:10.1145/321921.321925.
  32. Eelco Visser (2001): Stratego: A Language for Program Transformation Based on Rewriting Strategies System Description of Stratego 0.5. In: Aart Middeldorp: Rewriting Techniques and Applications, Lecture Notes in Computer Science 2051. Springer Berlin Heidelberg, pp. 357–361, doi:10.1007/3-540-45127-7_27.

Comments and questions to:
For website issues: