Verifying Two Lines of C with Why3: An Exercise in Program Verification [chapter]

Jean-Christophe Filliâtre
2012 Lecture Notes in Computer Science  
This article details the formal verification of a 2-line C program that computes the number of solutions to the n-queens problem. The formal proof of (an abstraction of) the C code is performed using the Why3 tool to generate the verification conditions and several provers (Alt-Ergo, CVC3, Coq) to discharge them. The main purpose of this article is to illustrate the use of Why3 in verifying an algorithmically complex program. This work is partly supported by the ANR project U3CAT (ANR-08-SEGI-021) and the Open-DO project Hi-Lite. 1
doi:10.1007/978-3-642-27705-4_8 fatcat:ety2ftvolfacfoykjlv7y43hfq