A case study of C source code verification: the Schorr-Waite algorithm

We describe an experiment of formal verification of C source code, using the CADUCEUS tool. We performed a full formal proof of the classical Schorr-Waite graph-marking algorithm, which has already been used several times as a case study for formal reasoning on pointer programs. Our study is origina...

Full description

Saved in:
Bibliographic Details
Published inThird IEEE International Conference on Software Engineering and Formal Methods (SEFM'05) pp. 190 - 199
Main Authors Hubert, T., Marche, C.
Format Conference Proceeding
LanguageEnglish
Published IEEE 2005
Subjects
Assembly
Computer aided software engineering
Computer languages
Data structures
Formal verification
Java
Logic programming
Mobile handsets
Prototypes
Smart cards
Online AccessGet full text

Cover

More Information
Summary:We describe an experiment of formal verification of C source code, using the CADUCEUS tool. We performed a full formal proof of the classical Schorr-Waite graph-marking algorithm, which has already been used several times as a case study for formal reasoning on pointer programs. Our study is original with respect to previous experiments for several reasons. First, we use a general-purpose tool for C programs: we start from a real source code written in C, specified using an annotation language for arbitrary C programs. Second, we use several theorem provers as back-ends, both automatic and interactive. Third, we indeed formally establish more properties of the algorithm than previous works, in particular a formal proof of termination is made.
ISBN:0769524354
9780769524351
ISSN:1551-0255
2160-7656
DOI:10.1109/SEFM.2005.1