@inproceedings{8257, abstract = {{Graphs as conceptual data models are accepted and used in a wide range of different problem areas. Giving some examples we outline common aspects for modeling complex structures by graphs. We present a formal frame-work based on graph grammars to specify graph classes and the corresponding graph manipulations. We show that such a specification can be written in a systematic, engineering-like manner. This is achieved by an extension of the known programmed, attributed graph grammars. Node-set operators are introduced to facilitate graph queries. Concepts like abstraction, decomposition, refinement, parameterization, and integration have been adopted from software engineering to yield a comprehensive specification method. This method has successfully been applied to specify the central data structures in a software development environment project}}, author = {{Engels, Gregor and Lewerentz, Claus and Schäfer, Wilhelm}}, booktitle = {{Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science, Warrenton, VA (USA)}}, pages = {{186--201}}, publisher = {{Springer}}, title = {{{Graph Grammar Engineering: A Software Specification Method}}}, doi = {{dx.doi.org/10.1007/3-540-18771-5}}, volume = {{291}}, year = {{1987}}, } @inproceedings{7815, author = {{Engels, Gregor and Lewerentz, Claus and Nagl, Manfred and Schäfer, Wilhelm}}, booktitle = {{Proceedings of the 19th Hawaii International Conference on System Sciences, Hawaii, USA}}, pages = {{585--597}}, title = {{{On the Structure of an Incremental and Integrated Software Development Environment}}}, volume = {{2a}}, year = {{1986}}, } @inproceedings{8256, author = {{Engels, Gregor and Sandbrink, Andrea}}, booktitle = {{Proceedings of the Workshop on Compiler Compilers and Incremental Compilation Techniques, Bautzen}}, pages = {{172--184}}, publisher = {{Berlin(Ost): Akademie der Wissenschaften der DDR}}, title = {{{Experiences with a Hybrid-Interpreter Based on Incremental Compilation Techniques}}}, volume = {{12}}, year = {{1986}}, } @phdthesis{7588, author = {{Engels, Gregor}}, title = {{{Graphen als zentrale Datenstrukturen in einer Software-Entwicklungsumgebung}}}, year = {{1986}}, } @inproceedings{7813, abstract = {{We introduce a method to specify the functional behaviour of software tools in an incremental and integrated software development environment. This specification method is based on graph grammars. It is an adequate method to specify the behaviour of all software systems using graphs as internal data structures. We show that a specification can be developed systematically by which the adaptability of the environment is increased towards modification of tools or extension by new tools. Furthermore, guidelines for the implementation can directly be derived from this specification.}}, author = {{Engels, Gregor and Schäfer, Wilhelm}}, booktitle = {{Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT 1985), Berlin (Germany)}}, pages = {{179--193}}, publisher = {{Springer}}, title = {{{Graph Grammar Engineering: A Method Used for the Development of an Integrated Programming Support Environment}}}, volume = {{186}}, year = {{1985}}, } @inproceedings{7814, author = {{Engels, Gregor and Schäfer, Wilhelm}}, booktitle = {{Proceedings of the International Computing Symposium, Amsterdam (The Netherlands)}}, title = {{{The Design of an Adaptive and Portable Programming Support Environment}}}, year = {{1985}}, } @inproceedings{8255, abstract = {{The following paper demonstrates that programmed sequential graph grammars can be used in a systematic proceeding to specify the changes of high level intermediate data structures arising in a programming support environment, in which all tools work in an incremental and syntax-driven mode. In this paper we lay stress upon the way to get the specification rather than on the result of this process. Therefore, we give here some approach to specification engineering using graph grammars. This approach is influenced by the syntactical definition of the underlying programming language or module concept etc. to be supported but also by the idea of the user interface.}}, author = {{Nagl, Manfred and Engels, Gregor and Gall, Rupert and Schäfer, Wilhelm}}, booktitle = {{Proceedings of the 2nd International Workshop on Graph-Grammars and Their Application to Computer Science, Osnabrück (Germany)}}, pages = {{267--287}}, publisher = {{Springer}}, title = {{{Software Specification by Graph Grammars}}}, doi = {{dx.doi.org/10.1007/BFb0000113}}, volume = {{153}}, year = {{1983}}, } @article{7411, abstract = {{The following paper,demonstrates that programmed sequential graph grammars can be used in a systematic proceeding to specify tbe changes of high level intermediate data structures arising in a programming support environment, in which all tools work in an incremental and syntax-driven mode. In this paper we lay stress upon the way to get the specification rather than on the result of this process. Therefore, we give here some approach to "specification engineering" using graph grammars. This approach is influenced by the syntactical definition of the underlying language for Programming in the Small, the module concept etc. to be supported on one side but also by the idea of the user interface.}}, author = {{Engels, Gregor and Gall, Rupert and Nagl, Manfred and Schäfer, Wilhelm}}, journal = {{Computing}}, number = {{4}}, pages = {{317--346}}, title = {{{Software Specification Using Graph Grammars}}}, doi = {{http://dx.doi.org/10.1007/BF02251236}}, volume = {{31}}, year = {{1983}}, } @article{7412, abstract = {{A new approach to an operational treatment of errors and exceptions in specifications of abstract data types is presented. Considering a specification as a term rewriting system, we define an operational semantics and give conditions that are sufficient for its well-definedness (Church-Rosser property). Also, we give conditions that are sufficient for the termination of reduction strategies, respecting the specified error and exception handling.}}, author = {{Engels, Gregor and Pletat, Udo and Ehrich, Hans-Dietrich}}, journal = {{Acta Informatica}}, number = {{3}}, pages = {{235--254}}, title = {{{An Operational Semantics for Specifications of Abstract Data Types with Error Handling}}}, doi = {{http://dx.doi.org/10.1007/BF00265557}}, volume = {{9}}, year = {{1983}}, } @inproceedings{7811, author = {{Engels, Gregor and Schäfer, Wilhelm}}, booktitle = {{Proceedings of the conference on Graphtheoretic Concepts in Computer Science (WG`82), München (Germany)}}, pages = {{47--62}}, publisher = {{Hanser}}, title = {{{Specification of a Programming Support Environment by Graph Grammars}}}, year = {{1982}}, } @inproceedings{7812, abstract = {{We suppose to give conditional specifications of abstract data types hierarchically. Considering algebraic specifications from an operational point of view this approach enables us to present simple syntactic criteria for the Church-Rosser property, which implies the welldefinedness of the operational semantics of a conditional specification. Furthermore, these criteria are su?cient for the termination of the full substitution reduction strategy.}}, author = {{Pletat, Udo and Engels, Gregor and Ehrich, Hans-Dietrich}}, booktitle = {{Proceedings of the 7eme Colloque sur les Arbres en Algebre et en Programmation, Lille (France)}}, pages = {{254--270}}, title = {{{An Operational Approach to Conditional Algebraic Specifications}}}, volume = {{82}}, year = {{1982}}, } @techreport{8184, author = {{Engels, Gregor and Pletat, Udo and Ehrich, Hans-Dietrich}}, publisher = {{University of Osnabrück}}, title = {{{Handling Errors and Exceptions in the Algebraic Specifications of Data Types}}}, year = {{1981}}, } @techreport{8185, author = {{Pletat, Udo and Engels, Gregor and Ehrich, Hans-Dietrich}}, publisher = {{University of Dortmund, Department of Computer Science}}, title = {{{Operational Semantics of Algebraic Specifications with Conditional Equations}}}, year = {{1981}}, }