A certifying frontend for (sub)polyhedral abstract domains - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

A certifying frontend for (sub)polyhedral abstract domains

Alexis Fouilhe
  • Function : Author
Sylvain Boulmé
  • Function : Author

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.
Fichier principal
Vignette du fichier
main.pdf (202.16 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00991853 , version 1 (16-05-2014)
hal-00991853 , version 2 (18-06-2014)

Identifiers

  • HAL Id : hal-00991853 , version 2

Cite

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

Share

Gmail Facebook Twitter LinkedIn More