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

可编程程序的过程摘要的欠逼近

Underapproximation of Procedure Summaries for Integer Programs

Pierre Ganty, Radu Iosif, Filip Konecny

摘要:

我们展示了如何使用现成的非递归程序的分析程序的整数递归程序的程序摘要下近似。我们的方法的新颖之处在于,我们计算的非递归程序可能会捕捉到原始递归程序的许多行为,这些行为的堆栈使用无法被限制。此外,我们确定了一类递归程序,我们的方法终止,并返回精确的摘要关系,而不欠近似。这样做,我们推广了一个类似的结果,非递归程序的递归情况。最后,我们提出了我们的方法应用在一些例子的实施的实验结果。

英文摘要:

We show how to underapproximate the procedure summaries of recursive programs over the integers using off-the-shelf analyzers for non-recursive programs. The novelty of our approach is that the non-recursive program we compute may capture unboundedly many behaviors of the original recursive program for which stack usage cannot be bounded. Moreover, we identify a class of recursive programs on which our method terminates and returns the precise summary relations without underapproximation. Doing so, we generalize a similar result for non-recursive programs to the recursive case. Finally, we present experimental results of an implementation of our method applied on a number of examples.

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

↑