属性引导的自组合
Property Directed Self Composition
摘要:
我们解决的问题,验证k-安全属性:属性,指的是k-交互执行的程序。验证k-安全性的一个重要方法是自合成。在这种方法中,在原始程序上检查k-安全性的问题被简化为在以某种顺序执行原始程序的k个副本的程序上检查“普通”安全属性。副本的组合方式决定了验证组合程序的复杂程度。我们认为这种组合提供了一个语义自组合功能,映射的组成程序的每个状态的副本,使移动。由于“质量”的自我组合功能的能力来衡量,以验证组成的程序的安全性,我们制定的问题,推断自我组合功能连同所需的归纳不变量,以验证组成的程序的安全性,两者都被限制在一个给定的语言。我们开发了一个属性导向的推理算法,给定的一组谓词,推断组合不变的对所表示的给定谓词的布尔组合,或确定没有这样的对存在。我们实现了我们的算法,并证明它能够找到现有工具无法达到的自我组合。
英文摘要:
We address the problem of verifying k-safety properties: properties that refer to k-interacting executions of a program. A prominent way to verify k-safety properties is by self composition. In this approach, the problem of checking k-safety over the original program is reduced to checking an "ordinary" safety property over a program that executes k copies of the original program in some order. The way in which the copies are composed determines how complicated it is to verify the composed program. We view this composition as provided by a semantic self composition function that maps each state of the composed program to the copies that make a move. Since the "quality" of a self composition function is measured by the ability to verify the safety of the composed program, we formulate the problem of inferring a self composition function together with the inductive invariant needed to verify safety of the composed program, where both are restricted to a given language. We develop a property-directed inference algorithm that, given a set of predicates, infers composition-invariant pairs expressed by Boolean combinations of the given predicates, or determines that no such pair exists. We implemented our algorithm and demonstrate that it is able to find self compositions that are beyond reach of existing tools.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。