Graph Repair and its Application to Meta-Modeling

Abstract

Model repair is an essential topic in model-driven engineering. We present typed graph-repair programs for specific conditions; application to any typed graph yields a typed graph satisfying the condition. A model graph based on the Eclipse Modeling Framework (EMF), short EMF-model graph, is a typed graph satisfying some structural EMF-constraints. Application of the results to the EMF-world yields model-repair programs for EMFk constraints, a first-order variant of EMF constraints; application to any typed graph yields an EMFk model graph. From these results, we derive results for EMF model repair. * This work is partly supported by the German Research Foundation (DFG), Grants HA 2936/4-2 and TA 2941/3-2 (Meta-Modeling and Graph Grammars: Generating Development Environments for Modeling Languages).

Empowering model repair: A rule-based approach to graph repair without side effects -- Extended Version

“…There are several approaches to rule-based graph repair [25,6,8,26,9,10,11]. The approach closest to ours is that of Habel and Sandmann [8,9,10,11]: Similar to our approach, In [6], the authors formalize rule-based model repair on the basis of graphs and precisely characterize the type of constraints for which the repair algorithm terminates and results in consistent models. However, the type of constraints is quite limited and only includes the containment constraints for models in the Eclipse Modeling Framework (EMF) and multiplicity constraints.…”

“…Graph repair approaches usually have the advantage that they are formal and thus precisely defined. There are several approaches to graph repair for first-order graph constraints or certain subsets thereof that are correct, i.e., always return consistent graphs [5,6,7,8,9,10,11]. The used repair algorithms may be non-terminating if there are graph repairs for several constraints that influence each other.…”