[Paper Review] Certification extends Termination Techniques

Christian Sternagel, René Thiemann|arXiv (Cornell University)|Aug 8, 2012

Logic, programming, and type systems10 references3 citations

TL;DR

This paper extends termination certification in term rewrite systems by formalizing two novel techniques in Isabelle/HOL: polynomial orders over arbitrary algebras (including matrices) with negative constants, and a unified ordered arctic semiring over the rationals that generalizes existing arctic approaches. These formalizations enable certification of proofs using techniques not yet supported by mainstream termination tools, enhancing trust in automated termination analysis.

ABSTRACT

There are termination proofs that are produced by termination tools for which certifiers are not powerful enough. However, a similar situation also occurs in the other direction. We have formalized termination techniques in a more general setting as they have been introduced. Hence, we can certify proofs using techniques that no termination tool supports so far. In this paper we shortly present two of these formalizations: Polynomial orders with negative constants and Arctic termination.

Motivation & Objective

• To address the growing complexity of termination proofs in term rewrite systems, which are often too large and intricate to validate manually.
• To improve trust in automated termination tools by enabling formal certification of proofs using techniques not yet supported by existing tools.
• To extend the CeTA certifier with formalizations of advanced termination techniques, such as polynomial orders with negative constants and generalized arctic semirings.
• To unify and generalize existing arctic semiring approaches into a single framework over the rationals, subsuming prior methods.
• To demonstrate that formalized techniques can outpace implementation in tools, enabling certification of proofs that current tools cannot generate.

Proposed method

• Formalizing polynomial orders over arbitrary semirings, including matrices, by generalizing the standard approach to allow negative constants and arbitrary carrier sets.
• Defining an ordered arctic semiring structure over the rationals that subsumes both the standard arctic semiring and the arctic semiring below zero.
• Introducing a positivity predicate and well-foundedness conditions to ensure the resulting reduction pair is valid for termination proofs.
• Lifting operations and orderings to matrix algebras, preserving the required monotonicity and well-foundedness properties for use in reduction pairs.
• Using Isabelle/HOL to formally verify all definitions and theorems, ensuring correctness of the formalization and enabling integration with the CeTA certifier.
• Validating the approach by showing that existing results (e.g., Waldmann's transformation) can be recovered and generalized within the new framework.

Experimental results

Research questions

• RQ1 Can polynomial orders with negative constants be formally verified in a proof assistant to support more flexible termination proofs?
• RQ2 Can a single arctic semiring framework be defined over the rationals that generalizes and subsumes existing arctic semiring approaches?
• RQ3 How can formalized termination techniques be made to outpace implementable techniques in current termination tools?
• RQ4 What are the minimal algebraic conditions required to ensure well-foundedness and monotonicity in reduction pairs based on arctic semirings?
• RQ5 Can matrix interpretations over arctic semirings be formally verified and used to certify termination proofs?

Key findings

• The formalization of polynomial orders over arbitrary algebras, including matrices, allows for the certification of termination proofs using negative constants, which are not supported by current termination tools.
• A unified ordered arctic semiring over the rationals has been formally defined, subsuming both the standard arctic semiring and the arctic semiring below zero, and enabling more expressive termination proofs.
• The new arctic semiring framework allows for polynomial interpretations where only one coefficient needs to be positive, unlike previous approaches that required the constant term to be positive.
• The formalization in Isabelle/HOL ensures correctness of the underlying algebraic structures and reduction pairs, enabling integration with the CeTA certifier.
• The approach enables certification of termination proofs using techniques not yet implemented in any termination tool, demonstrating the value of formalization in advancing proof certification.
• The results show that formalized techniques can be more general than current tools, and that existing results (e.g., Waldmann’s transformation) can be formally recovered and generalized.