RAFFS: Model Checking a Robust Abstract Flash File Store
- Cite this paper as:
- Taverne P., Pronk C.. (2009) RAFFS: Model Checking a Robust Abstract Flash File Store. In: Breitman K., Cavalcanti A. (eds) Formal Methods and Software Engineering. ICFEM 2009. Lecture Notes in Computer Science, vol 5885. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.