Rule-based graph repair

8Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Sandmann, C., & Habel, A. (2019). Rule-based graph repair. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 309, pp. 87–104). Open Publishing Association. https://doi.org/10.4204/EPTCS.309.5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free