Skip to main content
SpringerLink
Log in

Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations

  • Conference paper
  • First Online:
Graph Transformation (ICGT 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9151))

Included in the following conference series:

Abstract

Domain-specific modeling languages (DSMLs) are usually defined by meta-modeling where invariants are defined in the Object Constraint Language (OCL). This approach is purely declarative in the sense that instance construction is not incorporated but has to added. In contrast, graph grammars incorporate the stepwise construction of instances by applying transformation rules. Establishing a formal relation between meta-modeling and graph transformation opens up the possibility to integrate techniques of both fields. This integration can be advantageously used for optimizing DSML definition. Generally, a meta-model is translated to a type graph with a set of nested graph constraints. In this paper, we consider the translation of Essential OCL invariants to nested graph constraints. Building up on a translation of Core OCL invariants, we focus here on the translation of set operations. The main idea is to use the characteristic function of sets to translate set operations to corresponding Boolean operations. We show that a model satisfies an Essential OCL invariant iff its corresponding instance graph satisfies the corresponding nested graph constraint.

This work is partly supported by the German Research Foundation (DFG), Grants HA 2936/4-1 and TA 2941/3-1 (Meta modeling and graph grammars: integration of two paradigms for the definition of visual modeling languages).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    DSIG-formulas are meant to be DSIG-terms of sort BOOL.

  2. 2.

    A graph condition is injective if it is built by injective morphisms.

  3. 3.

    A pair of morphisms (a, b) is jointly surjective if, for each \(x\in C\), there is a preimage \(y\in P\) with \(a(y)=x\) or a preimage \(z\in C'\) with \(b(z)=x\).

  4. 4.

    Two graphs \(C_1\) and \(C_2\) are clan-disjoint if the clans of the types of \(C_1\) and \(C_2\) are disjoint. For graphs \(C_1\) and \(C_2\), \(C_1{+}C_2\) denotes the disjoint union.

References

  1. OMG: Object Constraint Language. http://www.omg.org/spec/OCL/

  2. Cabot, J., Clarisó, R., Riera, D.: UMLtoCSP: a tool for the formal verification of UML/OCL models using constraint programming. In: 22nd IEEE/ACM International Conference on Automated Software Engineering (ASE), pp. 547–548 (2007)

    Google Scholar 

  3. Ehrig, K., Küster, J.M., Taentzer, G.: Generating instance models from meta models. Softw. Syst. Model. 8(4), 479–500 (2009)

    Article  Google Scholar 

  4. Kehrer, T., Kelter, U., Taentzer, G.: Consistency-preserving edit scripts in model versioning. In: Denney, E., Bultan, T., Zeller, A. (eds.) 2013 28th IEEE/ACM International Conference on Automated Software Engineering, ASE 2013, Silicon Valley, CA, USA, 11–15 November 2013, pp. 191–201. IEEE (2013)

    Google Scholar 

  5. Bardohl, R., Minas, M., Schürr, A., Taentzer, G.: Application of Graph Transformation to Visual Languages. In: Handbook of Graph Grammars and Computing by Graph Transformation. Vol. 2, pp. 105–180. World Scientific (1999)

    Google Scholar 

  6. Kuhlmann, M., Gogolla, M.: From UML and OCL to relational logic and back. In: France, R.B., Kazmeier, J., Breu, R., Atkinson, C. (eds.) MODELS 2012. LNCS, vol. 7590, pp. 415–431. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  7. Jackson, D.: Alloy Analyzer website (2012). http://alloy.mit.edu/

  8. Arendt, T., Habel, A., Radke, H., Taentzer, G.: From core OCL invariants to nested graph constraints. In: Giese, H., König, B. (eds.) ICGT 2014. LNCS, vol. 8571, pp. 97–112. Springer, Heidelberg (2014)

    Google Scholar 

  9. Habel, A., Pennemann, K.H.: Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19, 245–296 (2009)

    Article  MathSciNet  Google Scholar 

  10. Bergmann, G.: Translating OCL to graph patterns. In: Dingel, J., Schulte, W., Ramos, I., Abrahão, S., Insfran, E. (eds.) MODELS 2014. LNCS, vol. 8767, pp. 670–686. Springer, Heidelberg (2014)

    Google Scholar 

  11. OMG: Meta Object Facility. http://www.omg.org/spec/MOF/

  12. Radke, H., Arendt, T., Becker, J.S., Habel, A., Taentzer, G.: Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations: Long version (2015). http://www.uni-marburg.de/fb12/forschung/berichte/berichteinformtk/pdfbi/bi2015-01.pdf

  13. Richters, M.: A Precise Approach to Validating UML Models and OCL Constraints. Ph.D. thesis, Universität Bremen, Logos Verlag, Berlin (2002)

    Google Scholar 

  14. Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamental theory of typed attributed graph transformation based on adhesive HLR categories. fundamenta Informaticae 74(1), 31–61 (2006)

    MathSciNet  Google Scholar 

  15. Orejas, F.: Symbolic graphs for attributed graph constraints. J. Symb. Comput. 46(3), 294–315 (2011)

    Article  MathSciNet  Google Scholar 

  16. Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. Monographs in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2006)

    Google Scholar 

  17. Rensink, A.: Representing first-order logic using graphs. In: Ehrig, H., Engels, G., Parisi-Presicce, F., Rozenberg, G. (eds.) ICGT 2004. LNCS, vol. 3256, pp. 319–335. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Habel, A., Pennemann, K.-H.: Nested constraints and application conditions for high-level structures. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol. 3393, pp. 293–308. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  19. Poskitt, C.M., Plump, D.: Hoare-style verification of graph programs. Fundamenta Informaticae 118(1–2), 135–175 (2012)

    MathSciNet  Google Scholar 

  20. Pennemann, K.H.: Development of Correct Graph Transformation Systems. Ph.D. thesis, Universität Oldenburg (2009)

    Google Scholar 

  21. Lambers, L., Orejas, F.: Tableau-based reasoning for graph properties. In: Giese, H., König, B. (eds.) ICGT 2014. LNCS, vol. 8571, pp. 17–32. Springer, Heidelberg (2014)

    Google Scholar 

  22. Richa, E., Borde, E., Pautet, L., Bordin, M., Ruiz, J.F.: Towards testing model transformation chains using precondition construction in algebraic graph transformation. In: AMT 2014-Analysis of Model Transformations Workshop Proceedings, pp. 34–43 (2014)

    Google Scholar 

  23. Arendt, T., Biermann, E., Jurack, S., Krause, C., Taentzer, G.: Henshin: advanced concepts and tools for in-place EMF model transformations. In: Petriu, D.C., Rouquette, N., Haugen, Ø. (eds.) MODELS 2010, Part I. LNCS, vol. 6394, pp. 121–135. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

Download references

Acknowledgement

We are grateful to the anonymous referees for their helpful comments on a draft version of this paper.

Author information

Authors and Affiliations

  1. Universität Oldenburg, Oldenburg, Germany

    Hendrik Radke, Jan Steffen Becker & Annegret Habel

  2. Philipps-Universität Marburg, Marburg, Germany

    Thorsten Arendt & Gabriele Taentzer

Authors
  1. Hendrik Radke
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thorsten Arendt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jan Steffen Becker
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Annegret Habel
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Gabriele Taentzer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hendrik Radke .

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Sapienza Università di Roma, Rome, Italy

    Francesco Parisi-Presicce

  2. Angewandte Informatik 1, Universität Bayreuth, Bayreuth, Germany

    Bernhard Westfechtel

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Radke, H., Arendt, T., Becker, J.S., Habel, A., Taentzer, G. (2015). Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations. In: Parisi-Presicce, F., Westfechtel, B. (eds) Graph Transformation. ICGT 2015. Lecture Notes in Computer Science(), vol 9151. Springer, Cham. https://doi.org/10.1007/978-3-319-21145-9_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21145-9_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21144-2

  • Online ISBN: 978-3-319-21145-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation