Abstract
Shapely nested graph transformation is the computational model for DiaPlan, a language for programming with graphs that represent diagrams. It supports nested structuring of graphs, structural graph types (shapes), and graph variables. In this paper, we extend the model by two concepts that are essential for programming: abstraction allows compound transformations to be named and parameterized, and control allows the order of rule application to be specified. These concepts combine neatly with the underlying computational model, and preserve its rule-based and graph-ical nature.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
G. Busatto. An Abstract Model of Hierarchical Graphs and Hierarchical Graph Transformation. Dissertation, Universität Paderborn, June 2002.
F. Drewes, A. Habel, and H.-J. Kreowski. Hyperedge replacement graph grammars. In Rozenberg [20], chapter 2, pages 95–162.
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.
F. Drewes, B. Hoffmann, and D. Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, 64(2):249–283, 2002.
G. Engels, H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. II: Applications, Languages, and Tools. World Scientific, Singapore, 1999.
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.
C. Ermel, M. Rudolf, and G. Taentzer. The Agg approach: Language and environment. In Engels et al. [5], chapter 14, pages 551–603.
P. Fradet and D. Le Métayer. Structured Gamma. Science of Computer Programming, 31(2/3):263–289, 1998.
J. V. Guttag and J. J. Horning. The algebraic specification of abstract data types. Acta Informatica, 10:27–51, 1978.
A. Habel. Hyperedge Replacement: Grammars and Languages. Number 643 in Lecture Notes in Computer Science. Springer, 1992.
B. Hoffmann. From graph transformation to rule-based programming with diagrams. In M. Nagl, A. Schürr, and M. Münch, 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.
B. Hoffmann. Shapely hierarchical graph transformation. In Proc. IEEE Symposia on Human-Centric Computing Languages and Environments, pages 30–37. IEEE Computer Press, 2001.
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, Montréal, Quebeq, Canada, Sept. 2000.
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.
H.-J. Kreowski and S. Kuske. Graph transformation units and modules. In H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. II: Applications, Languages, and Tools. World Scientific, Singapore, 1999 Engels et al. [5], chapter 15, pages 607–638.
S. Kuske. Transformation Units-A Structuring Pronciple for Graph Transformation Systems. Dissertation, Universität Bremen, Fachbereich Mathematik u. Informatik, 2000.
M. Minas. Concepts and realization of a diagram editor generator based on hyper-graph transformation. Science of Computer Programming, 44(2):157–180, 2002.
D. Plump. Computing by Graph Rewriting. Habilitationsschrift, Universität Bremen, 1999.
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.
G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. I: Foundations. World Scientific, Singapore, 1997.
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.
A. Schürr, A. Winter, and A. Zündorf. The Progres approach: Language and environment. In H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. II: Applications, Languages, and Tools. World Scientific, Singapore, 1999 Engels et al. [5], chapter 13, pages 487–550.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoffmann, B. (2002). Abstraction and Control for Shapely Nested Graph Transformation. In: Corradini, A., Ehrig, H., Kreowski, H.J., Rozenberg, G. (eds) Graph Transformation. ICGT 2002. Lecture Notes in Computer Science, vol 2505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45832-8_15
Download citation
DOI: https://doi.org/10.1007/3-540-45832-8_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44310-0
Online ISBN: 978-3-540-45832-6
eBook Packages: Springer Book Archive