Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra

Alexis Fouilhé
  • Function : Correspondent author
  • PersonId : 938718

Connectez-vous pour contacter l'auteur
David Monniaux
Connectez-vous pour contacter l'auteur
Michaël Périn
  • Function : Correspondent author
DCS

Abstract

Polyhedra form an established abstract domain for inferring runtime properties of programs using abstract interpretation. Computations on them need to be certified for the whole static analysis results to be trusted. In this work, we look at how far we can get down the road of a posteriori verification to lower the overhead of certification of the abstract domain of polyhedra. We demonstrate methods for making the cost of inclusion certificate generation negligible. From a performance point of view, our single-representation, constraints-based implementation compares with state-of-the-art implementations.
Fichier principal
Vignette du fichier
Fouilhe_et_al_SAS_2013.pdf (434.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00806990 , version 1 (02-04-2013)

Identifiers

Cite

Alexis Fouilhé, David Monniaux, Michaël Périn. Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra. 20th static analysis symposium (SAS), Jun 2013, Seattle, Washington, United States. pp.345-365, ⟨10.1007/978-3-642-38856-9_19⟩. ⟨hal-00806990⟩
374 View
248 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More