通过插值生成程序不变量
Generating Program Invariants via Interpolation
摘要:
本文重点介绍自动生成多项式方程,这些方程是计算机程序的归纳循环不变量。我们提出了一种新的算法,这是基于多项式插值。虽然所提出的算法是不完整的,它是有效的,可以适用于更广泛的问题相比,现有的方法针对类似的问题。在大量的程序集上进行的实验证明了该方法的有效性。我们的方法目前的实现是基于密集插值,这是需要一个总的度界。在理论方面,我们研究了循环的不变理想的度和维数,这些循环没有分支,并且其中的分配定义了P-可解递归。此外,我们还得到了非平凡多项式方程不变量存在的充分条件(分别是)。不存在)。
英文摘要:
This article focuses on automatically generating polynomial equations that are inductive loop invariants of computer programs. We propose a new algorithm for this task, which is based on polynomial interpolation. Though the proposed algorithm is not complete, it is efficient and can be applied to a broader range of problems compared to existing methods targeting similar problems. The efficiency of our approach is testified by experiments on a large collection of programs. The current implementation of our method is based on dense interpolation, for which a total degree bound is needed. On the theoretical front, we study the degree and dimension of the invariant ideal of loops which have no branches and where the assignments define a P-solvable recurrence. In addition, we obtain sufficient conditions for non-trivial polynomial equation invariants to exist (resp. not to exist).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。