Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra - Archive ouverte HAL Access content directly
Journal Articles Journal of Automated Reasoning Year : 2018

Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra

Sylvain Boulmé
Alexandre Maréchal
  • Function : Author
  • PersonId : 962757

Abstract

Our concern is the modular development of a certified static analyzer in Coq: we extend a certified abstract domain of convex polyhedra with a linearization procedure approximating polynomial expressions. In order to help such a development, we propose a proof framework, embedded in Coq, that implements a refinement calculus. It allows to hide for proofs several low-level aspects of the computations on abstract domains. Moreover, refinement proofs are naturally simplified thanks to computations of weakest preconditions.
Fichier principal
Vignette du fichier
hal_main.pdf (859.8 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01133865 , version 1 (20-03-2015)
hal-01133865 , version 2 (15-07-2015)
hal-01133865 , version 3 (12-12-2017)
hal-01133865 , version 4 (15-11-2018)

Identifiers

Cite

Sylvain Boulmé, Alexandre Maréchal. Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra. Journal of Automated Reasoning, 2018, ⟨10.1007/s10817-018-9492-2⟩. ⟨hal-01133865v4⟩

Relations

430 View
337 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More