arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0508108cs.SEcs.PL
收藏

用约束推理证明或证伪似然不变量

Proving or Disproving likely Invariants with Constraint Reasoning

Tristan Denmat, Arnaud Gotlieb, Mireille Ducasse

摘要:

程序不变式是一种对程序的每次执行都有效的属性。最近的工作建议通过动态分析来推断可能唯一的不变量。可能不变式是一种对某些执行有效但不保证对所有执行有效的属性。在本文中,我们目前正在进行的工作,解决自动验证可能的不变量是实际的不变量的挑战性问题。我们提出了一个基于约束的推理方法,能够,不像其他方法,证明或反驳可能的不变量。在后一种情况下,我们的方法提供了反例。我们说明了一个激励的例子,自动生成的可能不变量进行验证的方法。

英文摘要:

A program invariant is a property that holds for every execution of the program. Recent work suggest to infer likely-only invariants, via dynamic analysis. A likely invariant is a property that holds for some executions but is not guaranteed to hold for all executions. In this paper, we present work in progress addressing the challenging problem of automatically verifying that likely invariants are actual invariants. We propose a constraint-based reasoning approach that is able, unlike other approaches, to both prove or disprove likely invariants. In the latter case, our approach provides counter-examples. We illustrate the approach on a motivating example where automatically generated likely invariants are verified.

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

↑