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

不同的地图,不同的用途。中间验证语言的程序转换

Different Maps for Different Uses. A Program Transformation for Intermediate Verification Languages

Daniel Dietsch, Matthias Heizmann, Jochen Hoenicke, Alexander Nutz, Andreas Podelski

摘要:

在基于定理证明器或SMT求解器的验证中,要验证的程序通常以中间验证语言给出,例如Boogie,Why或CHC。这种情况提出了新的挑战。我们调查了一个预处理步骤,它采取类似的作用,别名分析在验证中发挥作用,除了现在,一个(数学)映射是用来模拟内存或数组类型的数据对象。我们提出了一个程序转换,需要一个程序P到一个等价的程序P',这样,通过验证P',而不是P,我们可以减少的情况下分裂的数量的指数爆炸的负担。在这里,case分割是根据使用相同map变量的两个语句是否独立;如果它们是独立的,我们也可以使用两个不同的map变量,从而消除case分割的需要(这是程序转换背后的想法)。我们已经实现了程序转换,并表明,在理想的情况下,我们可以避免指数爆炸。

英文摘要:

In theorem prover or SMT solver based verification, the program to be verified is often given in an intermediate verification language such as Boogie, Why, or CHC. This setting raises new challenges. We investigate a preprocessing step which takes the similar role that alias analysis plays in verification, except that now, a (mathematical) map is used to model the memory or a data object of type array. We present a program transformation that takes a program P to an equivalent program P' such that, by verifying P' instead of P, we can reduce the burden of the exponential explosion in the number of case splits. Here, the case splits are according to whether two statements using the same map variable are independent or not; if they are independent, we might as well employ two different map variables and thus remove the need for a case split (this is the idea behind the program transformation). We have implemented the program transformation and show that, in an ideal case, we can avoid the exponential explosion.

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

↑