Change-Preserving Model Repair

Taentzer, Gabriele; Ohrndorf, Manuel; Lamo, Yngve; Rutle, Adrian

doi:10.1007/978-3-662-54494-5_16

Cited by 27 publications

(26 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Change-preserving model repair. Change-preserving model repair as presented in [22,25] is closely related to our approach. Assuming a set of consistencypreserving rules and a set of edit rules to be given, each edit rule is accompanied by one or more repair rules completing the edit step, if possible.…”

Section: Related Workmentioning

confidence: 99%

Efficient Model Synchronization by Automatically Constructed Repair Processes

Fritsche

Kosiol

Schürr

et al. 2019

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

Model synchronization, i.e., the task of restoring consistency between two interrelated models after a model change, is a challenging task. Triple Graph Grammars (TGGs) specify model consistency by means of rules. They can be used to automatically derive specifications of edit operations for single models and repair rules that propagate model changes to related models. model (re-)synchronization activities more effectively, a construction mechanism for shortcut rules has been recently developed. They describe consistency-preserving complex edit operations across model boundaries. We show that edit and repair rules can be derived from shortcut rules. As proof of concept, we implemented the construction and application of shortcut edit and repair rules in eMoflon. Our evaluation shows that shortcut rule based repair processes have considerably decreased data loss and improved runtime compared to former model synchronization processes in eMoflon.

show abstract

Section: Related Workmentioning

confidence: 99%

Efficient Model Synchronization by Automatically Constructed Repair Processes

Fritsche

Kosiol

Schürr

et al. 2019

Fundamental Approaches to Software Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…This state-based approach considers a subset of consistency constraints (up to nesting depth 2) handled by our approach, and is not complete, since it produces repairs including only a minimal amount of deletions. Some other recent rule-based graph repair approach [13,20] (also not covered by the survey) proposes so-called change preserving repairs (similar to what we define as delta-preserving). The main difference with our work is that we do not require the user to specify consistencypreserving operations from which repairs are generated, since we derive repairs using constraint solving techniques directly from the consistency constraints.…”

Section: Related Workmentioning

confidence: 99%

A Logic-Based Incremental Approach to Graph Repair

Schneider

Lambers

Orejas

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Graph repair, restoring consistency of a graph, plays a prominent role in several areas of computer science and beyond: For example, in model-driven engineering, the abstract syntax of models is usually encoded using graphs. Flexible edit operations temporarily create inconsistent graphs not representing a valid model, thus requiring graph repair. Similarly, in graph databases-managing the storage and manipulation of graph data-updates may cause that a given database does not satisfy some integrity constraints, requiring also graph repair. We present a logic-based incremental approach to graph repair, generating a sound and complete (upon termination) overview of leastchanging repairs. In our context, we formalize consistency by so-called graph conditions being equivalent to first-order logic on graphs. We present two kind of repair algorithms: State-based repair restores consistency independent of the graph update history, whereas delta-based (or incremental) repair takes this history explicitly into account. Technically, our algorithms rely on an existing model generation algorithm for graph conditions implemented in AutoGraph. Moreover, the delta-based approach uses the new concept of satisfaction (ST) trees for encoding if and how a graph satisfies a graph condition. We then demonstrate how to manipulate these STs incrementally with respect to a graph update.

show abstract

“…In Schneider et al 2019 [17], a logic-based incremental approach to graph repair is presented, generating a sound and complete (upon termination) overview of least changing repairs. The graph repair algorithm takes a graph and a first-order (FO) graph constraint as inputs and returns a set of graph repairs.…”

Section: Related Conceptsmentioning

confidence: 99%

“…the repair (programs) yield to a graph satisfying the condition. In Schneider et al [17] the delta-based repair algorithm takes the graph update history explicitly into account, i.e. the approach is dynamic.…”

Section: Related Conceptsmentioning

confidence: 99%

See 1 more Smart Citation

Rule-based Graph Repair

Sandmann¹,

Habel²

2019

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

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.

show abstract

Change-Preserving Model Repair

Cited by 27 publications

References 23 publications

Efficient Model Synchronization by Automatically Constructed Repair Processes

Efficient Model Synchronization by Automatically Constructed Repair Processes

A Logic-Based Incremental Approach to Graph Repair

Rule-based Graph Repair

Contact Info

Product

Resources

About