强不变量是困难的:关于(概率)程序最强多项式不变量的难度
Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs
AI总结:
本文证明计算多项式循环的最强多项式不变量至少与Skolem问题一样困难,并推广至概率程序,引入矩不变量理想,证明其在分支情况下不可计算、无分支时Skolem困难,同时给出可计算类的算法。
摘要:
我们证明,对于具有多项式赋值的单路径循环,计算最强多项式不变量至少与Skolem问题一样困难,Skolem问题是一个近一个世纪以来可判定性一直悬而未决的著名问题。虽然对于仿射循环,最强多项式不变量是可计算的,但对于多项式循环,该问题仍然完全开放。作为一个具有独立意义的中间结果,我们证明了离散多项式动力系统的可达性也是Skolem困难的。此外,我们推广了不变量理想的概念,并为概率程序引入了矩不变量理想。利用这一工具,我们进一步证明,最强多项式矩不变量(i)对于具有分支语句的概率循环是不可计算的,并且(ii)对于没有分支语句的多项式概率循环,计算它是Skolem困难的。最后,我们确定了一类概率循环,对于这类循环,最强多项式矩不变量是可计算的,并为其提供了一种算法。
英文摘要:
We show that computing the strongest polynomial invariant for single-path loops with polynomial assignments is at least as hard as the Skolem problem, a famous problem whose decidability has been open for almost a century. While the strongest polynomial invariants are computable for affine loops, for polynomial loops the problem remained wide open. As an intermediate result of independent interest, we prove that reachability for discrete polynomial dynamical systems is Skolem-hard as well. Furthermore, we generalize the notion of invariant ideals and introduce moment invariant ideals for probabilistic programs. With this tool, we further show that the strongest polynomial moment invariant is (i) uncomputable, for probabilistic loops with branching statements, and (ii) Skolem-hard to compute for polynomial probabilistic loops without branching statements. Finally, we identify a class of probabilistic loops for which the strongest polynomial moment invariant is computable and provide an algorithm for it.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。