To Infinity... and Beyond!

Caterina Urban 1 Antoine Miné 1
1 ANTIQUE - Analyse Statique par Interprétation Abstraite
DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt
Abstract : 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.
Type de document :
Communication dans un congrès
14th International Workshop on Termination (WST'14), Jul 2014, Vienne, Austria. pp.5
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger
Contributeur : Antoine Miné <>
Soumis le : mardi 20 janvier 2015 - 15:31:54
Dernière modification le : jeudi 11 janvier 2018 - 06:25:39
Document(s) archivé(s) le : mardi 21 avril 2015 - 10:11:07


Fichiers produits par l'(les) auteur(s)


  • 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〉



Consultations de la notice


Téléchargements de fichiers