arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2310.11136cs.LOcs.SE
收藏

吸收理论上的等式反合一

Equational Anti-Unification over Absorption Theories

Mauricio Ayala-Rincon, David M. Cerna, Andres Felipe Gonzalez Barragan, Temur Kutsia

AI总结:

本文提出一种基于规则的算法,解决纯吸收理论下的反合一问题,该问题为无穷的,但算法终止并给出最小完备解集的有限表示,且线性变体是有限的。

摘要:

由于软件分析及相关领域中的应用,对反合一(合一的对偶问题)的兴趣正在上升。例如,基于反合一的技术已在克隆检测和自动程序修复方法中得到应用。虽然句法形式的反合一对许多应用来说已经足够,但软件分析方法的某些方面更适合通过在等式理论下进行推理来建模。因此,扩展现有的反合一方法以处理重要的等式理论是自然的下一步。本文考虑了纯吸收理论模反合一,即某些算子与一个特殊常数相关联,满足公理 $f(x,\varepsilon_f) \approx f(\varepsilon_f,x) \approx \varepsilon_f$。我们为这类理论提供了一种健全且完备的基于规则的算法。此外,我们证明了模吸收的反合一是无穷的。尽管如此,我们的算法会终止,并产生最小完备解集的有限算法表示。我们还证明了线性变体是有限的。

英文摘要:

Interest in anti-unification, the dual problem of unification, is on the rise due to applications within the field of software analysis and related areas. For example, anti-unification-based techniques have found uses within clone detection and automatic program repair methods. While syntactic forms of anti-unification are enough for many applications, some aspects of software analysis methods are more appropriately modeled by reasoning modulo an equational theory. Thus, extending existing anti-unification methods to deal with important equational theories is the natural step forward. This paper considers anti-unification modulo pure absorption theories, i.e., some operators are associated with a special constant satisfying the axiom $f(x,\varepsilon_f) \approx f(\varepsilon_f,x) \approx \varepsilon_f$. We provide a sound and complete rule-based algorithm for such theories. Furthermore, we show that anti-unification modulo absorption is infinitary. Despite this, our algorithm terminates and produces a finitary algorithmic representation of the minimal complete set of solutions. We also show that the linear variant is finitary.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑