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.
The Unification Type of an Equational Theory May Depend on the Instantiation Preorder: From Results for Single Theories to Results for Classes of Theories
TU Dresden(德累斯顿工业大学);Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI) Dresden/Leipzig(德累斯顿/莱比锡可扩展数据分析与人工智能中心)
我们考虑的统一模的方程理论ACh的问题,其中包括一个功能符号$h$,这是同态的结合交换运营商$+$。由于统一模ACh理论是不可判定的,我们定义了一个变种的问题称为\textit{bounded ACh unification}。在ACh统一的这个有界版本中,我们本质上限制了$h$可以递归地应用于一个项的次数,并且只允许满足这个限制的解决方案。术语中$h$的出现次数没有限制,并且$+$符号可以应用无限次。我们给推理规则解决有界版本的问题,并证明规则是健全的,完整的,和终止。我们已经在Maude中实现了该算法,并给出了实验结果。我们认为,该算法是有用的密码协议分析。
Czech Academy of Sciences Institute of Computer Science(捷克科学院计算机科学研究所);Research Institute for Symbolic Computation(符号计算研究所);Johannes Kepler University(约翰内斯·开普勒大学)