RAFFS: Model Checking a Robust Abstract Flash File Store

  • Paul Taverne
  • C. (Kees) Pronk
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5885)

Abstract

This paper presents a case study in modeling and verifying a POSIX-like file store for Flash memory. This work fits in the context of Hoare’s verification challenge and, in particular, Joshi and Holzmann’s mini-challenge to build a verifiable file store. We have designed a simple robust file store and implemented it in the form of a Promela model. A test harness is used to exercise the file store in a number of ways. Model checking technology has been extensively used to verify the correctness of our implementation. A distinguishing feature of our approach is the (bounded) exhaustive verification of power loss recovery.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Paul Taverne
    • 1
  • C. (Kees) Pronk
    • 1
  1. 1.Delft University of TechnologyThe Netherlands

Personalised recommendations