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.
Type de document :
Pré-publication, Document de travail
2014
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-00991853
Contributeur : Alexis Fouilhe <>
Soumis le : mercredi 18 juin 2014 - 10:56:58
Dernière modification le : mercredi 25 juin 2014 - 10:49:48
Document(s) archivé(s) le : jeudi 18 septembre 2014 - 10:46:32

Fichier

main.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00991853, version 2

Collections

Citation

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

Partager

Métriques

Consultations de
la notice

274

Téléchargements du document

156