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

学习终止程序的终止性分析

Termination Analysis by Learning Terminating Programs

Matthias Heizmann, Jochen Hoenicke, Andreas Podelski

摘要:

我们提出了一种新的方法来终止分析。在第一步中,分析使用一个程序作为一个黑盒子,它只展示了一组有限的样本轨迹。每个样本迹线都是无限的,但可以用有限的套索表示。分析可以从套索的终止证明中“学习”一个程序,套索是一个通过构造终止的程序。在第二步中,分析检查样本轨迹集在我们可以使其形式化的意义上具有代表性。实验评估表明,该方法是一个潜在的有用的除了现有的方法来终止分析的投资组合。

英文摘要:

We present a novel approach to termination analysis. In a first step, the analysis uses a program as a black-box which exhibits only a finite set of sample traces. Each sample trace is infinite but can be represented by a finite lasso. The analysis can "learn" a program from a termination proof for the lasso, a program that is terminating by construction. In a second step, the analysis checks that the set of sample traces is representative in a sense that we can make formal. An experimental evaluation indicates that the approach is a potentially useful addition to the portfolio of existing approaches to termination analysis.

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

↑