 |
Free and accessible knowledge |
Conference papers
Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra
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.
https://hal.archives-ouvertes.fr/hal-00806990
Contributor : David Monniaux Connect in order to contact the contributor
Submitted on : Tuesday, April 2, 2013 - 4:57:14 PM
Last modification on : Tuesday, October 19, 2021 - 1:48:11 PM
Long-term archiving on: : Sunday, April 2, 2017 - 11:27:48 PM
Contributor : David Monniaux Connect in order to contact the contributor
Submitted on : Tuesday, April 2, 2013 - 4:57:14 PM
Last modification on : Tuesday, October 19, 2021 - 1:48:11 PM
Long-term archiving on: : Sunday, April 2, 2017 - 11:27:48 PM
Files
Fouilhe_et_al_SAS_2013.pdf
Files produced by the author(s)