Crash-safe refinement for a verified flash file system

  • This paper presents formal proof obligations for data refinement in the presence of unexpected crashes, notably due to a power failure. The work is part of our effort to construct a verified file system for flash memory. We apply the theory to one of the components in the flash file system, namely the erase block management layer. We show its functional correctness with respect to a high-level specification. We prove that the system can always recover from power loss to a desired state. We observe two simplifications that greatly reduce the proof effort for crashes in practice. Proofs are mechanized in the theorem prover KIV.

Download full text files

Export metadata

Statistics

Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Jörg Pfähler, Gidon Ernst, Gerhard SchellhornGND, Dominik HanebergORCiDGND, Wolfgang ReifGND
URN:urn:nbn:de:bvb:384-opus4-26718
Frontdoor URLhttps://opus.bibliothek.uni-augsburg.de/opus4/2671
Series (Serial Number):Reports / Technische Berichte der Fakultät für Angewandte Informatik der Universität Augsburg (2014-02)
Type:Report
Language:English
Year of first Publication:2014
Publishing Institution:Universität Augsburg
Release Date:2014/04/02
Tag:flash file system; specification; refinement; wear-leveling; power failure; KIV
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Software & Systems Engineering
Fakultät für Angewandte Informatik / Institut für Informatik / Lehrstuhl für Softwaretechnik
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):Deutsches Urheberrecht mit Print on Demand