Skip to main content

Agg — An implementation of algebraic graph rewriting

  • Conference paper
Rewriting Techniques and Applications (RTA 1993)

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

Included in the following conference series:

  • 223 Accesses

Abstract

The Agg-system (Algebraic Graph Grammar System) is a prototype implementation of the algebraic approach to graph transformation [Ehr79]. It has been programmed in EIFFEL and runs on SUN workstations under X Window 11.5. It consists of a flexible graphical editor and a derivation component. The editor allows the graphical manipulation of rules, redices and derivation results. The derivation component performs direct transformation steps for user-selected rules and redices.

This work has been partially supported by the German Ministry of Research and Technology (BMFT), project “KORSO (Korrekte Software)” and by the ESPRIT BRWG 3299 “COMPUGRAPH (Computing by Graph Transformation)”.

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

Access this chapter

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Beyer, AGG, An Algebraic Graph Grammar System, User Manual, Technical University of Berlin, Department of Computer Science, 1993.

    Google Scholar 

  2. T. Brus, M.C.J.D. van Eekelen, M. van Leer, and M.J. Plasmeijer, Clean — a language of functional graph rewriting, Proc. 3rd Int. Conf. on Functional Programming Languages and Computer Architecture (FPCA '87) Portland, Oregon, USA, Springer LNCS 274, 1987, pp. 364–384.

    Google Scholar 

  3. H. Ehrig, Introduction to the algebraic theory of graph grammars, 1st Int. Workshop on Graph Grammars and their Application to Computer Science and Biology, Lecture Notes in Computer Science 73, Springer, 1979, pp. 1–69.

    Google Scholar 

  4. H. Ehrig, H.-J. Kreowski, and G. Rozenberg (eds.), 4th Int. Workshop on Graph Grammars and Their Application to Computer Science, Lecture Notes in Computer Science 532, Springer, 1991.

    Google Scholar 

  5. H. Ehrig and M. Löwe, Computing by graph transformation — Final Report, Tech. Report 92/08, Technical University of Berlin, Department of Computer Science, 1992.

    Google Scholar 

  6. H. Ehrig, M. Nagl, G. Rozenberg, and A. Rosenfeld (eds.), 3rd Int. Workshop on Graph Grammars and Their Application to Computer Science, Lecture Notes in Computer Science 291, Springer, 1987.

    Google Scholar 

  7. J. Engelfriet and G. Rozenberg, Graph grammars based on node rewriting: An introduction to NLC graph grammars, In Ehrig et al. [EKR91], pp. 12–23.

    Google Scholar 

  8. H. Göttler, Graph grammars and diagram editing, In Ehrig et al. [ENRR87], pp. 216–231.

    Google Scholar 

  9. M. Himsolt, GraphEd: An interactive tool for developing graph grammars, In Ehrig et al. [EKR91], pp. 61–65.

    Google Scholar 

  10. A. Habel, H.-J. Kreowski, and D. Plump, Jungle evaluation, Fundamenta Informaticae XV (1991), no. 1, 37–60.

    Google Scholar 

  11. J.R. Kennaway, Implementing term rewrite languages in DACTL, Theoretical Computer Science 72 (1990), 37–58.

    Article  MathSciNet  Google Scholar 

  12. J. Lamping, An algorithm for optimal lambda calculus reduction, Conf. Rec. of the 17th Ann. ACM Symposium on Principles of Programming Languages, ACM Press, 1991, pp. 16–30.

    Google Scholar 

  13. M. Löwe and H. Ehrig, Algebraic approach to graph transformation based on single pushout derivations, Graph-Theoretic Concepts in Computer Science, WG '90 (R.H. Möhring, ed.), Springer LNCS 484, 1990, pp. 338–353.

    Google Scholar 

  14. M. Löwe, Algebraic approach to single-pushout graph transformation, Theoretical Computer Science 109 (1993), 181–224.

    Article  MATH  MathSciNet  Google Scholar 

  15. M. Nagl, A software development environment based on graph technology, In Ehrig et al. [ENRR87], pp. 458–478.

    Google Scholar 

  16. F. Newbery Paulisch, The Design of an Extendible Graph Editor, Ph.D. thesis, University of Karlsruhe, Department of Informatics, March 1991.

    Google Scholar 

  17. S.L. Peyton Jones, The Implementation of Functional Programming Languages, Prentice Hall, 1987.

    Google Scholar 

  18. A. Schürr, Operationales Spezifizieren mit programmierten Graphersetzungssystemen, Deutscher Universitätsverlag GmbH, Wiesbaden, 1991.

    Book  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Löwe, M., Beyer, M. (1993). Agg — An implementation of algebraic graph rewriting. In: Kirchner, C. (eds) Rewriting Techniques and Applications. RTA 1993. Lecture Notes in Computer Science, vol 690. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-21551-7_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-21551-7_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56868-1

  • Online ISBN: 978-3-662-21551-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics