From tests to proofs

From tests to proofs
复制标题

从测试到证明

DOI:
10.1007/s10009-012-0267-5
复制
发表时间:
2013
影响因子:
1.5
通讯作者:
Andrey Rybalchenko
Andrey Rybalchenko
中科院分区:
计算机科学3区
文献类型:
--
作者:
Ashutosh Gupta;Rupak Majumdar;Andrey Rybalchenko

文献摘要

参考文献

被引文献

相似文献

我们描述了一个自动不变式生成器的设计和实现的命令式程序。虽然通过约束求解的自动不变式生成已经从理论观点作为程序验证的经典手段进行了广泛的研究,但在实践中,现有的工具甚至不能扩展到中等大小的程序。这是因为即使是小程序也需要解决的约束对于底层(非线性)约束求解引擎来说已经太难了。为了克服这一障碍,我们建议加强静态约束生成与静态抽象的解释和动态执行的程序中获得的信息。这种强化以额外的线性约束的形式出现,这些约束在求解器中触发一系列简化,并使求解更具可扩展性。我们证明了该方法的实际适用性的实验评估上的一组具有挑战性的基准程序和相关工具的抽象解释和软件模型检查的基础上进行比较。
We describe the design and implementation of an automatic invariant generator for imperative programs. While automatic invariant generation through constraint solving has been extensively studied from a theoretical viewpoint as a classical means of program verification, in practice existing tools do not scale even to moderately sized programs. This is because the constraints that need to be solved even for small programs are already too difficult for the underlying (non-linear) constraint solving engines. To overcome this obstacle, we propose to strengthen static constraint generation with information obtained from static abstract interpretation and dynamic execution of the program. The strengthening comes in the form of additional linear constraints that trigger a series of simplifications in the solver, and make solving more scalable. We demonstrate the practical applicability of the approach by an experimental evaluation on a collection of challenging benchmark programs and comparisons with related tools based on abstract interpretation and software model checking.
在线性关系分析中结合加宽和加速
DOI: 10.1007/11823230_10
发表时间: 2006
期刊: Journal of the ACM (JACM)
影响因子: --
作者:
L. Gonnord;N. Halbwachs
通讯作者: N. Halbwachs