Ehrig, Hartmut; Parisi-Presicce, Francesco Algebraic specification grammars: A junction between module specifications and graph grammars. (English) Zbl 0765.68087 Graph grammars and their application to computer science, Proc. 4th Int. Workshop, Bremen/Ger. 1990, Lect. Notes Comput. Sci. 532, 292-310 (1991). Summary: [For the entire collection see Zbl 0753.00023.]Algebraic specification grammars have recently been introduced implicitly by the second author as a new kind of graph grammars in order to generate algebraic specifications using productions and derivations. In fact, in the well-known algebraic approach to graph grammars, also known as “Berlin-approach”, we mainly have to replace the category of graphs by the category of algebraic specifications to obtain the basic definitions, constructions and results for this new kind of grammars. Since a production in an algebraic specification grammars corresponds exactly to an interface of an algebraic module specification for modular software systems this new kind of grammars can be used for modular system design. For this purpose we give an overview how notions in the theory of grammars and that of module specifications correspond to each other and discuss how both theories can benefit from each other. Concerning full technical details and proofs we refer to other published of forthcoming papers. Cited in 3 Documents MSC: 68Q42 Grammars and rewriting systems 68Q60 Specification and verification (program logics, model checking, etc.) Keywords:Church-Rosser theorem; algebraic specification grammars; module specifications; match theorem; graph grammars; algebraic specifications; productions; derivations; modular system design Citations:Zbl 0753.00023 PDFBibTeX XMLCite \textit{H. Ehrig} and \textit{F. Parisi-Presicce}, Lect. Notes Comput. Sci. 532, 292--310 (1991; Zbl 0765.68087)