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.
翻译:我们提出了一个新的终止分析方法。 第一步, 分析使用一个程序作为黑盒, 它只显示一组有限的样本痕迹。 每个样本的痕迹都是无限的, 但可以用一个有限的缩略图来代表。 分析可以“ 清除” 一个程序, 这个程序是用建筑来终止的。 第二步, 分析检查这组样本痕迹是否具有代表性, 我们可以正式化。 一项实验性评估表明, 这种方法是现有终止分析方法组合的一个潜在有用补充 。