Why3 provides a rich language for specification and programming, called WhyML, and relies on external theorem provers, both automated and interactive, to discharge verification conditions. Why3 comes with a standard library of logical theories (integer and real arithmetic, Boolean operations, sets and maps, etc.) and basic programming data structures (arrays, queues, hash tables, etc.). A user can write WhyML programs directly and get correct-by-construction OCaml programs through an automated extraction mechanism. WhyML is also used as an intermediate language for the verification of C, Java, or Ada programs.

Why3 is a complete reimplementation of the former Why platform. Among the new features are: numerous extensions to the input language, a new architecture for calling external provers, and a well-designed API, allowing to use Why3 as a software library. An important emphasis is put on modularity and genericity, giving the end user a possibility to easily reuse Why3 formalizations or to add support for a new external prover if wanted.

Dependencies (4)

  1. num
  2. menhir >= "20151112" & < "20200123"
  3. ocamlfind build
  4. ocaml >= "4.02.3"

Development Dependencies


Reverse Dependencies (4)

  1. archetype < "0.1.4"
  2. frama-c = "20.0"
  3. why3-coq = "1.2.1"
  4. why3-ide = "1.2.1"

Conflicts (2)

  1. ocamlgraph < "1.8.2"
  2. why3-base