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

作为约束求解的CTL + FO验证

CTL+FO Verification as Constraint Solving

Tewodros A. Beyene, Marc Brockschmidt, Andrey Rybalchenko

摘要:

表达程序正确性通常需要在整个执行(的不同分支)中关联程序数据。这些属性可以用CTL+FO来表示,这是一种允许混合时间和一阶量化的逻辑。判定程序是否满足CTL+FO性质是一个具有挑战性的问题,需要同时进行时间和数据推理。时态量词需要发现不变量和排序函数,而一阶量词需要实例化技术。本文提出了一种基于约束的CTL+FO性质自动证明方法。我们的方法使时间和一阶量化之间的相互作用明确的约束编码,结合递归和存在量化。通过将此约束编码与现成的求解器相结合,我们获得了CTL+FO的自动验证器。

英文摘要:

Expressing program correctness often requires relating program data throughout (different branches of) an execution. Such properties can be represented using CTL+FO, a logic that allows mixing temporal and first-order quantification. Verifying that a program satisfies a CTL+FO property is a challenging problem that requires both temporal and data reasoning. Temporal quantifiers require discovery of invariants and ranking functions, while first-order quantifiers demand instantiation techniques. In this paper, we present a constraint-based method for proving CTL+FO properties automatically. Our method makes the interplay between the temporal and first-order quantification explicit in a constraint encoding that combines recursion and existential quantification. By integrating this constraint encoding with an off-the-shelf solver we obtain an automatic verifier for CTL+FO.

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

↑