To Infinity... and Beyond! - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

To Infinity... and Beyond!


The traditional method for proving program termination consists in inferring a ranking function. In many cases (i.e. programs with unbounded non-determinism), a single ranking function over natural numbers is not sufficient. Hence, we propose a new abstract domain to automatically infer ranking functions over ordinals. We extend an existing domain for piecewise-defined natural-valued ranking functions to polynomials in ω, where the polynomial coefficients are natural-valued functions of the program variables. The abstract domain is parametric in the choice of the state partitioning inducing the piecewise-definition and the type of functions used as polynomial coefficients. To our knowledge this is the first abstract domain able to reason about ordinals. Handling ordinals leads to a powerful approach for proving termination of imperative programs, which in particular allows us to take a first step in the direction of proving termination under fairness constraints and proving liveness properties of (sequential and) concurrent programs.
Fichier principal
Vignette du fichier
article-urban-mine-wst14.pdf (249.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01105216 , version 1 (20-01-2015)


  • HAL Id : hal-01105216 , version 1


Caterina Urban, Antoine Miné. To Infinity... and Beyond!. 14th International Workshop on Termination (WST'14), Jul 2014, Vienne, Austria. pp.5. ⟨hal-01105216⟩
178 View
106 Download


Gmail Facebook X LinkedIn More