Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

A certifying frontend for (sub)polyhedral abstract domains

Abstract : Convex polyhedra provide a relational abstraction of numerical properties for static analysis of programs by abstract interpretation. We describe a lightweight certification of polyhedral abstract domains using the Coq proof assistant. Our approach consists in delegating most computations to an untrusted backend and in checking its outputs with a certified frontend. The backend is free to implement relaxations of domain operators in order to trade some precision for more efficiency, but must produce hints about the soundness of its results. Experiments with a full-precision backend show that the certification overhead is small and that the certified abstract domain has comparable performance to non-certifying state-of-the-art implementations.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Alexis Fouilhe <>
Submitted on : Wednesday, June 18, 2014 - 10:56:58 AM
Last modification on : Monday, December 14, 2020 - 5:00:06 PM
Long-term archiving on: : Thursday, September 18, 2014 - 10:46:32 AM


Files produced by the author(s)


  • HAL Id : hal-00991853, version 2



Alexis Fouilhe, Sylvain Boulmé. A certifying frontend for (sub)polyhedral abstract domains. 2014. ⟨hal-00991853v2⟩



Record views


Files downloads