Graph Repair by Graph Programs

Habel, Annegret; Sandmann, Christian

doi:10.1007/978-3-030-04771-9_31

Cited by 11 publications

(9 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…nested graph conditions supported by specialized reasoning tools [LO14, SLO18], which have been shown to outperform generic solutions using off-the-shelf solvers [Pen08]. Reasoning facilities enable various possibilities for investigating model repair in our formal framework, see also [SLO19,HS18], and will therefore play an important role for future work.…”

Section: Comprehensive Systems For Consistency Managementmentioning

confidence: 99%

Comprehensive Systems: A formal foundation for Multi-Model Consistency Management

et al. 2021

View full text Add to dashboard Cite

Model management is a central activity in Software Engineering. The most challenging aspect of model management is to keep inter-related models consistent with each other while they evolve. As a consequence, there is a lot of scientific activity in this area, which has produced an extensive body of knowledge, methods, results and tools. The majority of these approaches, however, are limited to binary inter-model relations; i.e. the synchronisation of exactly two models. Yet, not every multi-ary relation can be factored into a family of binary relations. In this paper, we propose and investigate a novel comprehensive system construction, which is able to represent multi-ary relations among multiple models in an integrated manner and thus serves as a formal foundation for artefacts used in consistency management activities involving multiple models. The construction is based on the definition of partial commonalities among a set of models using the same language, which is used to denote the (local) models. The main theoretical results of this paper are proofs of the facts that comprehensive systems are an admissible environment for (i) applying formal means of consistency verification (diagrammatic predicate framework), (ii) performing algebraic graph transformation (weak adhesive HLR category), and (iii) that they generalise the underlying setting of graph diagrams and triple graph grammars.

show abstract

Section: Comprehensive Systems For Consistency Managementmentioning

confidence: 99%

Comprehensive Systems: A formal foundation for Multi-Model Consistency Management

et al. 2021

View full text Add to dashboard Cite

show abstract

“…For example, applying moveFeature can leave behind an empty class, thus violating c 2 . While constraint violations can potentially be removed using repair techniques [12,22,25], these can be computationally expensive and may involve strategies that lead to certain regions of the search space being preferred, threatening the efficiency of the search. Instead, it would be desirable to design mutation operators that impact consistency in a positive or at least neutral way.…”

Section: Examplementioning

confidence: 99%

“…In [12], Habel and Sandmann derive graph programs from graph constraints of nesting level ≤ 2. In [25], they extend their results to constraints in ANF which end with ∃C or constraints of one of the forms ∃(C, ¬∃C ) or ¬∃C.…”

Section: Related Workmentioning

confidence: 99%

“…For example, research in model repair has aimed to automatically produce graph-transformation rules that will gradually improve the consistency of a given graph. Such a rule may not make a graph completely consistent in one transformation step, but performing a sequence of such transformations will eventually produce a consistent graph (e.g., [12,21,22,25]). In the area of search-based model engineering (e.g., [5,9]), rules are required to be applicable to inconsistent graphs and, at least, not to produce new inconsistencies.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Graph Consistency as a Graduated Property

Kosiol

Strüber

Taentzer

et al. 2020

Graph Transformation

View full text Add to dashboard Cite

Where graphs are used for modelling and specifying systems, consistency is an important concern. To be a valid model of a system, the graph structure must satisfy a number of constraints. To date, consistency has primarily been viewed as a binary property: a graph either is or is not consistent with respect to a set of graph constraints. This has enabled the definition of notions such as constraint-preserving and constraint-guaranteeing graph transformations. Many practical applications-for example model repair or evolutionary search-implicitly assume a more graduated notion of consistency, but without an explicit formalisation only limited analysis of these applications is possible. In this paper, we introduce an explicit notion of consistency as a graduated property, depending on the number of constraint violations in a graph. We present two new characterisations of transformations (and transformation rules) enabling reasoning about the gradual introduction of consistency: while consistency-sustaining transformations do not decrease the consistency level, consistency-improving transformations strictly reduce the number of constraint violations. We show how these new definitions refine the existing concepts of constraint-preserving and constraint-guaranteeing transformations. To support a static analysis based on our characterisations, we present criteria for deciding which form of consistency ensuring transformations is induced by the application of a transformation rule. We illustrate our contributions in the context of an example from search-based model engineering.

show abstract

“…Some recent work on rule-based graph repair [9] (not covered by the survey) addresses the least-changing principle by developing so-called maximally preserving (items are preserved whenever possible) repair programs. 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.…”

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

Graph Repair by Graph Programs

Cited by 11 publications

References 10 publications

Comprehensive Systems: A formal foundation for Multi-Model Consistency Management

Comprehensive Systems: A formal foundation for Multi-Model Consistency Management

Graph Consistency as a Graduated Property

A Logic-Based Incremental Approach to Graph Repair

Contact Info

Product

Resources

About