Skip to Main content Skip to Navigation
Conference papers

Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra

Alexis Fouilhé 1, * David Monniaux 2, * Michaël Périn 3, *
* Corresponding author
1 SYNCHRONE
VERIMAG - IMAG - VERIMAG
3 DCS
VERIMAG - IMAG - VERIMAG
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.
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00806990
Contributor : David Monniaux <>
Submitted on : Tuesday, April 2, 2013 - 4:57:14 PM
Last modification on : Monday, June 22, 2020 - 5:32:12 PM
Document(s) archivé(s) le : Sunday, April 2, 2017 - 11:27:48 PM

Files

Fouilhe_et_al_SAS_2013.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

800

Files downloads

787