Rule-based Graph Repair
This work addresses model repair in model-driven engineering, focusing on graph-based formalizations, but appears incremental as it builds on existing rule-based methods.
The paper tackles the problem of constructing rule-based graph repair programs to ensure graphs satisfy given constraints, demonstrating the existence of such programs for specific constraints.
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.