Advertisement

Graph Repair by Graph Programs

  • Annegret Habel
  • Christian Sandmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11176)

Abstract

Model repair is an essential topic in model-driven engineering. We consider the problem of graph repair: Given a graph constraint, we try to construct a graph program, such that the application to any graph yields a graph satisfying the graph constraint. We show the existence of terminating repair programs for a number of satisfiable constraints.

Notes

Acknowledgements

We are grateful to Berthold Hoffmann, Marius Hubatschek, Jens Kosiol, Nebras Nassar, Okan Özkan, Christoph Peuser, Detlef Plump, Gabriele Taentzer, and the anonymous reviewers for their helpful comments to this paper.

References

  1. [BET12]
    Biermann, E., Ermel, C., Taentzer, G.: Formal foundation of consistent EMF model transformations by algebraic graph transformation. Softw. Syst. Model. 11(2), 227–250 (2012)CrossRefGoogle Scholar
  2. [EEGH15]
    Ehrig, H., Ermel, C., Golas, U., Hermann, F.: Graph and Model Transformation - General Framework and Applications. Monographs in Theoretical Computer Science. Springer, Heidelberg (2015).  https://doi.org/10.1007/978-3-662-47980-3CrossRefzbMATHGoogle Scholar
  3. [EEPT06]
    Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. EATCS Monographs of Theoretical Computer Science. Springer, Heidelberg (2006).  https://doi.org/10.1007/3-540-31188-2CrossRefzbMATHGoogle Scholar
  4. [HP09]
    Habel, A., Pennemann, K.-H.: Correctness of high-level transformation systems relative to nested conditions. Math. Struct. Comput. Sci. 19, 245–296 (2009)MathSciNetCrossRefGoogle Scholar
  5. [HS18]
    Habel, A., Sandmann, C.: Graph repair by graph programs. In: Graph Computation Models (GCM 2018), Electronic Pre-Proceedings (2018). https://www.gcm2018.uni-bremen.de/assets/gcm_2018_paper_5.pdf
  6. [Löw93]
    Löwe, M.: Algebraic approach to single-pushout graph transformation. Theor. Comput. Sci. 109, 181–224 (1993)MathSciNetCrossRefGoogle Scholar
  7. [MGC13]
    Macedo, N., Guimarães, T., Cunha, A.: Model repair and transformation with echo. In: Automated Software Engineering (ASE 2013), pp. 694–697. IEEE (2013)Google Scholar
  8. [NEF03]
    Nentwich, C., Emmerich, W., Finkelstein, A.: Consistency management with repair actions. In: Software Engineering, pp. 455–464. IEEE Computer Society (2003)Google Scholar
  9. [NKR17]
    Nassar, N., Kosiol, J., Radke, H.: Rule-based repair of EMF models: formalization and correctness proof. In: Graph Computation Models (GCM 2017) (2017). https://www.uni-marburg.de/fb12/arbeitsgruppen/swt/forschung/publikationen/2017/NKR17.pdf
  10. [Pen09]
    Pennemann, K.-H.: Development of correct graph transformation systems. Ph.D. thesis, Universität Oldenburg (2009)Google Scholar
  11. [PP12]
    Poskitt, C.M., Plump, D.: Hoare-style verification of graph programs. Fundamenta Informaticae 118(1–2), 135–175 (2012)MathSciNetzbMATHGoogle Scholar
  12. [PP13]
    Poskitt, C.M., Plump, D.: Verifying total correctness of graph programs. Electron. Commun. EASST 61 (2013)Google Scholar
  13. [PSM15]
    Puissant, J.P., Van Der Straeten, R., Mens, T.: Resolving model inconsistencies using automated regression planning. Softw. Syst. Model. 14(1), 461–481 (2015)CrossRefGoogle Scholar
  14. [SLO18]
    Schneider, S., Lambers, L., Orejas, F.: Automated reasoning for attributed graph properties. Int. J. Softw. Tools Technol. Transf. 20, 705–737 (2018)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Universität OldenburgOldenburgGermany

Personalised recommendations