arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1204.2386cs.LO
收藏

数组理论中的无量词插值

Quantifier-Free Interpolation of a Theory of Arrays

Roberto Bruttomesso, Silvio Ghilardi, Silvio Ranise

摘要:

在模型检验中使用插值正成为允许硬件和软件的快速和鲁棒验证的使能技术。然而,基于数组理论的编码的应用受到一般情况下不可能导出无量词插值的限制。在本文中,我们表明,它是可能的,以获得量化器自由插值的Skolemized版本的阵列的扩展理论。我们用两种方式证明这一点:(1)非建设性的,通过使用合并的模型理论概念,已知合并等价于允许通用理论的无量化器插值;以及(2)建设性的,通过设计插值过程,基于求解阵列更新之间的方程。(有趣的是,重写技术被用于求解器及其正确性证明的关键步骤。据我们所知,这是第一次成功的尝试计算量词自由插值的一个变体的理论阵列与扩张。

英文摘要:

The use of interpolants in model checking is becoming an enabling technology to allow fast and robust verification of hardware and software. The application of encodings based on the theory of arrays, however, is limited by the impossibility of deriving quantifier- free interpolants in general. In this paper, we show that it is possible to obtain quantifier-free interpolants for a Skolemized version of the extensional theory of arrays. We prove this in two ways: (1) non-constructively, by using the model theoretic notion of amalgamation, which is known to be equivalent to admit quantifier-free interpolation for universal theories; and (2) constructively, by designing an interpolating procedure, based on solving equations between array updates. (Interestingly, rewriting techniques are used in the key steps of the solver and its proof of correctness.) To the best of our knowledge, this is the first successful attempt of computing quantifier- free interpolants for a variant of the theory of arrays with extensionality.

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

↑