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.
Francesco Logozzo, Manuel Fähndrich. 20th static analysis symposium (SAS), Jun 2013, Seattle, Washington, United States. Springer, 7935, pp.345-365, 2013, <10.1007/978-3-642-38856-9_19>
https://hal.archives-ouvertes.fr/hal-00806990
Contributeur : David Monniaux <>
Soumis le : mardi 2 avril 2013 - 16:57:14
Dernière modification le : lundi 13 octobre 2014 - 15:43:25
Document(s) archivé(s) le : dimanche 2 avril 2017 - 23:27:48
Alexis Fouilhé, David Monniaux, Michaël Périn. Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra. Francesco Logozzo, Manuel Fähndrich. 20th static analysis symposium (SAS), Jun 2013, Seattle, Washington, United States. Springer, 7935, pp.345-365, 2013, <10.1007/978-3-642-38856-9_19>. <hal-00806990>
