On the decidability of the existence of polyhedral invariants in transition systems

Abstract : Automated program verification often proceeds by exhibiting inductive invariants entailing the desired properties. For numerical properties, a classical class of invariants is convex polyhedra: solution sets of system of linear (in)equalities. Forty years of research on convex polyhedral invariants have focused, on the one hand, on identifying “easier” subclasses, on the other hand on heuristics for finding general convex polyhedra. These heuristics are however not guaranteed to find polyhedral inductive invariants when they exist. To our best knowledge, the existence of polyhedral inductive invariants has never been proved to be undecidable. In this article, we show that the existence of convex polyhedral invariants is undecidable, even if there is only one control state in addition to the “bad” one. The question is still open if one is not allowed any nonlinear constraint.
Type de document :
Article dans une revue
Acta Informatica, Springer Verlag, In press
Liste complète des métadonnées

Littérature citée [4 références]  Voir  Masquer  Télécharger

Contributeur : David Monniaux <>
Soumis le : mercredi 9 mai 2018 - 14:18:51
Dernière modification le : vendredi 6 juillet 2018 - 10:08:02
Document(s) archivé(s) le : mardi 25 septembre 2018 - 15:05:36


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


  • HAL Id : hal-01587125, version 2
  • ARXIV : 1709.04382



David Monniaux. On the decidability of the existence of polyhedral invariants in transition systems. Acta Informatica, Springer Verlag, In press. 〈hal-01587125v2〉



Consultations de la notice


Téléchargements de fichiers