Verifying two lines of C with Why3: An exercise in program verification

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationVerified Software
Subtitle of host publicationTheories, Tools, Experiments - 4th International Conference, VSTTE 2012, Proceedings
Pages83-97
Number of pages15
DOIs
Publication statusPublished - 7 Feb 2012
Event4th International Conference on Verified Software: Theories, Tool and Experiments, VSTTE 2012 - Philadelphia, PA, United States
Duration: 28 Jan 201229 Jan 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7152 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Verified Software: Theories, Tool and Experiments, VSTTE 2012
Country/TerritoryUnited States
CityPhiladelphia, PA
Period28/01/1229/01/12

Fingerprint

Dive into the research topics of 'Verifying two lines of C with Why3: An exercise in program verification'. Together they form a unique fingerprint.

Cite this