超越k-归纳:从反例中学习双向探索状态空间
Beyond k-induction: Learning from Counterexamples to Bidirectionally Explore the State Space
摘要:
我们描述和评估了一种新的k-归纳证明规则,称为双向k-归纳(bkind),这大大提高了k-归纳缺陷发现能力。特别地,bkind利用由过近似步骤产生的反例来导出新的属性,并将它们反馈到有界模型检验过程。我们还结合了一个区间不变的生成器和bkind显着提高正确的验证结果的数量。实验结果表明,bkind可以大大减少验证时间相比,天真的k-归纳证明规则,因为它只需要一半的步骤,找到一个给定的安全属性违反一个不安全的程序。bkind算法的性能优于另一种最先进的k-归纳验证器2LS,并且比分析大量公共可用基准时产生两倍以上的正确证明和大约35%的正确警报。
英文摘要:
We describe and evaluate a novel k-induction proof rule called bidirectional k-induction (bkind), which substantially improves the k-induction bug-finding capabilities. Particularly, bkind exploits the counterexamples generated by the over-approximation step to derive new properties and feed them back to the bounded model checking procedure. We also combine an interval invariant generator and bkind to significantly improve the number of correct verification results. Experimental results show that bkind can considerably reduce the verification time compared to the naive k-induction proof rule, since it only requires half the number of steps to find a given safety property violation in an unsafe program. The bkind algorithm outperforms 2LS, another state-of-the-art k-induction verifier, and produces more than twice correct proofs and about 35% more correct alarms than when analysing a large set of public available benchmarks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。