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

逐点模型检验

Model Checking in Bits and Pieces

Kedar S. Namjoshi

摘要:

并发程序的完全自动化验证是一个困难的问题,主要是因为状态爆炸:一个程序的状态空间的指数增长,其并发活动组件的数量。通过一次只分析单个组件,应用分而治之的策略来改善状态爆炸是很自然的。我们表明,这种策略导致了一个“分裂”不变的概念,这是全球归纳的断言,而被构造为一些本地的,每组件的不变量的连接。这个公式与经典的Owicki-Gries方法和Rely-Guarantee推理密切相关。我们展示了如何将一个不变量划分成若干个范围有限的部分,使得有可能应用新的,局部化的对称和抽象形式,以大大简化其计算。分裂不变性也与参数验证有着有趣的联系。一个参数系统的量化不变量对于每个实例都是分裂不变量。我们展示了如何在某些情况下,反转这种连接,并自动概括从一个小的系统实例的分裂不变的量化不变的情况下,整个家庭的实例。

英文摘要:

Fully automated verification of concurrent programs is a difficult problem, primarily because of state explosion: the exponential growth of a program state space with the number of its concurrently active components. It is natural to apply a divide and conquer strategy to ameliorate state explosion, by analyzing only a single component at a time. We show that this strategy leads to the notion of a "split" invariant, an assertion which is globally inductive, while being structured as the conjunction of a number of local, per-component invariants. This formulation is closely connected to the classical Owicki-Gries method and to Rely-Guarantee reasoning. We show how the division of an invariant into a number of pieces with limited scope makes it possible to apply new, localized forms of symmetry and abstraction to drastically simplify its computation. Split invariance also has interesting connections to parametric verification. A quantified invariant for a parametric system is a split invariant for every instance. We show how it is possible, in some cases, to invert this connection, and to automatically generalize from a split invariant for a small instance of a system to a quantified invariant which holds for the entire family of instances.

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

↑