Graph transformation with variables

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3393 LNCS, Issue , 2005, Pages 101-115

  Hoffmann, Berthold ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GRAMMARS; LOGIC PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; SET THEORY;

GRAPH TRANSFORMATION; GRAPH VARIABLES; RULE-BASED SYSTEMS;

GRAPH THEORY;

EID: 33644905376     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-31847-7_6     Document Type: Article

References (32)

1. Volker Claus, Hartmut Ehrig, and Grzegorz Rozenberg, editors. Proc. Graph Grammars and Their Application to Computer Science and Biology, number 73 in Lecture Notes in Computer Science. Springer, 1979.
2. C.J. Cleaveland and R.C Uzgalis. Grammars for Programming Languages. Elsevier, New York, 1977.
3. Andrea Corradini, Hartmut Ehrig, Reiko Heckel, Michael Löwe, Ugo Montanari, and Francesca Rossi. Algebraic approaches to graph transformation, part I: Basic concepts and double pushout approach. In Grzegorz Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation. Vol. I: Foundations. World Scientific, 1997.
4. Andrea Corradini, Hartmut Ehrig, Hans-Jörg Kreowski, and Grzegorz Rozenberg, editors. 1st Int'l Conference on Graph Transformation (ICGT'02), number 2505 in Lecture Notes in Computer Science. Springer, 2002.
5. Frank Drewes, Annegret Habel, and Hans-Jörg Kreowski. Hyperedge replacement graph grammars. In Rozenberg [27], chapter 2, pages 95-162.
6. Frank Drewes, Berthold Hoffmann, and Mark Minas. Constructing shapely nested graph transformations. In Hans-Jörg Kreowski and Peter Knirsch, editors, Proc. Int'l Workshop on Applied Graph Transformation (AGT'02), 2002. 107-118.
7. Hartmut Ehrig. Introduction to the algebraic theory of graph grammars. In Claus et al. [1], pages 1-69.
8. Hartmut Ehrig, Gregor Engels, Francesco Parisi-Presicce, and Grzegorz Rozenberg, editors. 2nd Int'l Conference on Graph Transformation (ICGT'04), number 3256 in Lecture Notes in Computer Science. Springer, 2004.
9. Hartmut Ehrig, Berthold Hoffmann, and Ilse-Renate Schmiedecke. A Graph-Theoretical Model for Multi-Pass Parsing. In J.R. Mühlbacher, editor, Proc. 7th Conf. on Graph-Theoretical Concepts in Comp. Sci. (WG'81), pages 19-32, München-Wien, 1982. Hanser Verlag.
10. Joost Engelfriet and Grzegorz Rozenberg. Node replacement graph grammars. In Rozenberg [27], chapter 1, pages 1-94.
11. Herbert Göttler. Zweistufige Graphmanipulationssysteme für die Semantik von Programmiersprachen. Dissertation, Universität Erlangen-Nürnberg, 1977. [In German].
12. Annegret Habel, Reiko Heckel, and Gabriele Taentzer. Graph grammars with negative application conditions. Fundamenta Informaticae, 26:287-313, 1996.
13. Annegret Habel and Berthold Hoffmann. Parallel independence in hierarchical graph transformation. In Ehrig et al. [8], pages 178-193.
14. Annegret Habel, Jürgen Müller, and Detlef Plump. Double-pushout graph transformation revisited. Mathematical Structures in Computer Science, 11(5):637-688, 2001.
15. Annegret Habel and Detlef Plump. Relabelling in graph transformation. In Corradini et al. [4], pages 135-147.
16. Reiko Heckel, Jochen M. Küster, and Gabriele Taentzer. Confluence of typed attributed graph transformation systems. In Corradini et al. [4], pages 161-176.
17. Wolfgang Hesse. Two-level graph grammars. In Claus et al. [1], pages 255-269.
18. Berthold Hoffmann. Shapely hierarchical graph transformation. In Proc. IEEE Symposia on Human-Centric Computing Languages and Environments, pages 30-37. IEEE Computer Press, 2001.
19. Jan Willem Klop. Term rewriting systems. In S. Abramsky, Dov M. Gabbay, and T.S.E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1-116. Oxford University Press, 1992.
20. Hans-Jörg Kreowski and Grzegorz Rozenberg. On structured graph grammars, I and II. Information Sciences, 52:185-210 and 221-246, 1990.
21. Michael Löwe, Martin Korff, and Annika Wagner. An algebraic framework for the transformation of attributed graphs. In Sleep et al. [31], pages 185-199.
22. Tom Mens, Serge Demeyer, and Dirk Janssens. Formalising behaviour-preserving transformation. In Corradini et al. [4], pages 286-301.
23. M. Nagl. Graph-Grammatiken: Theorie, Anwendungen, Implementierungen. Vieweg-Verlag, Braunschweig, 1979. In German.
24. Detlef Plump. Hypergraph rewriting: Critical pairs and undecidability of confluence. In Sleep et al. [31], pages 201-213.
25. Detlef Plump and Annegret Habel. Graph unification and matching. In Janice E. Cuny, Hartmut Ehrig, Gregor Engels, and Grzegorz Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science, number 1073 in Lecture Notes in Computer Science, pages 75-89. Springer, 1996.
26. Detlef Plump and Sandra Steinert. Towards graph programs for graph algorithms. In Ehrig et al. [8], pages 128-143.
27. Grzegorz Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. I: Foundations. World Scientific, Singapore, 1997.
28. Georg Schied. Über Graphgrammatiken, eine Spezifikationsmethode für Programmiersprachen und verteilte Regelsysteme. Dissertation, Universität ErlangenNürnberg, 1992. [In German].
29. Hans-Jürgen Schneider. On categorical graph grammars integrating structural transformations and operations on labels. Theoretical Computer Science, 109:257-274, 1993.
30. Andy Schurr. Programmed graph replacement systems. In Rozenberg [27], chapter 7, pages 479-546.
31. M. Ronan Sleep, Rinus Plasmeijer, and Marko van Eekelen, editors. Term Graph Rewriting, Theory and Practice. Wiley & Sons, Chichester, 1993.
32. Niels van Eetvelde and Dirk Janssens. Extending graph rewriting for refactoring. In Ehrig et al. [8], pages 399-415.