决定有条件终止
Deciding Conditional Termination
摘要:
我们解决的问题,有条件终止,这是一个给定的程序总是终止定义的初始配置集。首先,我们定义的对偶集,从一个非终止执行存在的初始配置,作为最大的不动点的功能,映射到其原像的一组状态的过渡关系。这个定义允许计算最弱的非终止前提条件,如果至少有以下之一成立:(i)转移关系是确定性的,(ii)降阶Kleene序列过逼近最大不动点收敛于100步,或(iii)转移关系是有根据的。我们证明了两类关系(即八边形和有限么半群仿射关系)都是这种情况。此外,由于这些关系的封闭形式可以在Presburger算法中定义,我们得到了这种循环的终止问题的可判定性。
英文摘要:
We address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dual set, of initial configurations from which a non-terminating execution exists, as the greatest fixpoint of the function that maps a set of states into its pre-image with respect to the transition relation. This definition allows to compute the weakest non-termination precondition if at least one of the following holds: (i) the transition relation is deterministic, (ii) the descending Kleene sequence overapproximating the greatest fixpoint converges in finitely many steps, or (iii) the transition relation is well founded. We show that this is the case for two classes of relations, namely octagonal and finite monoid affine relations. Moreover, since the closed forms of these relations can be defined in Presburger arithmetic, we obtain the decidability of the termination problem for such loops.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。