Abstraction and control for shapely nested graph transformation

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

Volumn 2505, Issue , 2002, Pages 177-191

  Hoffmann, Berthold ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTATION THEORY; COMPUTATIONAL METHODS;

COMPUTATIONAL MODEL; GRAPH VARIABLES; IT SUPPORTS; NESTED GRAPH TRANSFORMATION; PARAMETERIZED; RULE APPLICATION; RULE BASED; STRUCTURAL GRAPH;

GRAPH THEORY;

EID: 84937212815     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45832-8_15     Document Type: Conference Paper

References (22)

1. G. Busatto. An Abstract Model of Hierarchical Graphs and Hierarchical Graph Transformation. Dissertation, Universität Paderborn, June 2002.
2. F. Drewes, A. Habel, and H.-J. Kreowski. Hyperedge replacement graph grammars. In Rozenberg [20], chapter 2, pages 95–162.
3. F. Drewes, B. Hoffmann, and M. Minas. Constructing shapely nested graph transformations. In H.-J. Kreowski and P. Knirsch, editors, Proc. Int’l Workshop on Applied Graph Transformation (AGT’02), 2002. 107–118.
4. F. Drewes, B. Hoffmann, and D. Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, 64(2):249–283, 2002.
5. G. Engels, H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 2: Applications, Languages, and Tools. World Scientific, Singapore, 1999.
6. G. Engels and R. Heckel. Graph transformation as a conceptual and formal framework for system modelling and evolution. In U. Montanari, J. Rolim, and E. Welz, editors, Automata, Languages, and Programming (ICALP 2000 Proc.), number 1853 in Lecture Notes in Computer Science, pages 127–150. Springer, 2000.
7. C. Ermel, M. Rudolf, and G. Taentzer. The Agg approach: Language and environment. In Engels et al. [5], chapter 14, pages 551–603.
8. P. Fradet and D. Le Metayer. Structured Gamma. Science of Computer Programming, 31(2/3):263–289, 1998.
9. J. V. Guttag and J. J. Horning. The algebraic specification of abstract data types. Acta Informatica, 10:27–51, 1978.
10. A. Habel. Hyperedge Replacement: Grammars and Languages. Number 643 in Lecture Notes in Computer Science. Springer, 1992.
11. B. Hoffmann. From graph transformation to rule-based programming with diagrams. In M. Nagl, A. Schurr, and M. Munch, editors, Int’l Workshop on Applications of Graph Transformations with Industrial Relevance (Agtive’99), Selected Papers, number 1779 in Lecture Notes in Computer Science, pages 165–180. Springer, 2000.
12. B. Hoffmann. Shapely hierarchical graph transformation. In Proc. IEEE Symposia on Human-Centric Computing Languages and Environments, pages 30–37. IEEE Computer Press, 2001.
13. B. Hoffmann and M. Minas. Towards rule-based visual programming of generic visual systems. In N. Dershowitz and C. Kirchner, editors, Proc. Workshop on Rule-Based Languages, Montreal, Quebeq, Canada, Sept. 2000.
14. J. W. Klop. Term rewriting systems. In S. Abramsky, D. M. Gabbay, and T. Maibaum, editors, Handbook of Logic in Computer Science, volume 2, pages 1–116. Oxford University Press, 1992.
15. H.-J. Kreowski and S. Kuske. Graph transformation units and modules. In Ehrig et al. [5], chapter 15, pages 607–638.
16. S. Kuske. Transformation Units – A Structuring Pronciple for Graph Transformation Systems. Dissertation, Universit¨at Bremen, Fachbereich Mathematik u. Informatik, 2000.
17. M. Minas. Concepts and realization of a diagram editor generator based on hypergraph transformation. Science of Computer Programming, 44(2):157–180, 2002.
18. D. Plump. Computing by Graph Rewriting. Habilitationsschrift, Universit¨at Bremen, 1999.
19. D. Plump and A. Habel. Graph unification and matching. In J. E. Cuny, H. Ehrig, G. Engels, and G. Rozenberg, editors, Proc. Graph Grammars and Their Application to Computer Science, number 1073 in Lecture Notes in Computer Science, pages 75–89. Springer, 1996.
20. G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. 1: Foundations. World Scientific, Singapore, 1997.
21. M. Sagiv, T. Reps, and R. Wilhelm. Solving shape-analysis problems in languages with destructive updating. ACM Transactions on Programming Languages and Systems, 20(1):1–50, 1998.
22. A. Schurr, A. Winter, and A. Zundorf. The Progres approach: Language and environment. In Engels et al. [5], chapter 13, pages 487–550.