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

利用超几何序列自动生成非线性循环不变量

Automated Generation of Non-Linear Loop Invariants Utilizing Hypergeometric Sequences

Andreas Humenberger, Maximilian Jaroschek, Laura Kovács

摘要:

分析和推理软件系统的安全属性成为一个特别具有挑战性的任务,程序具有复杂的流程,特别是循环或递归。对于这样的程序,需要额外的信息,例如以循环不变式的形式,表达在中间程序点保持的属性。本文研究了具有非平凡运算的程序循环,实现数值程序变量之间的加法和乘法。我们提出了一种新的方法自动生成所有多项式不变的一类这样的程序。我们的方法把程序转化为线性常递归方程,并计算这些方程的封闭形式的解决方案。这些封闭形式表达了最精确的归纳性质,因此是不变的。我们应用格罗布纳基计算得到多项式不变理想的基,从而得到所有多项式不变理想的有限表示。我们的工作显着扩展了所谓的P-可解循环类处理乘法与循环计数器变量。我们在Mathematica软件包Alignator中实现了我们的方法,并展示了我们方法的实际应用。

英文摘要:

Analyzing and reasoning about safety properties of software systems becomes an especially challenging task for programs with complex flow and, in particular, with loops or recursion. For such programs one needs additional information, for example in the form of loop invariants, expressing properties to hold at intermediate program points. In this paper we study program loops with non-trivial arithmetic, implementing addition and multiplication among numeric program variables. We present a new approach for automatically generating all polynomial invariants of a class of such programs. Our approach turns programs into linear ordinary recurrence equations and computes closed form solutions of these equations. These closed forms express the most precise inductive property, and hence invariant. We apply Gröbner basis computation to obtain a basis of the polynomial invariant ideal, yielding thus a finite representation of all polynomial invariants. Our work significantly extends the class of so-called P-solvable loops by handling multiplication with the loop counter variable. We implemented our method in the Mathematica package Aligator and showcase the practical use of our approach.

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

↑