arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2209.09327cs.PLcs.SE
收藏

S2TD:支持错误有无推理的分离逻辑验证器

S2TD: a Separation Logic Verifier that Supports Reasoning of the Absence and Presence of Bugs

Quang Loc Le, Jun Sun, Long H. Pham, Shengchao Qin

摘要:

众所周知,堆操作程序是很难推理的。我们提出了一种新的验证器堆操作程序称为S2 TD,它编码的程序系统的形式约束角子句(CHC)使用一种新的扩展分离逻辑(SL)与递归谓词和悬空谓词。S2 TD积极探索循环证明来解决路径爆炸问题。S2 TD区别于现有的基于CHC的验证程序,专注于堆操作程序,并采用循环证明来有效地验证或证伪它们与反例。与现有的基于SL的验证器相比,S2 TD精确地指定了解除分配的指针堆,以避免错误存在的推理中的误报。S2 TD已经使用来自SV-COMP存储库的一组全面的基准程序进行了评估。结果表明,S2 TD比最先进的程序验证器更有效,比大多数程序验证器更高效。

英文摘要:

Heap-manipulating programs are known to be challenging to reason about. We present a novel verifier for heap-manipulating programs called S2TD, which encodes programs systematically in the form of Constrained Horn Clauses (CHC) using a novel extension of separation logic (SL) with recursive predicates and dangling predicates. S2TD actively explores cyclic proofs to address the path explosion problem. S2TD differentiates itself from existing CHC-based verifiers by focusing on heap-manipulating programs and employing cyclic proof to efficiently verify or falsify them with counterexamples. Compared with existing SL-based verifiers, S2TD precisely specifies the heaps of de-allocated pointers to avoid false positives in reasoning about the presence of bugs. S2TD has been evaluated using a comprehensive set of benchmark programs from the SV-COMP repository. The results show that S2TD is more effective than state-of-art program verifiers and is more efficient than most of them.

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

↑