SEDec 3, 2020

Graph Repair and its Application to Meta-Modeling

arXiv:2012.01656v11 citations
AI Analysis

This work provides a method for automatically repairing model graphs to satisfy predefined constraints, which is significant for engineers working with model-driven development and the Eclipse Modeling Framework.

This paper introduces typed graph-repair programs that, when applied to any typed graph, transform it into a graph satisfying specific conditions. The authors apply these programs to Eclipse Modeling Framework (EMF) model graphs, generating repair programs for EMFk constraints, which are a first-order variant of EMF constraints.

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.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes