Graph Repair and its Application to Meta-Modeling
Christian Sandmann (Carl von Ossietzky University Oldenburg, Germany)
TL;DR
This paper introduces typed graph-repair programs for model-driven engineering, enabling the repair of EMF-model graphs to satisfy structural constraints, with applications to EMFk constraints and general typed graphs.
Contribution
It presents a novel approach to model repair using typed graph programs, specifically addressing EMF constraints and extending to general typed graphs.
Findings
Development of typed graph-repair programs for EMF constraints
Application of repair programs to EMFk constraints
Framework for repairing typed graphs to satisfy structural conditions
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.