Skip to main content
SpringerLink
Log in
Book cover

International Conference on Graph Transformation

ICGT 2002: Graph Transformation pp 177–191Cite as

Abstraction and Control for Shapely Nested Graph Transformation

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2505))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Busatto. An Abstract Model of Hierarchical Graphs and Hierarchical Graph Transformation. Dissertation, Universität Paderborn, June 2002.

    Google Scholar 

  2. F. Drewes, A. Habel, and H.-J. Kreowski. Hyperedge replacement graph grammars. In Rozenberg [20], chapter 2, pages 95–162.

    Google Scholar 

  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.

    Google Scholar 

  4. F. Drewes, B. Hoffmann, and D. Plump. Hierarchical graph transformation. Journal of Computer and System Sciences, 64(2):249–283, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  5. 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.

    Google Scholar 

  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.

    Chapter  Google Scholar 

  7. C. Ermel, M. Rudolf, and G. Taentzer. The Agg approach: Language and environment. In Engels et al. [5], chapter 14, pages 551–603.

    Google Scholar 

  8. P. Fradet and D. Le Métayer. Structured Gamma. Science of Computer Programming, 31(2/3):263–289, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. V. Guttag and J. J. Horning. The algebraic specification of abstract data types. Acta Informatica, 10:27–51, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. Habel. Hyperedge Replacement: Grammars and Languages. Number 643 in Lecture Notes in Computer Science. Springer, 1992.

    MATH  Google Scholar 

  11. 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.

    Chapter  Google Scholar 

  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.

    Google Scholar 

  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, Montréal, Quebeq, Canada, Sept. 2000.

    Google Scholar 

  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.

    Google Scholar 

  15. 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.

    Google Scholar 

  16. S. Kuske. Transformation Units-A Structuring Pronciple for Graph Transformation Systems. Dissertation, Universität Bremen, Fachbereich Mathematik u. Informatik, 2000.

    Google Scholar 

  17. M. Minas. Concepts and realization of a diagram editor generator based on hyper-graph transformation. Science of Computer Programming, 44(2):157–180, 2002.

    Article  MATH  Google Scholar 

  18. D. Plump. Computing by Graph Rewriting. Habilitationsschrift, Universität Bremen, 1999.

    Google Scholar 

  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.

    Chapter  Google Scholar 

  20. G. Rozenberg, editor. Handbook of Graph Grammars and Computing by Graph Transformation, Vol. I: Foundations. World Scientific, Singapore, 1997.

    Google Scholar 

  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.

    Article  Google Scholar 

  22. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technologiezentrum Informatik, Universität Bremen, Postfach 330 440, D-28334, Bremen

    Berthold Hoffmann

Authors
  1. Berthold Hoffmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Corso Italia 40, 56125, Pisa, Italy

    Andrea Corradini

  2. Computer Science Department, Technical University of Berlin, Franklinstraße 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  3. Computer Science Department, University of Bremen, Bibliothekstraße 1, 28359, Bremen, Germany

    Hans -Jörg Kreowski

  4. Leiden Institute of Advanced Computer Science, Leiden University, Niels Bohrweg 1, 2333, CA Leiden, The Netherlands

    Grzegorz Rozenberg

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation