用于安全属性的归纳有效性核的有效生成
Efficient Generation of Inductive Validity Cores for Safety Properties
摘要:
符号模型检查器可以在非常复杂的模型上构造属性的证明。然而,当证明成功时,工具报告的结果通常不会为用户提供太多的洞察力。对于用户来说,拥有与证明相关的可追溯性信息通常是有用的:模型的哪些部分是构建它所必需的。这种可追溯性信息可以用于诊断各种建模问题,例如过约束公理和欠约束属性,也可以用于度量模型上一组需求的完整性。在本文中,我们提出了一个新的算法,有效地计算归纳有效性核心(IVC)内的一个模型,必要的归纳证明的安全性质的顺序系统。该算法基于当前SMT求解器中内置的UNSAT核心支持和一种新的归纳问题编码,以尝试生成最小归纳有效性核心。我们证明了我们的算法是正确的,并描述了它的实现在JKind模型检查器的光泽模型。然后,我们提出了一个实验,在该实验中,我们基准的算法的速度,多样性生产的核心,和最小化,有希望的结果。
英文摘要:
Symbolic model checkers can construct proofs of properties over very complex models. However, the results reported by the tool when a proof succeeds do not generally provide much insight to the user. It is often useful for users to have traceability information related to the proof: which portions of the model were necessary to construct it. This traceability information can be used to diagnose a variety of modeling problems such as overconstrained axioms and underconstrained properties, and can also be used to measure completeness of a set of requirements over a model. In this paper, we present a new algorithm to efficiently compute the inductive validity core (IVC) within a model necessary for inductive proofs of safety properties for sequential systems. The algorithm is based on the UNSAT core support built into current SMT solvers and a novel encoding of the inductive problem to try to generate a minimal inductive validity core. We prove our algorithm is correct, and describe its implementation in the JKind model checker for Lustre models. We then present an experiment in which we benchmark the algorithm in terms of speed, diversity of produced cores, and minimality, with promising results.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。