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

基于k-归纳和不变量的循环C程序模型检验

Model Checking C Programs with Loops via k-Induction and Invariants

Herbert Rocha, Hussama Ismail, Lucas Cordeiro, Raimundo Barreto

摘要:

我们提出了一种新的证明归纳算法,它结合了k-归纳法和不变量模型检查C程序有界和无界循环。k-归纳算法由三种情况组成:在基本情况下,我们的目标是找到一个反例,最多有k个循环展开;在正向条件下,我们检查循环是否已经完全展开,以及安全属性P是否在k个展开内的所有状态下都成立;在归纳步骤中,我们检查每当P对k个展开成立时,它在系统的下一个展开后也成立。对于k-归纳算法的每一步,我们使用仿射约束来推断不变量(即,多面体)指定前置和后置条件。利用多面体的不变量和不变量两种不同的方法实现了该算法,并对结果进行了比较。实验结果表明,两种形式都能处理多种安全属性,而采用多面体的k-归纳算法解决了更多的验证任务,证明了归纳算法有效性的提高。

英文摘要:

We present a novel proof by induction algorithm, which combines k-induction with invariants to model check C programs with bounded and unbounded loops. The k-induction algorithm consists of three cases: in the base case, we aim to find a counterexample with up to k loop unwindings; in the forward condition, we check whether loops have been fully unrolled and that the safety property P holds in all states reachable within k unwindings; and in the inductive step, we check that whenever P holds for k unwindings, it also holds after the next unwinding of the system. For each step of the k-induction algorithm, we infer invariants using affine constraints (i.e., polyhedral) to specify pre- and post-conditions. The algorithm was implemented in two different ways, with and without invariants using polyhedral, and the results were compared. Experimental results show that both forms can handle a wide variety of safety properties; however, the k-induction algorithm adopting polyhedral solves more verification tasks, which demonstrate an improvement of the induction algorithm effectiveness.

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

↑