why3 0.83
| Authors | François Bobot, Jean-Christophe Filliâtre, Claude Marché, Guillaume Melquiond and Andrei Paskevich | |||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| License | GNU Lesser General Public License version 2.1 | |||||||||||||||||
| Homepage | http://why3.lri.fr/ | |||||||||||||||||
| Maintainer | Francois.Bobot@cea.fr | |||||||||||||||||
| Tags | deductive, program verification, formal specification, automated theorem prover and interactive theorem prover | |||||||||||||||||
| Dependencies |
|
|||||||||||||||||
| Optional dependencies |
|
|||||||||||||||||
| Published | May 6, 2014 | |||||||||||||||||
| Source [http] |
https://gforge.inria.fr/frs/download.php/33490/why3-0.83.tar.gz 35f99e5f64939e50ea57f641ba2073ec |
|||||||||||||||||
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/why3/why3.0.83/opam | |||||||||||||||||
Why3 is a platform for deductive program verification.
It 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.