Deductive Verification with the Help of Abstract Interpretation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2017

Deductive Verification with the Help of Abstract Interpretation

Lucas Baudin
  • Function : Author
  • PersonId : 1022754


Abstract interpretation is widely used in static analysis tools. However, to the best of our knowledge, it has not been extensively experimented in an interactive deductive verification context. This paper describes an analysis by abstract interpretation to infer loop invariants in the Why3 tool. The analysis takes advantage of the logic annotations present in the source code, including potential handwritten loop invariants. The inferred invariants are added to loops as if written by the user. They are checked by external provers and thus the analysis by abstract interpretation does not need to be trusted. Our analysis goes beyond numerical invariants. We describe two functors that add uninterpreted functions and quantifiers to a numerical abstract domain. The resulting domain is generic enough to reason about algebraic types, Booleans, or arrays. We show that it achieves a level of expressivity comparable to that of ad-hoc domains for arrays found in the literature.
Fichier principal
Vignette du fichier
imarticle.pdf (556.29 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01634318 , version 1 (13-11-2017)


  • HAL Id : hal-01634318 , version 1


Lucas Baudin. Deductive Verification with the Help of Abstract Interpretation. 2017. ⟨hal-01634318⟩
281 View
274 Download


Gmail Facebook X LinkedIn More