From Core OCL Invariants to Nested Graph Constraints

  • Thorsten Arendt
  • Annegret Habel
  • Hendrik Radke
  • Gabriele Taentzer
Conference paper

DOI: 10.1007/978-3-319-09108-2_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8571)
Cite this paper as:
Arendt T., Habel A., Radke H., Taentzer G. (2014) From Core OCL Invariants to Nested Graph Constraints. In: Giese H., König B. (eds) Graph Transformation. ICGT 2014. Lecture Notes in Computer Science, vol 8571. Springer, Cham

Abstract

Meta-modeling including the use of the Object Constraint Language (OCL) forms a well-established approach to design domain-specific modeling languages. This approach is purely declarative in the sense that instance construction is not needed and not considered. In contrast, graph grammars allow the stepwise construction of instances by the application of transformation rules. In this paper, we consider meta-models with Core OCL invariants and translate them to nested graph constraints for typed attributed graphs. Models and meta-models are translated to instance and type graphs. We show that a model satisfies a Core OCL invariant iff its corresponding instance graph satisfies the corresponding nested graph constraint. The aim of this work is to establish a first formal relation between meta-modeling and the theory of graph transformation including constraints to come up with an integrated approach for defining modeling languages in an optimal way in the future.

Keywords

Meta modeling OCL graph constraints application conditions 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Thorsten Arendt
    • 1
  • Annegret Habel
    • 2
  • Hendrik Radke
    • 2
  • Gabriele Taentzer
    • 1
  1. 1.Philipps-Universität MarburgGermany
  2. 2.Universität OldenburgGermany

Personalised recommendations