Let’s verify this with Why3

@article{Bobot2014LetsVT,
  title={Let’s verify this with Why3},
  author={François Bobot and J. Filli{\^a}tre and C. March{\'e} and A. Paskevich},
  journal={International Journal on Software Tools for Technology Transfer},
  year={2014},
  volume={17},
  pages={709-727}
}
We present solutions to the three challenges of the VerifyThis competition held at the 18th FM symposium in August 2012. These solutions use the Why3 environment for deductive program verification. 
Instrumenting a weakest precondition calculus for counterexample generation
A Modular Way to Reason About Iteration
VerifyThis 2012
Lightweight Interactive Proving inside an Automatic Program Verifier
A Framework for Proof-carrying Logical Transformations
A Semi-automatic Proof of Strong Connectivity
...
1
2
3
4
...

References

SHOWING 1-10 OF 35 REFERENCES
System Description: E 0.81
Z3: An Efficient SMT Solver
Why3: Shepherd Your Herd of Provers
Preserving User Proofs across Specification Changes
Why3 - Where Programs Meet Provers
SPASS Version 3.5
Interactive Theorem Proving and Program Development
Freedom before commitment: a lightweight type system for object initialisation
Cvc4
The Zipper
  • G. Huet
  • Computer Science
  • J. Funct. Program.
  • 1997
...
1
2
3
4
...