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)”.
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
M. Beyer, AGG, An Algebraic Graph Grammar System, User Manual, Technical University of Berlin, Department of Computer Science, 1993.
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.
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.
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.
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.
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.
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.
H. Göttler, Graph grammars and diagram editing, In Ehrig et al. [ENRR87], pp. 216–231.
M. Himsolt, GraphEd: An interactive tool for developing graph grammars, In Ehrig et al. [EKR91], pp. 61–65.
A. Habel, H.-J. Kreowski, and D. Plump, Jungle evaluation, Fundamenta Informaticae XV (1991), no. 1, 37–60.
J.R. Kennaway, Implementing term rewrite languages in DACTL, Theoretical Computer Science 72 (1990), 37–58.
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.
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.
M. Löwe, Algebraic approach to single-pushout graph transformation, Theoretical Computer Science 109 (1993), 181–224.
M. Nagl, A software development environment based on graph technology, In Ehrig et al. [ENRR87], pp. 458–478.
F. Newbery Paulisch, The Design of an Extendible Graph Editor, Ph.D. thesis, University of Karlsruhe, Department of Informatics, March 1991.
S.L. Peyton Jones, The Implementation of Functional Programming Languages, Prentice Hall, 1987.
A. Schürr, Operationales Spezifizieren mit programmierten Graphersetzungssystemen, Deutscher Universitätsverlag GmbH, Wiesbaden, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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