arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.04382cs.PLcs.LO
收藏

关于变迁系统中多面体不变量存在性的判定性

On the decidability of the existence of polyhedral invariants in transition systems

David Monniaux

摘要:

自动程序验证通常通过展示包含所需属性的归纳不变量来进行。对于数值属性,经典的一类不变量是凸多面体:线性(非)等式系统的解集。四十年来对凸多面体不变量的研究集中在,一方面,识别“更容易”的子类,另一方面,关于寻找一般凸多面体的算法。然而,这些算法并不能保证找到多面体归纳不变量,当它们存在时。据我们所知,摘要多面体归纳不变量的存在性从未被证明是不可判定的,本文证明了凸多面体归纳不变量的存在性是不可判定的,即使除了“坏”状态之外只有一个控制状态,如果不允许任何非线性约束,这个问题仍然是开放的。

英文摘要:

Automated program verification often proceeds by exhibiting inductive invariants entailing the desired properties.For numerical properties, a classical class of invariants is convex polyhedra: solution sets of system of linear (in)equalities.Forty years of research on convex polyhedral invariants have focused, on the one hand, on identifying "easier" subclasses, on the other hand on heuristics for finding general convex polyhedra.These heuristics are however not guaranteed to find polyhedral inductive invariants when they exist.To our best knowledge, the existence of polyhedral inductive invariants has never been proved to be undecidable.In this article, we show that the existence of convex polyhedral invariants is undecidable, even if there is only one control state in addition to the "bad" one.The question is still open if one is not allowed any nonlinear constraint.

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

↑