PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
Verifying properties of parallel programs: an axiomatic approach
Communications of the ACM
Hacker's Delight
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
VCC: A Practical System for Verifying Concurrent C
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
CAV'07 Proceedings of the 19th international conference on Computer aided verification
The Art of Computer Programming: Combinatorial Algorithms, Part 1
The Art of Computer Programming: Combinatorial Algorithms, Part 1
The 1st verified software competition: experience report
FM'11 Proceedings of the 17th international conference on Formal methods
Program proving using intermediate verification languages (IVLs) like boogie and why3
Proceedings of the 2012 ACM conference on High integrity language technology
Towards formal verification of TLS network packet processing written in C
PLPV '13 Proceedings of the 7th workshop on Programming languages meets program verification
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
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.