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

证明一阶逻辑中安全属性的截断界限

Proving Cutoff Bounds for Safety Properties in First-Order Logic

Raz Lotan, Eden Frenkel, Sharon Shoham

AI总结:

针对一阶逻辑无法区分有限与无限结构导致虚假反例的问题,提出截断方法适配,通过模拟关系将安全验证归约为有界实例,并用SMT求解器验证,可证明部分一阶归纳不变量无法证明的示例。

摘要:

一阶逻辑已被确立为建模和验证复杂系统(如分布式协议和并发系统)的重要工具。这些系统在网络节点数或线程数方面是参数化的,该数量在任何系统实例中都是有限的,但无界。一阶逻辑的一个缺点是它无法区分有限结构和无限结构,导致产生虚假反例。为缓解这一问题,我们提出了一种仅捕获有限系统实例的验证方法。我们的方法是将截断方法适配到以一阶逻辑建模的系统中。其思想是证明:任何在规模大于某个界限的系统实例中的安全违规,都可以由较小规模系统中的安全违规来模拟。该模拟为有限实例的正确性提供了归纳论证,从而将问题归结为证明有界规模实例的安全性。为此,我们开发了一个框架,用于(i)在一阶逻辑中编码此类模拟关系,以及(ii)通过交给SMT求解器的一组验证条件来验证模拟关系。我们将该方法应用于验证一组示例的安全性,其中一些示例无法通过一阶归纳不变量来证明。

英文摘要:

First-order logic has been established as an important tool for modeling and verifying intricate systems such as distributed protocols and concurrent systems. These systems are parametric in the number of nodes in the network or the number of threads, which is finite in any system instance, but unbounded. One disadvantage of first-order logic is that it cannot distinguish between finite and infinite structures, leading to spurious counterexamples. To mitigate this, we offer a verification approach that captures only finite system instances. Our approach is an adaptation of the cutoff method to systems modeled in first-order logic. The idea is to show that any safety violation in a system instance of size larger than some bound can be simulated by a safety violation in a system of a smaller size. The simulation provides an inductive argument for correctness in finite instances, reducing the problem to showing safety of instances with bounded size. To this end, we develop a framework to (i) encode such simulation relations in first-order logic and to (ii) validate the simulation relation by a set of verification conditions given to an SMT solver. We apply our approach to verify safety of a set of examples, some of which cannot be proven by a first-order inductive invariant.

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

↑