## Graph Based Modeling and Implementation with EER/GRAL (1996)

Citations: | 21 - 11 self |

### BibTeX

@MISC{Ebert96graphbased,

author = {J. Ebert and A. Winter and P. Dahm and A. Franzke and R. Süttenbach},

title = {Graph Based Modeling and Implementation with EER/GRAL},

year = {1996}

}

### Years of Citing Articles

### OpenURL

### Abstract

This paper gives a cohesive approach to modeling and implementation with graphs. This approach uses extended entity relationship (EER) diagrams supplemented with the Z-like constraint language GRAL. Due to the foundation of EER/GRAL on Z a common formal basis exists. EER/GRAL descriptions give conceptual models which can be implemented in a seamless manner by efficient data structures using the GraLab graph library. Descriptions of four medium size EER/GRAL-applications conclude the paper to demonstrate the usefulness of the approach in practice.

### Citations

1684 | ObjectOriented Modelling and Design - Rumbaugh, Blaha, et al. - 1991 |

1349 | The entity-relationship model toward a unified view of data
- Chen
- 1976
(Show Context)
Citation Context ...n, { use of the GRAL extension of Z for specifying integrity constraints, and { the e cient implementation of graphs using GraLab. Formal semantics of ER-dialects have been de ned by several authors. =-=[Che76]-=- already sketches a formal semantics of the basic entity relationship approach. Other sources are [NP80] and [Lie80]. An overview to the main concepts to EER Modeling including global considerations c... |

1123 |
Graph Theory
- Harary
- 1995
(Show Context)
Citation Context ...r directed graphs, with or without multiple edges or loops. Sometimes graph elements are typed or attributed, sometimes they are not. Mathematical graph theory usually deals only with graph structure =-=[Har72]-=-, whereas computer science usually uses graphs where vertices are distinguishable [Meh84]. In applications, graphs are often used without a formal basis. This leads to problems when assertions about t... |

1104 |
The Z Notation: A reference manual
- Spivey
- 1992
(Show Context)
Citation Context ... needs undirected graphs without any type, attribute or ordering, the respective properties may also be ignored. 2.1 Formal De nition TGraphs as mathematical objects are speci ed using the Z-notation =-=[Spi92]-=-. The basic elements of TGraphs are vertices and edges. With respect to a vertex an edge may haveadirection, i.e. it may occur as an out-edge or as an in-edge. Graph elements may have a type and they ... |

118 |
Semantic Database Modeling: Survey
- Hull, King
- 1987
(Show Context)
Citation Context ...er sources are [NP80] and [Lie80]. An overview to the main concepts to EER Modeling including global considerations concerning derived schema components and (static) integrity constraints is given in =-=[HK87]-=-. [HG89] gives the semantics ofavery general EER-dialect, which even allows entities to be attribute values. [TCGB91] discuss semantics for generalizations and specializations. Older work on integrity... |

55 |
A platform for combinatorial and geometric computing
- LEDA
- 1999
(Show Context)
Citation Context ... some declarative description elements, though they are weaker than those described here. For the implementation of discrete structures as internal structures there exist e cient libraries like LEDA (=-=[MN96]-=-), though they are not directly adapted to such general graph types like TGraph e.g. directed an undirected graphs are stored di erently, vertices are not typed, and the attribute structure is uniform... |

54 | Graph grammar engineering with PROGRES
- Schurr, Winter, et al.
- 1995
(Show Context)
Citation Context ...uctive graph class descriptions are laid by [Cou96], who uses monadic second order logic. Graph classes for concrete applications can also be speci ed by graph grammars (see [EK95]). PROGRES [Sch91], =-=[SWZ95]-=- is a language for specifying graph replacement systems, which can be used for this purpose. PROGRES also includes ER diagrams for specifying simple schemata. Thus, it includes also some declarative d... |

30 |
Seamless Object-Oriented Software Architecture: Analysis and Design of Reliable Systems. The Object-Oriented Series
- Walden, Nerson
- 1994
(Show Context)
Citation Context ...is generated by KOGGE, is called a KOGGE tool. There are several KOGGE tools in use, including one for data ow diagrams (cf. section 3) and one for the object-oriented software development method BON =-=[NW95]-=-. The BON-KOGGE (BONSAI) [KU96] is used in Software Engineering education at University of Dortmund. A KOGGE tool consists of the two physical parts { a tool description and the KOGGE base system. The... |

21 | A Declarative Approach to Graph Based Modeling
- Ebert, Franzke
- 1995
(Show Context)
Citation Context ...2) in order to speci y graphs, which are e ciently implementable by an appropriate C++ library (GraLab, section 4). A very general class of graphs is used (TGraphs, section 2) as basis.sAs opposed to =-=[EF95]-=-, where the theoretical basis is explained, the aim of this paper is to give an introduction into the approach with emphasis on its practical applicability. Each of the applications sketched in sectio... |

19 |
Fundamentals of cardinality constraints, in
- Thalheim
- 1992
(Show Context)
Citation Context ...emantic" entity relationship approach (SERM) integrity constraints into modells as rules. Constraints in rst order logic are introduced by [Sud86] and [BT94]. Cardinality constraints are discusse=-=d by [Tha92]-=-. Theoretical foundations for constructive graph class descriptions are laid by [Cou96], who uses monadic second order logic. Graph classes for concrete applications can also be speci ed by graph gram... |

16 | B.: GRAS: a graphoriented software engineering database system
- Kiesel, Schürr, et al.
- 1995
(Show Context)
Citation Context ... e.g. directed an undirected graphs are stored di erently, vertices are not typed, and the attribute structure is uniform for all vertices. For storing graphs persistently as external structures GRAS =-=[KSW95]-=- or PCTE [LW93] may beused. But then again TGraphs are not directly supported. Furthermore external storage leads to a tradeo between the size of the graphs and the e ciency of graph traversals. 7 Con... |

12 |
A Versatile Data Structure For Edge-Oriented Graph Algorithms
- Ebert
- 1987
(Show Context)
Citation Context ...res, as well as the types and attributes assigned to vertices and edges. Inside GraLab TGraphs are represented as internal data structures by symmetrically stored forward and backward adjacency lists =-=[Ebe87]-=-. The structure can be accessed and manipulated via a simple interface which includes methods to { create and delete vertices and edges, { traverse graphs, { retrieve start and end vertices of edges, ... |

12 |
A calculus for an extended entity-relationship model incorporating arbitrary data operations and aggregate functions
- Hohenstein, Gogolla
- 1989
(Show Context)
Citation Context ...es are [NP80] and [Lie80]. An overview to the main concepts to EER Modeling including global considerations concerning derived schema components and (static) integrity constraints is given in [HK87]. =-=[HG89]-=- gives the semantics ofavery general EER-dialect, which even allows entities to be attribute values. [TCGB91] discuss semantics for generalizations and specializations. Older work on integrity constra... |

6 | An OMT Metamodel
- Ebert
- 1997
(Show Context)
Citation Context ...x of these languages by TGraph classes. Then, the EER/GRAL description of these classes permits an integration and comparison of di erent visual languages as well as a formal reasoning about them. In =-=[BES96]-=- an EER/GRAL formalization for OMT is given. This formalization is an OMT metamodel, since its instances are OMT models. There, the elements of OMT descriptions are modeled by three di erent graph cla... |

4 |
Entity-Relationship-Diagramme und Graphenklassen
- Carstensen, Ebert, et al.
- 1996
(Show Context)
Citation Context ...regular structures in a datadictionary. The re nement of ComplexProcesses by further DFItems is modeled using re nes-edges. PointOfContact-vertices are used as surrogates for data ows in a re nement. =-=[CEW96]-=- describes a complete formal semantics of EER diagrams in terms of the TGraph class which is speci ed by a given diagram. This is done by de ning an appropriate TGraph for the EER diagram itself. The ... |

4 | Anwendungslandschaft der Volksf ürsorge, Grobgranulares Konzeptschema und Anfragem öglichkeiten - Dahm, Fricke, et al. - 1998 |

4 |
Data structures and algorithms, volume 2. Graph algorithms and NP-completeness
- Mehlhorn
- 1984
(Show Context)
Citation Context ...typed or attributed, sometimes they are not. Mathematical graph theory usually deals only with graph structure [Har72], whereas computer science usually uses graphs where vertices are distinguishable =-=[Meh84]-=-. In applications, graphs are often used without a formal basis. This leads to problems when assertions about the models have tobeproved. Furthermore, graphs are frequently implemented using nongraph-... |

3 | Generic Support for Understanding Heterogeneous Software
- Ebert, Kamp, et al.
- 1996
(Show Context)
Citation Context ... of granularity about programs written in di erent languages. 3 The MOTOS project is a joint project of AED Sud, Meckenheim, Germany.sThe GUPRO approach (Generic Understanding of PROgrams) 4 [EGW96], =-=[EKW96]-=- to program understanding is based on repositories which contain program information in graph data structures. The graph data structures can be consulted by a programming language independent analyzin... |

3 |
A formal definition of entity-relationship models
- Ng, Paul
- 1980
(Show Context)
Citation Context ... of graphs using GraLab. Formal semantics of ER-dialects have been defined by several authors. [Che76] already sketches a formal semantics of the basic entity relationship approach. Other sources are =-=[NP80]-=- and [Lie80]. An overview to the main concepts to EER Modeling including global considerations concerning derived schema components and (static) integrity constraints is given in [HK87]. [HG89] gives ... |

2 |
Relative Constraints in ER Data Models
- Behm, Teorey
- 1994
(Show Context)
Citation Context ...ts was done by [TN83]. [Len85] includes in his \semantic" entity relationship approach (SERM) integrity constraints into modells as rules. Constraints in rst order logic are introduced by [Sud86]=-= and [BT94]-=-. Cardinality constraints are discussed by [Tha92]. Theoretical foundations for constructive graph class descriptions are laid by [Cou96], who uses monadic second order logic. Graph classes for concre... |

2 |
Das EMS-Graphenlabor 3.0
- Dahm, Ebert, et al.
- 1994
(Show Context)
Citation Context ...ntation All modeling concepts described upto here have to be implemented by concrete graph software, if seamlessness of the approach shall be achieved: The GraLab (GRAph LABoratory) software package (=-=[DEL94]-=-) makes a set of C++ classes available to implement TGraphs directly and exactly as speci ed by EER diagrams. It allows to transform graph class de nitions into vertex and edge types and into C++ clas... |

2 |
Wartungsunterstützung in heterogenen Sprachumgebungen, Ein Überblick zum Projekt GUPRO
- Ebert, Gimnich, et al.
- 1996
(Show Context)
Citation Context ...ed levels of granularity about programs written in di erent languages. 3 The MOTOS project is a joint project of AED Sud, Meckenheim, Germany.sThe GUPRO approach (Generic Understanding of PROgrams) 4 =-=[EGW96]-=-, [EKW96] to program understanding is based on repositories which contain program information in graph data structures. The graph data structures can be consulted by a programming language independent... |

2 |
The Standard for Open Repositories
- PCTE
- 1993
(Show Context)
Citation Context ...n undirected graphs are stored di erently, vertices are not typed, and the attribute structure is uniform for all vertices. For storing graphs persistently as external structures GRAS [KSW95] or PCTE =-=[LW93]-=- may beused. But then again TGraphs are not directly supported. Furthermore external storage leads to a tradeo between the size of the graphs and the e ciency of graph traversals. 7 Conclusion An over... |

1 |
Graph structure de nition using monadic second-order languages
- Courcelle
(Show Context)
Citation Context ...s. Constraints in rst order logic are introduced by [Sud86] and [BT94]. Cardinality constraints are discussed by [Tha92]. Theoretical foundations for constructive graph class descriptions are laid by =-=[Cou96]-=-, who uses monadic second order logic. Graph classes for concrete applications can also be speci ed by graph grammars (see [EK95]). PROGRES [Sch91], [SWZ95] is a language for specifying graph replacem... |

1 |
PDL: Eine Sprache zur Beschreibung grapherzeugender Parser
- Dahm
- 1995
(Show Context)
Citation Context ...ming language grammars, the user de ned EER diagramms and their dependencies. The generated parser uses the GraLab library for creating instances of the conceptual model in the graph based repository =-=[Dah95]-=-. The analyzing component for language independent program analysis is also triggered by the conceptual model. An important part of the analyzing component is the query component, which allows any que... |

1 |
Dokumentation fur den Daten u diagramm-Editor
- Druke
- 1996
(Show Context)
Citation Context ...a graph class DFD which gives the conceptual model of data ow diagrams, i.e. it contains the metamodel for a data ow language. The data ow metamodel is used to generate an editor for data ow diagrams =-=[Dru96]-=- with the KOGGE-Generator, described in section 5.2. name refines DFItem Object Data Process Elementary Process Complex Process Elementary Data Alternative Data Datastore Terminator Passive Datastore ... |

1 |
Ansatz und Architekur von KOGGE
- Ebert, Carstensen
- 1994
(Show Context)
Citation Context ...E system KOGGE (KOblenz Generator for Graphical Design Environments) 2 was developed to generate graphical editors for visual languages on the basis of EER/GRAL descriptions of their abstract syntax (=-=[EC94]-=-). A tool for a given language, which is generated by KOGGE, is called a KOGGE tool. There are several KOGGE tools in use, including one for data ow diagrams (cf. section 3) and one for the object-ori... |

1 |
Computing with Algebraic Graph Transformations -AnOverview of Recent Results. G. Valiente Feruglio and F. Rosello Llompart (eds
- Ehrig, Kor
- 1995
(Show Context)
Citation Context ...cal foundations for constructive graph class descriptions are laid by [Cou96], who uses monadic second order logic. Graph classes for concrete applications can also be speci ed by graph grammars (see =-=[EK95]-=-). PROGRES [Sch91], [SWZ95] is a language for specifying graph replacement systems, which can be used for this purpose. PROGRES also includes ER diagrams for specifying simple schemata. Thus, it inclu... |

1 |
GRAL : A Reference Manual. to appear as Fachbericht
- Franzke
- 1996
(Show Context)
Citation Context ...ropose to use the Z-like assertion language GRAL (GRAph speci cation Language), which allows to formulate further restrictions on the graph class speci ed by a diagram. GRAL is described in detail in =-=[Fra96a]-=-. GRAL assertions refer to the formal Z-de nition of TGraphs given in section 2. A GRAL assertion corresponding to an EER diagram D has the format for G in D assert pred1; :::; pred k Here, the predic... |

1 |
Querying Graph Structures with G 2
- Franzke
- 1996
(Show Context)
Citation Context ...to p { v pwdenotes the predicate that w is reachable from v along a path structured according to p The semantics of path expressions and their application to vertices is described formally using Z in =-=[Fra96b]-=-. Since GRAL is embedded in Z, GRAL assertions also have aZ-compatible semantics. Example: The graph class DFD de ned in g. 1 has further properties which are shown as a GRAL assertion in g. 2: for G ... |

1 |
Benutzerhandbuch fur die KOGGE-Tool BONsai, Version 2.0
- Kolzer, Uhe
- 1996
(Show Context)
Citation Context ...d a KOGGE tool. There are several KOGGE tools in use, including one for data ow diagrams (cf. section 3) and one for the object-oriented software development method BON [NW95]. The BON-KOGGE (BONSAI) =-=[KU96]-=- is used in Software Engineering education at University of Dortmund. A KOGGE tool consists of the two physical parts { a tool description and the KOGGE base system. The base system interprets the too... |

1 |
SERM: Semantic Entity-Relationship
- Lenzerini
- 1985
(Show Context)
Citation Context ...ery general EER-dialect, which even allows entities to be attribute values. [TCGB91] discuss semantics for generalizations and specializations. Older work on integrity constraints was done by [TN83]. =-=[Len85] incl-=-udes in his \semantic" entity relationship approach (SERM) integrity constraints into modells as rules. Constraints in rst order logic are introduced by [Sud86] and [BT94]. Cardinality constraint... |

1 |
On the Semantics of the Entity-Relationship Data
- Lien
- 1980
(Show Context)
Citation Context ... using GraLab. Formal semantics of ER-dialects have been de ned by several authors. [Che76] already sketches a formal semantics of the basic entity relationship approach. Other sources are [NP80] and =-=[Lie80]-=-. An overview to the main concepts to EER Modeling including global considerations concerning derived schema components and (static) integrity constraints is given in [HK87]. [HG89] gives the semantic... |

1 |
A formal de nition of entity-relationship models
- Ng, Paul
- 1988
(Show Context)
Citation Context ...n of graphs using GraLab. Formal semantics of ER-dialects have been de ned by several authors. [Che76] already sketches a formal semantics of the basic entity relationship approach. Other sources are =-=[NP80]-=- and [Lie80]. An overview to the main concepts to EER Modeling including global considerations concerning derived schema components and (static) integrity constraints is given in [HK87]. [HG89] gives ... |

1 |
Operationales Spezi zieren mit Graph Ersetzungssystemen, Formale De nitionen, Anwendungsbeispiele und Werkzeugunterstützung. Deutscher Universitaetsverlag
- Schürr
- 1991
(Show Context)
Citation Context ...or constructive graph class descriptions are laid by [Cou96], who uses monadic second order logic. Graph classes for concrete applications can also be speci ed by graph grammars (see [EK95]). PROGRES =-=[Sch91]-=-, [SWZ95] is a language for specifying graph replacement systems, which can be used for this purpose. PROGRES also includes ER diagrams for specifying simple schemata. Thus, it includes also some decl... |

1 |
Enforcement ofIntegrity Constraints in an Entity Relationship Data Model. Bericht 8607, Institut fur Informatik und Praktische Mathematik, Christian Albrechts Universitat
- Sudkamp
- 1986
(Show Context)
Citation Context ...ty constraints was done by [TN83]. [Len85] includes in his \semantic" entity relationship approach (SERM) integrity constraints into modells as rules. Constraints in rst order logic are introduce=-=d by [Sud86]-=- and [BT94]. Cardinality constraints are discussed by [Tha92]. Theoretical foundations for constructive graph class descriptions are laid by [Cou96], who uses monadic second order logic. Graph classes... |

1 |
A Proposal for Formalizing and Extending the Generalization and Subset Abstractions in the Enity-Relationship
- Tucherman, Casanova, et al.
- 1989
(Show Context)
Citation Context ... concerning derived schema components and (static) integrity constraints is given in [HK87]. [HG89] gives the semantics ofavery general EER-dialect, which even allows entities to be attribute values. =-=[TCGB91] disc-=-uss semantics for generalizations and specializations. Older work on integrity constraints was done by [TN83]. [Len85] includes in his \semantic" entity relationship approach (SERM) integrity con... |

1 |
The Occurrence Structure Concept: An Approach to Structural Integrity Constraints in the Entity-Relationship
- Tabourier, Nanci
- 1983
(Show Context)
Citation Context ...ics ofavery general EER-dialect, which even allows entities to be attribute values. [TCGB91] discuss semantics for generalizations and specializations. Older work on integrity constraints was done by =-=[TN83]. [Le-=-n85] includes in his \semantic" entity relationship approach (SERM) integrity constraints into modells as rules. Constraints in rst order logic are introduced by [Sud86] and [BT94]. Cardinality c... |

1 |
Graph structure definition using monadic second-order languages
- Courcelle
(Show Context)
Citation Context ... Constraints in first order logic are introduced by [Sud86] and [BT94]. Cardinality constraints are discussed by [Tha92]. Theoretical foundations for constructive graph class descriptions are laid by =-=[Cou96]-=-, who uses monadic second order logic. Graph classes for concrete applications can also be specified by graph grammars (see [EK95]). PROGRES [Sch91], [SWZ95] is a language for specifying graph replace... |

1 |
Das EMS-Graphenlabor 3.0. Projektbericht 3/94, Universitat Koblenz-Landau, Institut fur Softwaretechnik
- Dahm, Ebert, et al.
- 1994
(Show Context)
Citation Context ...ntation All modeling concepts described upto here have to be implemented by concrete graph software, if seamlessness of the approach shall be achieved: The GraLab (GRAph LABoratory) software package (=-=[DEL94]-=-) makes a set of C++ classes available to implement TGraphs directly and exactly as specified by EER diagrams. It allows to transform graph class definitions into vertex and edge types and into C++ cl... |

1 |
Dokumentation fur den Datenflu��diagramm-Editor. Koblenz: Universit at Koblenz-Landau, Institut fur Softwaretechnik, Studienarbeit
- Druke
- 1996
(Show Context)
Citation Context ...aph class DFD which gives the conceptual model of dataflow diagrams, i.e. it contains the metamodel for a dataflow language. The dataflow metamodel is used to generate an editor for dataflow diagrams =-=[Dru96]-=- with the KOGGE-Generator, described in section 5.2. Point Of Contact Elementary Process Complex Process Process Terminator Passive Datastore Datastore Object Dataflow hasAsSource hasAsSink correspond... |

1 |
Querying Graph Structures with G QL
- Franzke
- 1996
(Show Context)
Citation Context ...p -- v p w denotes the predicate that w is reachable from v along a path structured according to p The semantics of path expressions and their application to vertices is described formally using Z in =-=[Fra96b]-=-. Since GRAL is embedded in Z , GRAL assertions also have a Z-compatible semantics. Example: The graph class DFD defined in fig. 1 has further properties which are shown as a GRAL assertion in fig. 2:... |

1 |
Operationales Spezifizieren mit Graph Ersetzungssystemen, Formale Definitionen, Anwendungsbeispiele und Werkzeugunterstutzung. Deutscher Universitaetsverlag
- Schurr
- 1991
(Show Context)
Citation Context ...r constructive graph class descriptions are laid by [Cou96], who uses monadic second order logic. Graph classes for concrete applications can also be specified by graph grammars (see [EK95]). PROGRES =-=[Sch91]-=-, [SWZ95] is a language for specifying graph replacement systems, which can be used for this purpose. PROGRES also includes ER diagrams for specifying simple schemata. Thus, it includes also some decl... |

1 |
Enforcement of Integrity Constraints in an Entity Relationship Data Model. Bericht 8607, Institut fur Informatik und Praktische Mathematik, Christian Albrechts Universitat
- Sudkamp
- 1986
(Show Context)
Citation Context ... constraints was done by [TN83]. [Len85] includes in his "semantic" entity relationship approach (SERM) integrity constraints into modells as rules. Constraints in first order logic are intr=-=oduced by [Sud86]-=- and [BT94]. Cardinality constraints are discussed by [Tha92]. Theoretical foundations for constructive graph class descriptions are laid by [Cou96], who uses monadic second order logic. Graph classes... |