Abstract
Graph-like data structures and rule-based systems play an important role within many branches of computer science. Nevertheless, their symbiosis in the form of graph rewriting systems or graph grammars are not yet popular among software engineers. This is a consequence of the fact that graph grammar tools were not available until recently and of the lack of knowledge about how to use graph grammars for software development purposes. “Graph grammar engineering” is a first attempt to establish a new graph and rule centered methodology for the development of information system components. Having its roots in the late 80's it gradually evolved from a “paper and pencil” specification formalism to a tool-assisted specification and rapid prototyping approach.
Supported by: Deutsche Forschungs-Gemeinschaft
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
D. Blostein, H. Fahmy, A. Grbavec: Practical Use of GraphRewriting; in [GG95].
G. Booch: Object-Oriented Analysis and Design; Benjamin/Cummings, Redwood Cit, CA (1994).
M. Consens, I. Cruz, A. Mendelzon: Visualizing Queries and Querying Visualizations; ACM SIGMOD Record 21, no. 1 (1992), pp. 39–46.
G. Engels, C. Lewerentz, M. Nagl, W. Schäfer, A. Schürr: Building Integrated Software Development Environments Part I: Tool Specification; ACM Trans. on Software Engineering and Methodology 1, no. 2 (1992), pp. 135–167.
G. Engels, C. Lewerentz, W. Schäfer: Graph Grammar Engineering: A Software Specification Method; in [GG86], pp. 186–201.
V. Claus, H. Ehrig, G. Rozenberg (eds.): Proc. Int. Workshop on Graph Grammars and Their Application to Computer Science and Biology; LNCS 73, Springer-Verlag, Berlin (1978).
H. Ehrig, M. Nagl, G. Rozenberg (eds.): Proc. 2nd Int. Workshop on Graph Grammars and Their Application to Computer Science; LNCS 153, Springer-Verlag, Berlin (1982).
H. Ehrig, M. Nagl, G. Rozenberg, A. Rosenfeld (eds.): Proc. 3rd Int. Workshop on Graph Grammars and Their Application to Computer Science; LNCS 291, Springer-Verlag, Berlin (1986).
H. Ehrig, H.-J. Kreowski (eds.): Proc. 4th Int. Workshop on Graph Grammars and Their Application to Computer Science; LNCS 532, Springer-Verlag, Berlin (1990).
H. Ehrig, G. Engels, G. Rozenberg: Proc. 5th Int. Workshop on Graph Grammars and Their Application to Computer Science; Springer-Verlag, Berlin (to appear).
H. Göttler, J. Gönther, G. Nieskens: Use Graph Grammars to Design CAD-Systems; [GG90], pp. 396–410.
M. Hallmann: Prototyping of complex Software Systems; (in German) Teubner-Verlag, Stuttgart (1990).
M. Himsolt: GraphEd: An Interactive Graph Editor; STACS, LNCS 349, Springer-Verlag, Berlin (1990).
A. Kemper, G. Moerkotte: Access Support Relations: An Indexing Method for Object Bases; Information Systems 17-2, Pergamon Press (1992), pp. 117–145.
N. Kiesel, A. Schürr, B. Westfechtel: GRAS, a Graph-Oriented Database System for (Software) Engineering Applications; Proc. 6th Int. Workshop on Computer-Aided Software Engineering, IEEE Computer Science Press (1993), pp. 272–286.
M. Löwe, M. Beyer: An Implementation of Algebraic Graph Rewriting; Proc. 5th Int. Conf. on Rewriting Techniques and Applications, LNCS 690, Springer-Verlag, Berlin (1993), pp. 451–456.
M. Nagl, A. Schürr: A Specification Environment for Graph Grammars; [GG90], pp. 599–609.
F. Newbery: The Design of an Extendible Graph Editor; Dissertation, University of Karlsruhe, Germany, LNCS 704, Springer-Verlag, Berlin (1991).
J. Ousterhout: Tcl and the Tk Toolkit; Addison-Wesley, Reading, MA (1994).
J. Rumbaugh, M. Blaha, W. Premerlani, F. Eddy, W. Lorensen: Object-Oriented Modeling and Design; Prentice-Hall, Englewood Cliffs, NJ (1991).
A. Schürr: Operational Specification with Programmed Graph Rewriting Systems (in German), Deutscher Universitäts-Verlag, Wiesbaden (1991).
A. Schurr: PROGRESS: A VHL-Language Based on Graph Grammars; [GG90], pp. 641–659.
A. Zündorf: Implementation of the Imperative/Rule Based Language PROGRES; Technical Report AIB 92-38, RWTH Aachen, Germany (1992).
A. Zündorf: Graph Pattern Matching in PROGRES; [GG95].
A. Zündorf: A Development Environment for PROgrammed Graph REwriting Systems; (in German), Dissertation, RWTH Aachen, Germany (to appear 1995).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schürr, A., Winter, A.J., Zündorf, A. (1995). Graph grammar engineering with PROGRES. In: Schäfer, W., Botella, P. (eds) Software Engineering — ESEC '95. ESEC 1995. Lecture Notes in Computer Science, vol 989. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60406-5_17
Download citation
DOI: https://doi.org/10.1007/3-540-60406-5_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60406-8
Online ISBN: 978-3-540-45552-3
eBook Packages: Springer Book Archive