Rule-based Graph Repair

Christian Sandmann
Annegret Habel

Model repair is an essential topic in model-driven engineering. Since models are suitably formalized as graph-like structures, we consider the problem of rule-based graph repair: Given a rule set and a graph constraint, try to construct a graph program based on the given set of rules, such that the application to any graph yields a graph satisfying the graph constraint. We show the existence of repair programs for specific constraints, and show the existence of rule-based repair programs for specific constraints compatible with the rule set.

In Rachid Echahed and Detlef Plump: Proceedings Tenth International Workshop on Graph Computation Models (GCM 2019), Eindhoven, The Netherlands, 17th July 2019, Electronic Proceedings in Theoretical Computer Science 309, pp. 87–104.
Published: 20th December 2019.

ArXived at: bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to:
For website issues: