[论文解读] Rule-based Graph Repair using Minimally Restricted Consistency-Improving Transformations

Alexander Lauer|arXiv (Cornell University)|Jul 18, 2023

Model-Driven Software Engineering TechniquesComputer Science被引用 3

一句话总结

本文提出了一种基于规则的图修复方法，采用限制最少的一致性改进变换，通过在特定嵌套层级上区分一致性维持与一致性提升规则的应用，实现对不一致模型的细粒度修复。主要贡献在于构建了一个框架，其应用条件更具针对性且更简单——尤其针对基础提升规则——从而能够高效、直接地修复循环无冲突约束及约束集合。

ABSTRACT

Model-driven software engineering is a suitable method for dealing with the ever-increasing complexity of software development processes. Graphs and graph transformations have proven useful for representing such models and changes to them. These models must satisfy certain sets of constraints. An example are the multiplicities of a class structure. During the development process, a change to a model may result in an inconsistent model that must at some point be repaired. This problem is called model repair. In particular, we will consider rule-based graph repair which is defined as follows: Given a graph $G$, a constraint $c$ such that $G$ does not satisfy $c$, and a set of rules $R$, use the rules of $\mathcal{R}$ to transform $G$ into a graph that satisfies $c$. Known notions of consistency have either viewed consistency as a binary property, either a graph is consistent w.r.t. a constraint $c$ or not, or only viewed the number of violations of the first graph of a constraint. In this thesis, we introduce new notions of consistency, which we call consistency-maintaining and consistency-increasing transformations and rules, respectively. This is based on the possibility that a constraint can be satisfied up to a certain nesting level. We present constructions for direct consistency-maintaining or direct consistency-increasing application conditions, respectively. Finally, we present an rule-based graph repair approach that is able to repair so-called \emph{circular conflict-free constraints}, and so-called circular conflict-free sets of constraints. Intuitively, a set of constraint $C$ is circular conflict free, if there is an ordering $c_1, \ldots, c_n$ of all constraints of $C$ such that there is no $j <i></i>

研究动机与目标

• 解决现有模型修复方法将一致性视为二元属性或仅考虑第一级违规的局限性。
• 引入一种细粒度的一致性概念，基于约束违规的嵌套层级评估模型修复。
• 在层级层面开发直接的一致性维持与一致性提升规则，防止变换过程中引入新违规。
• 构建通用规则与基础提升规则的应用条件，其复杂度与限制性低于先前方法。
• 通过结构化、分层的变换过程，实现对循环无冲突约束及约束集合的修复。

提出的方法

• 基于约束的首个不满足嵌套层级定义一致性维持与一致性提升变换。
• 引入“直接”变体，禁止引入任何新违规，从而提供更强的一致性保障。
• 提出两类应用条件：一类用于通用规则，另一类为“基础提升规则”的简化变体，仅需检查违规是否被移除。
• 使用推导规则，确保即使规则左部初始不包含所需约束层级，基础规则仍可应用。
• 将修复过程应用于循环无冲突约束，确保后续约束的修复不会在早期约束中引入违规。
• 通过重叠集（P_C'）与违规存在性及移除条件的组合，构建应用条件，以确保正确性与最小性。

实验结果

研究问题

• RQ1 如何在二元状态之外衡量一致性，以实现模型修复中的渐进式改进？
• RQ2 何种条件可确保规则应用在提升特定嵌套层级一致性的同时不引入新违规？
• RQ3 能否针对特定规则类型（如基础提升规则）简化应用条件，以降低复杂度与限制性？
• RQ4 在何种约束结构条件下，可保证基于规则的修复过程终止并维持一致性？
• RQ5 当约束相互依赖，特别是存在循环冲突时，如何协调多个约束的修复？

主要发现

• 所提出的分层一致性提升概念可通过聚焦首个不满足的嵌套层级，实现更细粒度的修复，从而检测到最小变更（如单条边或节点的插入/删除）。
• 基础提升规则的应用条件显著低于通用规则的复杂度与限制性，因其仅需验证至少一个违规被移除。
• 推导规则确保规则左部必须包含特定约束层级的要求，不会限制基础提升规则的适用性。
• 该框架成功实现了对循环无冲突约束及约束集合的修复，确保后续约束的修复不会在早期约束中引发违规。
• 一致性维持与一致性提升规则的应用条件已形式化构建并证明正确，未来可通过结合违规移除与无新违规插入的组件进一步优化。
• 该方法为扩展修复至所有可满足的嵌套约束（包括含布尔运算符的约束）奠定了基础，尽管此工作仍属未来研究范畴。