@inproceedings{8271,
  author       = {{de Bunje, Tineke and Engels, Gregor and Groenewegen, Luuk and Heus, Michael and Matsinger, Aart}},
  booktitle    = {{Proceedings of the Workshop on Software Process Technology (EWSPT 1996), Nancy (France)}},
  pages        = {{183--187}},
  publisher    = {{Springer}},
  title        = {{{Towards Measurable Process Models}}},
  doi          = {{http://dx.doi.org/10.1007/BFb0017743}},
  volume       = {{1149}},
  year         = {{1996}},
}

@inproceedings{8272,
  abstract     = {{The paper presents a conceptual framework for a module concept for graph transformation systems from a software engineering as well as from a theoretical point of view. The basic idea is to reuse concepts, which are known within or without the graph grammar field, to structure large specifications. These are the concept of distributed graph transformation systems, the concept of inheritance of specifications, and the import-export-interface concept. All these concepts are presented in a uniform framework based on the syntactical notion of a graph class specification and its semantics given by a graph transformation system. This is the basis for an explicit integration of these concepts and a corresponding specification language, to be discussed in a subsequent paper.}},
  author       = {{Ehrig, Hartmut and Engels, Gregor}},
  booktitle    = {{Selected papers from the 5th International Workshop on Graph Gramars and Their Application to Computer Science, Williamsburg, VA (USA)}},
  pages        = {{137--154}},
  publisher    = {{Springer}},
  title        = {{{Pragmatic and Semantic Aspects of a Module Concept for Graph Transformation Systems}}},
  volume       = {{1073}},
  year         = {{1996}},
}

@inproceedings{8273,
  author       = {{Engels, Gregor and Zamperoni, Andreas}},
  booktitle    = {{Proceedings of the Workshop on Requirements Engineering in a Changing World (satellite event of the Conference on Advanced Information Systems Engineering (CAISE 1996)), Crete (Greece)}},
  pages        = {{42--44}},
  title        = {{{Comprehensive Support for Change: Generic, Multi-dimensional (Software) Engineering Frameworks (position paper)}}},
  year         = {{1996}},
}

@inproceedings{8274,
  abstract     = {{By means of a special sofnvare process model component we have been successful in specifring somare process model evolution, This component also handles much reuse of software process model fragments. To handle the reuse of the software as it is being produced by a software process, another extra component can be added to the model for that software process. It is argued why this extra component is comparable to the special component for evolution.}},
  author       = {{Groenewegen, Luuk and Engels, Gregor}},
  booktitle    = {{Proceedings of the 10th International Software Process Workshop (ISPW 1996), Ventron (France)}},
  pages        = {{68}},
  publisher    = {{IEEE Computer Society}},
  title        = {{{Reuse of Software Process Fragments is Reuse of Software, too}}},
  year         = {{1996}},
}

@inproceedings{8275,
  abstract     = {{This extended abstract describes a mechanism to automatically incorporate safety requirements into operational specifications written in Z. For every individual operation the global (i.e. operation independent) safety invariants are transformed into a predicate which is used to extend the original precondiction of the operation. The operation constructed this way shows the same beavior as the original one whenever its post state satisfies the invariant. Otherwise it refuses to do anything. The construction of the precondition can be carried out automatically and a corresponding tool development is in progress.}},
  author       = {{Heckel, Reiko and Conrad, Mirko and Egger, Gottfried and Hiemer, Jörg}},
  booktitle    = {{Proceedings of the Workshop on Tools for System Development and Verifcation}},
  pages        = {{70--83}},
  publisher    = {{Shaker Verlag}},
  title        = {{{Automatic Integration of Safety Invariants into Z Specifications}}},
  volume       = {{1}},
  year         = {{1996}},
}

@article{7404,
  author       = {{Habel, Annegret and Heckel, Reiko and Taentzer, Gabriele}},
  journal      = {{Fundamenta Informaticae}},
  number       = {{3,4}},
  pages        = {{287--313}},
  title        = {{{Graph Grammars with Negative Application Conditions}}},
  volume       = {{26}},
  year         = {{1996}},
}

@article{7405,
  author       = {{Heckel, Reiko and Corradini, Andrea and Ehrig, Hartmut and Löwe, Michael}},
  journal      = {{Mathematical Structures in Computer Science}},
  number       = {{6}},
  pages        = {{613--648}},
  title        = {{{Horizontal and Vertical Structuring of Typed Graph Transformation Systems}}},
  volume       = {{6}},
  year         = {{1996}},
}

@article{7406,
  abstract     = {{We present the hybrid query language HQL/EER for an Extended Entity-Relationship model. As its main characteristic, this language allows a user to usebothgraphical and textual elements in the formulation of one and the same query. We demonstrate the look-and-feel of this query language by means of examples, and show how syntax and semantics of this language are formally defined using programmed graph rewriting systems. Although we present the language in the context of the EER model, the concept of hybrid languages is applicable in the context of other database models as well. We illustrate this claim by discussing a prototype implementation of a Hybrid Query Tool based on an object-oriented approach, namely the Object Modeling Technique (OMT).}},
  author       = {{Andries, Marc and Engels, Gregor}},
  journal      = {{Journal of Visual Languages and Computing}},
  number       = {{3}},
  pages        = {{321--352}},
  title        = {{{A Hybrid Query Language for the Extended Entity Relationship Model}}},
  doi          = {{http://dx.doi.org/10.1006/jvlc.1996.0017}},
  volume       = {{7}},
  year         = {{1996}},
}

@inbook{7514,
  author       = {{Engels, Gregor and Nagl, Manfred and Schäfer, Wilhelm and Westfechtel, Bernhard}},
  booktitle    = {{Building Tightly Integrated Software Development Environments: The IPSEN Approach}},
  pages        = {{170--177}},
  publisher    = {{Springer}},
  title        = {{{Tight Integration on One Document: The Programming Environment}}},
  volume       = {{1170}},
  year         = {{1996}},
}

@inproceedings{7831,
  abstract     = {{We present a combination of recent extensions to single-pushout graph transformations, as there are attribution, application conditions and amalgamated graph transformations and add a simple transaction concept on top of this formalism. Thereby, we provide the formal basis for several examples, where these concepts are used in combination.}},
  author       = {{Heckel, Reiko and Müller, Jürgen and Taentzer, Gabriele and Wagner, Annika}},
  booktitle    = {{Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science}},
  number       = {{B-19}},
  publisher    = {{Universitat de les Illes Balears}},
  title        = {{{Attributed Graph Transformations with Controlled Application of Rules}}},
  year         = {{1995}},
}

@inproceedings{7832,
  author       = {{Thoben, Wilfried and Appelrath, Hans-Jürgen and Sauer, Stefan}},
  booktitle    = {{Proceedings of the 18th Annual Conference of the Gesellschaft für Klassifikation, Oldenburg (Germany)}},
  pages        = {{412--419}},
  publisher    = {{Springer}},
  title        = {{{Record Linkage of Anonymous Data by Control Numbers}}},
  year         = {{1995}},
}

@inproceedings{7833,
  abstract     = {{Single pushout graph transformations at injective matches are extended by negative application conditions. It is shown, how right-sided application conditions can be transformed into equivalent left-sided ones. Based on this result, conditional derived rules are introduced and a theorem, similiar to the double pushout embedding theorem is shown. Finally, three variants of contextual application conditions are discussed with respect to their expressive power and expected results.}},
  author       = {{Heckel, Reiko}},
  booktitle    = {{Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science}},
  number       = {{B-19}},
  publisher    = {{Universitat de les Illes Balears}},
  title        = {{{Embedding of Conditional Graph Transformations}}},
  year         = {{1995}},
}

@techreport{8194,
  author       = {{Conrad, Mirko and Gajewsky, Magdalena and Holl-Biniasz, Rainer and Rudolf, Michael and Demuth, Jochen and Weber, Stephan and Heckel, Reiko and Müller, Jürgen and Taentzer, Gabriele and Wagner, Annika}},
  title        = {{{Graphische Spezifikation ausgewählter Teile von AGG - einem algebraischen Graphgrammatiksystem}}},
  year         = {{1995}},
}

@techreport{8195,
  abstract     = {{Several object-oriented modeling approaches propose to describe the dynamic behaviour of objects by state transition diagrams. None of them provides precise rules or conditions for the interrelation between the behaviour description of classes and those of their subclasses. In this paper, we discuss this interrelation in detail. It turns out that one has to distinguish between the observable and the invocable behaviour of objects and that different compatibility requirements between the diagrams exist depending on the type of behaviour.}},
  author       = {{Ebert, Jürgen and Engels, Gregor}},
  publisher    = {{University of Koblenz-Landau}},
  title        = {{{Specialization of Object Life Cycle Definitions}}},
  year         = {{1995}},
}

@techreport{8196,
  author       = {{Engels, Gregor and Schürr, Andy}},
  publisher    = {{Vakgroep Informatica, Rijksuniversiteit Leiden}},
  title        = {{{Encapsulated Hierarchical Graphs, Graph Types, and Meta Types}}},
  year         = {{1995}},
}

@inproceedings{8266,
  author       = {{Groenewegen, Luuk and Engels, Gregor}},
  booktitle    = {{Proceedings of the 4th European Workshop on Software Process Technology (EWSPT 1995), Noordwijkerhout (The Netherlands)}},
  pages        = {{189--192}},
  publisher    = {{Springer}},
  title        = {{{Coordination by Behavioural Views and Communication Patterns}}},
  doi          = {{http://dx.doi.org/10.1007/3-540-59205-9_56}},
  volume       = {{913}},
  year         = {{1995}},
}

@inproceedings{8267,
  abstract     = {{Based on a categorical semantics that has been developed for typed graph grammars we uses colimits (pushouts) to model composition and (reverse) graph grammar morphisms to describe refinements of typed graph grammars. Composition of graph grammars w.r.t. common subgrammars is shown to be compatible with the semantics, i.e. the semantics of the composed grammar is obtained as the composition of the semantics of the component grammars. Moreover, the structure of a composed grammar is preserved during a refinement step in the sense that compatible refinements of the components induce a refinement of the composition. The concepts and results are illustrated by an example.}},
  author       = {{Corradini, Andrea and Heckel, Reiko}},
  booktitle    = {{Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)}},
  pages        = {{46--55}},
  publisher    = {{Elsevier}},
  title        = {{{A Compositional Approach to Structuring and Refinement of Typed Graph Grammars}}},
  volume       = {{2}},
  year         = {{1995}},
}

@inproceedings{8268,
  abstract     = {{The overall aim of this paper is a proposal how to bridge the gap between formal specification techniques developed in research projects and semi--formal or informal specifications used in industrial practice. The main idea to overcome these problems is to develop graphical support for formal methods in order to increase acceptance by practitioners and to provide means for integration of formal and semi--formal methods. More specifically suitable concepts will be developed to combine algebraic specifications, Petri Nets, and Graph Grammars with each other and with distinguished graphical components to be used by industrial partners.}},
  author       = {{Bardohl, Bernhard and Bardohl, Roswitha and Castro, Paulo and Ehrig, Hartmut and Heckel, Reiko and Ribeiro, Leila and Nunes, Daltro and Martini, Alfio}},
  booktitle    = {{Proceedings of the 3rd German-Brazilian Workshop on Information Technology (1995), Berlin (Germany)}},
  publisher    = {{Forschungszentrum Jülich GmbH}},
  title        = {{{GRAPHIT: Graphical Support and Integration of Formal and Semiformal Methods for Software Specification and Development}}},
  volume       = {{26}},
  year         = {{1995}},
}

@inproceedings{8269,
  abstract     = {{Currently existing graph grammar-based specification languages have serious problems with supporting any kind of “specification-in-the-large” activities. More precisely, they have deficiencies with respect to modeling hierarchical data structures or specifying meta activities like manipulation of graph schemata. Furthermore, already proposed graph grammar module concepts are still too abstract to be useful in practice. Our contribution addresses these problems by introducing a new hierarchical graph data model with an infinite number of schema, meta-schema, etc. layers. It forms the base for a forthcoming concrete modular graph grammar specification language where in addition information hiding aspects like explicit export and import interfaces are expressible.}},
  author       = {{Engels, Gregor and Schürr, Andy}},
  booktitle    = {{Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)}},
  pages        = {{101--109}},
  publisher    = {{Elsevier}},
  title        = {{{Encapsulated Hierarchical Graphs, Graph Types, and Meta Types}}},
  doi          = {{http://dx.doi.org/10.1016/S1571-0661(05)80186-0}},
  year         = {{1995}},
}

@inproceedings{8270,
  author       = {{Heckel, Reiko and Wagner, Annika}},
  booktitle    = {{Proceedings of the Joint COMPUGRAPH/SEMAGRAPH Workshop on Graph Rewriting and Computation (SEGRAGRA 1995), Volterra (Italy)}},
  pages        = {{118--126}},
  publisher    = {{Elsevier}},
  title        = {{{Ensuring Consistency of Conditional Graph Grammars - A constructive Approach}}},
  doi          = {{http://dx.doi.org/10.1016/S1571-0661(05)80188-4}},
  volume       = {{2}},
  year         = {{1995}},
}