Why3 — Where Programs Meet Provers [chapter]

Jean-Christophe Filliâtre, Andrei Paskevich
2013 Lecture Notes in Computer Science  
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 existing automated and interactive theorem provers. To keep verification conditions tractable and comprehensible, WhyML
more » ... mposes a static control of aliases that obviates the use of a memory model. A user can write WhyML programs directly and get correct-by-construction OCaml programs via an automated extraction mechanism. 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 nontrivial examples of program verification.
doi:10.1007/978-3-642-37036-6_8 fatcat:nisxxfpjwzepvebrik2ia6xjsq