Formal Verification of the Heap Manager of an Operating System Using Separation Logic

Abstract

In order to ensure memory properties of an operating system, it is important to verify the implementation of its heap manager. In the case of an existing operating system, this is a difficult task because the heap manager is usually written in a low-level language that makes use of pointers, and it is usually not written with verification in mind. In this paper, our main contribution is the formal verification of the heap manager of an existing embedded operating system, namely Topsy. For this purpose, we develop in the Coq proof assistant a library for separation logic, an extension of Hoare logic to deal with pointers. Using this library, we were able to verify the C source code of the Topsy heap manager, and to find and correct bugs.

DOI: 10.1007/11901433_22

Extracted Key Phrases

6 Figures and Tables

Cite this paper

@inproceedings{Marti2006FormalVO, title={Formal Verification of the Heap Manager of an Operating System Using Separation Logic}, author={Nicolas Marti and Reynald Affeldt and Akinori Yonezawa}, booktitle={ICFEM}, year={2006} }