Why3 -- Where Programs Meet Provers - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Why3 -- Where Programs Meet Provers

Abstract

We present Why3, a tool for deductive program verification, and WhyML, its programming and specification language. WhyML is a first-order language with polymorphic types, pattern matching, and inductive predicates. Programs can make use of record types with mutable fields, type invariants, and ghost code. Verification conditions are discharged by Why3 with the help of various exist- ing automated and interactive theorem provers. To keep verification conditions tractable and comprehensible, WhyML imposes a static control of aliases that ob- viates the use of a memory model. A user can write WhyML programs directly and get correct-by-construction OCaml programs via an automated extraction mech- anism. WhyML is also used as an intermediate language for the verification of C, Java, or Ada programs. We demonstrate the benefits of Why3 and WhyML on non- trivial examples of program verification.
Fichier principal
Vignette du fichier
main.pdf (47.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00789533 , version 1 (18-02-2013)

Identifiers

  • HAL Id : hal-00789533 , version 1

Cite

Jean-Christophe Filliâtre, Andrei Paskevich. Why3 -- Where Programs Meet Provers. ESOP'13 22nd European Symposium on Programming, Mar 2013, Rome, Italy. ⟨hal-00789533⟩
2459 View
2101 Download

Share

Gmail Facebook X LinkedIn More