Communication Dans Un Congrès Electronic Notes in Theoretical Computer Science Année : 2012

Proving termination by policy iteration

Résumé

In this paper, we explore the adaptation of policy iteration techniques to compute greatest fixpoint approximations, in order to find sufficient conditions for program termination. Restricting ourselves to affine programs and the abstract domain of template constraint matrices, we show that the abstract greatest fixpoint can be computed exactly using linear programming, and that strategies are related to the template constraint matrix used. We also present a first result on the relationships between this approach and methods which use ranking functions.

Fichier principal
Vignette du fichier
article-masse-nsad2012.pdf (195.76 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-00757878 , version 1 (27-11-2012)

Licence

Identifiants

Citer

Damien Massé. Proving termination by policy iteration. NSAD'12 - 4th International Workshop on Numerical and Symbolic Abstract Domains, Sep 2012, Deauville, France. pp.77-88, ⟨10.1016/j.entcs.2012.09.008⟩. ⟨hal-00757878⟩
150 Consultations
256 Téléchargements

Altmetric

Partager

  • More