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

在基于SMT的程序验证器中识别过度限制的匹配模式(扩展版)

Identifying Overly Restrictive Matching Patterns in SMT-based Program Verifiers (extended version)

Alexandra Bugariu, Arshavir Ter-Gabrielyan, Peter Müller

摘要:

全称量词经常出现在程序验证器产生的证明义务中,例如,将未解释的函数公理化和表示数组的属性。基于SMT的验证者通常通过E-匹配来推理它们,这是一种SMT算法,需要语法匹配模式来指导量词实例化。设计好的匹配模式是一项挑战。特别是,如果证明所需的量词没有实例化,过度限制的模式可能会导致虚假的验证错误;它们也可能隐藏不一致的公理化所导致的不合理性。在本文中,我们提出了第一种技术,识别和帮助用户补救过度限制匹配模式的影响。我们设计了一种新的算法来合成完成证明所需的缺失触发项。工具开发人员可以使用这些信息来改进他们的匹配模式,防止类似的验证错误,或者修复检测到的不合理性。

英文摘要:

Universal quantifiers occur frequently in proof obligations produced by program verifiers, for instance, to axiomatize uninterpreted functions and to express properties of arrays. SMT-based verifiers typically reason about them via E-matching, an SMT algorithm that requires syntactic matching patterns to guide the quantifier instantiations. Devising good matching patterns is challenging. In particular, overly restrictive patterns may lead to spurious verification errors if the quantifiers needed for a proof are not instantiated; they may also conceal unsoundness caused by inconsistent axiomatizations. In this paper, we present the first technique that identifies and helps the users remedy the effects of overly restrictive matching patterns. We designed a novel algorithm to synthesize missing triggering terms required to complete a proof. Tool developers can use this information to refine their matching patterns and prevent similar verification errors, or to fix a detected unsoundness.

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

↑