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

用高度Ω的转移不变量证明终止性

Proving termination with transition invariants of height omega

Stefano Berardi, Paulo Oliva, Silvia Steila

摘要:

Podelski和Rybalchenko的终止定理指出,从任何初始状态终止的归约关系正是其传递闭包(仅限于可达状态)包含在某些良基关系的有限并中的归约关系。该定理的另一种陈述是,终止约化关系正是那些具有“反言有理的转变不变量”的关系。根据这个结果,同一作者和Byron Cook设计了一个算法来检查while-if程序终止的充分条件。该算法寻找一个析取的良好基础的过渡不变量,由良好基础的关系的高度Ω,如果它找到它,它推导出终止的while-if程序使用终止定理。这就提出了一个有趣的问题:当每个关系都有高度Ω时,具有析取良基转换不变量的归约关系的状态是什么?这个问题的答案可以导致一组while-if程序的终止算法可以证明是终止的表征。本文的目的是证明它们是高度为ω ^n的约化关系的集合,其中n <ω。此外,如果转移不变量中的所有关系都是本原递归的,且归约关系是本原递归映射对某个本原递归集的限制的图,则最终状态可由初始状态下的某个本原递归映射计算.作为一个推论,我们得出的一组功能,有至少一个实现Podelski Rybalchenko while-if语言与一个良好的基础析取过渡不变,其中每个关系的高度Ω,正是一组原始递归函数。

英文摘要:

The Termination Theorem by Podelski and Rybalchenko states that the reduction relations which are terminating from any initial state are exactly the reduction relations whose transitive closure, restricted to the accessible states, is included in some finite union of well-founded relations. An alternative statement of the theorem is that terminating reduction relations are precisely those having a "disjunctively well-founded transition invariant". From this result the same authors and Byron Cook designed an algorithm checking a sufficient condition for termination for a while-if program. The algorithm looks for a disjunctively well-founded transition invariant, made of well-founded relations of height omega, and if it finds it, it deduces the termination for the while-if program using the Termination Theorem. This raises an interesting question: What is the status of reduction relations having a disjunctively well-founded transition invariant where each relation has height omega? An answer to this question can lead to a characterization of the set of while-if programs which the termination algorithm can prove to be terminating. The goal of this work is to prove that they are exactly the set of reduction relations having height omega^n for some n < omega. Besides, if all the relations in the transition invariant are primitive recursive and the reduction relation is the graph of the restriction to some primitive recursive set of a primitive recursive map, then a final state is computable by some primitive recursive map in the initial state. As a corollary we derive that the set of functions, having at least one implementation in Podelski Rybalchenko while-if language with a well-founded disjunctively transition invariant where each relation has height omega, is exactly the set of primitive recursive functions.

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

↑