Ensuring Structural Constraints in Graph-Based Models with Type Inheritance

G. Taentzer, Arend Rensink

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

32 Citations (Scopus)
37 Downloads (Pure)

Abstract

Graphs are a common means to represent structures in models and meta-models of software systems. In this context, the description of model domains by classifying the domain entities and their relations using class diagrams or type graphs has emerged as a very valuable principle. The constraints that can be imposed by pure typing are, however, relatively weak; it is therefore common practice to enrich type information with structural properties (such as local invariants or multiplicity conditions) or inheritance. In this paper, we show how to formulate structural properties using graph constraints in type graphs with inheritance, and we show how to translate constrained type graphs with inheritance to equivalent constrained simple type graphs. From existing theory it then follows that graph constraints can be translated into preconditions for productions of a typed graph transformation system which ensures those graph constraints. This result can be regarded as a further important step of integrating graph transformation with object-orientation concepts.
Original languageUndefined
Title of host publicationFundamental Approaches to Software Engineering (FASE)
EditorsM. Cerioli
Place of PublicationBerlin
PublisherSpringer
Pages64-79
Number of pages15
ISBN (Print)3-540-25420-X
DOIs
Publication statusPublished - Apr 2005
Event8th International Conference on Fundamental Approaches to Software Engineering, FASE 2005 - Edinburgh, United Kingdom
Duration: 4 Apr 20058 Apr 2005
Conference number: 8

Publication series

NameLecture Notes in Computer Science
PublisherSpringer-Verlag
NumberXIII
Volume3442
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Conference on Fundamental Approaches to Software Engineering, FASE 2005
Abbreviated titleFASE
CountryUnited Kingdom
CityEdinburgh
Period4/04/058/04/05

Keywords

  • METIS-234013
  • EWI-1291
  • IR-64819

Cite this

Taentzer, G., & Rensink, A. (2005). Ensuring Structural Constraints in Graph-Based Models with Type Inheritance. In M. Cerioli (Ed.), Fundamental Approaches to Software Engineering (FASE) (pp. 64-79). (Lecture Notes in Computer Science; Vol. 3442, No. XIII). Berlin: Springer. https://doi.org/10.1007/978-3-540-31984-9_6, https://doi.org/10.1007/b107062
Taentzer, G. ; Rensink, Arend. / Ensuring Structural Constraints in Graph-Based Models with Type Inheritance. Fundamental Approaches to Software Engineering (FASE). editor / M. Cerioli. Berlin : Springer, 2005. pp. 64-79 (Lecture Notes in Computer Science; XIII).
@inproceedings{ab5b38a2a9194f5eb54a9c8ce55d3545,
title = "Ensuring Structural Constraints in Graph-Based Models with Type Inheritance",
abstract = "Graphs are a common means to represent structures in models and meta-models of software systems. In this context, the description of model domains by classifying the domain entities and their relations using class diagrams or type graphs has emerged as a very valuable principle. The constraints that can be imposed by pure typing are, however, relatively weak; it is therefore common practice to enrich type information with structural properties (such as local invariants or multiplicity conditions) or inheritance. In this paper, we show how to formulate structural properties using graph constraints in type graphs with inheritance, and we show how to translate constrained type graphs with inheritance to equivalent constrained simple type graphs. From existing theory it then follows that graph constraints can be translated into preconditions for productions of a typed graph transformation system which ensures those graph constraints. This result can be regarded as a further important step of integrating graph transformation with object-orientation concepts.",
keywords = "METIS-234013, EWI-1291, IR-64819",
author = "G. Taentzer and Arend Rensink",
note = "doi:10.1007/b107062",
year = "2005",
month = "4",
doi = "10.1007/978-3-540-31984-9_6",
language = "Undefined",
isbn = "3-540-25420-X",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
number = "XIII",
pages = "64--79",
editor = "M. Cerioli",
booktitle = "Fundamental Approaches to Software Engineering (FASE)",

}

Taentzer, G & Rensink, A 2005, Ensuring Structural Constraints in Graph-Based Models with Type Inheritance. in M Cerioli (ed.), Fundamental Approaches to Software Engineering (FASE). Lecture Notes in Computer Science, no. XIII, vol. 3442, Springer, Berlin, pp. 64-79, 8th International Conference on Fundamental Approaches to Software Engineering, FASE 2005, Edinburgh, United Kingdom, 4/04/05. https://doi.org/10.1007/978-3-540-31984-9_6, https://doi.org/10.1007/b107062

Ensuring Structural Constraints in Graph-Based Models with Type Inheritance. / Taentzer, G.; Rensink, Arend.

Fundamental Approaches to Software Engineering (FASE). ed. / M. Cerioli. Berlin : Springer, 2005. p. 64-79 (Lecture Notes in Computer Science; Vol. 3442, No. XIII).

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

TY - GEN

T1 - Ensuring Structural Constraints in Graph-Based Models with Type Inheritance

AU - Taentzer, G.

AU - Rensink, Arend

N1 - doi:10.1007/b107062

PY - 2005/4

Y1 - 2005/4

N2 - Graphs are a common means to represent structures in models and meta-models of software systems. In this context, the description of model domains by classifying the domain entities and their relations using class diagrams or type graphs has emerged as a very valuable principle. The constraints that can be imposed by pure typing are, however, relatively weak; it is therefore common practice to enrich type information with structural properties (such as local invariants or multiplicity conditions) or inheritance. In this paper, we show how to formulate structural properties using graph constraints in type graphs with inheritance, and we show how to translate constrained type graphs with inheritance to equivalent constrained simple type graphs. From existing theory it then follows that graph constraints can be translated into preconditions for productions of a typed graph transformation system which ensures those graph constraints. This result can be regarded as a further important step of integrating graph transformation with object-orientation concepts.

AB - Graphs are a common means to represent structures in models and meta-models of software systems. In this context, the description of model domains by classifying the domain entities and their relations using class diagrams or type graphs has emerged as a very valuable principle. The constraints that can be imposed by pure typing are, however, relatively weak; it is therefore common practice to enrich type information with structural properties (such as local invariants or multiplicity conditions) or inheritance. In this paper, we show how to formulate structural properties using graph constraints in type graphs with inheritance, and we show how to translate constrained type graphs with inheritance to equivalent constrained simple type graphs. From existing theory it then follows that graph constraints can be translated into preconditions for productions of a typed graph transformation system which ensures those graph constraints. This result can be regarded as a further important step of integrating graph transformation with object-orientation concepts.

KW - METIS-234013

KW - EWI-1291

KW - IR-64819

U2 - 10.1007/978-3-540-31984-9_6

DO - 10.1007/978-3-540-31984-9_6

M3 - Conference contribution

SN - 3-540-25420-X

T3 - Lecture Notes in Computer Science

SP - 64

EP - 79

BT - Fundamental Approaches to Software Engineering (FASE)

A2 - Cerioli, M.

PB - Springer

CY - Berlin

ER -

Taentzer G, Rensink A. Ensuring Structural Constraints in Graph-Based Models with Type Inheritance. In Cerioli M, editor, Fundamental Approaches to Software Engineering (FASE). Berlin: Springer. 2005. p. 64-79. (Lecture Notes in Computer Science; XIII). https://doi.org/10.1007/978-3-540-31984-9_6, https://doi.org/10.1007/b107062