[Paper Review] Proving termination with transition invariants of height omega

Stefano Berardi, Paulo Oliva+1 more|arXiv (Cornell University)|Jul 17, 2014

semigroups and automata theory3 references3 citations

TL;DR

This paper establishes that while-if programs with a disjunctively well-founded transition invariant composed of relations of height 𝜔 are exactly those whose reduction relations have ordinal height ≤ 𝜔ⁿ for some finite n. It further proves that such programs compute precisely the primitive recursive functions when the relations and transition relations are primitive recursive, characterizing the expressive power of the Podelski-Rybalchenko termination framework and supporting the conjecture that the Terminator algorithm captures exactly the primitive recursive functions.

ABSTRACT

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.

Motivation & Objective

• To characterize the class of while-if programs whose termination can be proven using disjunctively well-founded transition invariants with relations of height 𝜔.
• To determine the ordinal height of reduction relations that admit such invariants, linking proof-theoretic strength to computational expressiveness.
• To show that when all relations are primitive recursive, the final state and number of steps are computable by primitive recursive functions.
• To support the conjecture that the Terminator algorithm based on the Podelski-Rybalchenko Termination Theorem captures exactly the primitive recursive functions.

Proposed method

• Introduces the H-closure Theorem as a constructive, intuitionistic counterpart to Ramsey’s Theorem, enabling proof of the Termination Theorem in a constructive setting.
• Defines k-branching trees of decreasing sequences to model the structure of transition invariants and computes their ordinal height using the natural sum of ordinals.
• Uses a simulation of the H(R₁ ∪ … ∪ Rₖ) ordering via inclusion on k-ary trees to bound the ordinal height of the union as 2^(α₁ ⊕ … ⊕ αₖ) for relations of height ≤ αᵢ.
• Constructs a primitive recursive embedding from the transition invariant into k-ary trees to derive a uniform primitive recursive bound on the number of steps for termination.
• Proves that for a reduction relation defined as the graph of a primitive recursive map on a primitive recursive domain, the existence of an 𝜔-height transition invariant implies primitive recursive computability of the final state.
• Applies induction on function composition and primitive recursion to show that any function implementable in the Podelski-Rybalchenko while-if language with 𝜔-height invariants is primitive recursive.

Experimental results

Research questions

• RQ1 Which class of while-if programs can be proven terminating using transition invariants composed of relations of height 𝜔?
• RQ2 What is the maximum ordinal height of reduction relations that admit a disjunctively well-founded transition invariant with relations of height 𝜔?
• RQ3 Can the number of steps and final state of such programs be computed by primitive recursive functions?
• RQ4 Does the Podelski-Rybalchenko termination algorithm (and the Terminator algorithm) capture exactly the primitive recursive functions when restricted to 𝜔-height invariants?
• RQ5 Is there a constructive, intuitionistic proof of the Termination Theorem that characterizes the ordinal-theoretic strength of such invariants?

Key findings

• The set of reduction relations with a disjunctively well-founded transition invariant composed of relations of height 𝜔 is exactly the set of relations of ordinal height ≤ 𝜔ⁿ for some finite n.
• The ordinal height of the union of k relations of height 𝜔 is bounded by 2^(𝜔 ⊕ … ⊕ 𝜔) = 2^𝜔, which is strictly less than 𝜔^𝜔.
• For any while-if program with a transition invariant of height 𝜔 and primitive recursive relations, both the number of steps and the final state are computable by primitive recursive functions.
• The class of functions implementable in the Podelski-Rybalchenko while-if language with such invariants is exactly the class of primitive recursive functions.
• The paper provides a constructive proof of the Termination Theorem via the H-closure Theorem, enabling intuitionistic reasoning about termination.
• The results support the conjecture that the Terminator algorithm can only prove termination for primitive recursive functions when using 𝜔-height invariants.