Abstract
File systems are too important, and current ones are too buggy, to remain unverified. Yet the most successful verification methods for functional correctness remain too expensive for current file system implementations - - we need verified correctness but at reasonable cost. This paper presents our vision and ongoing work to achieve this goal for a new high-performance flash file system, called BilbyFs. BilbyFs is carefully designed to be highly modular, so it can be verified against a high-level functional specification one component at a time. This modular implementation is captured in a set of domain specific languages from which we produce the design-level specification, as well as its optimised C implementation. Importantly, we also automatically generate the proof linking these two artefacts. The combination of these features dramatically reduces verification effort. Verified file systems are now within reach for the first time.
Original language | English |
---|---|
Title of host publication | Proceedings of the 7th Workshop on Programming Languages and Operating Systems, PLOS 2013 - In Conjunction with the 24th ACM Symposium on Operating Systems Principles, SOSP 2013 |
Publisher | Association for Computing Machinery |
ISBN (Print) | 9781450324601 |
DOIs | |
Publication status | Published - 1 Jan 2013 |
Externally published | Yes |
Event | 7th Workshop on Programming Languages and Operating Systems, PLOS 2013 - In Conjunction with the 24th ACM Symposium on Operating Systems Principles, SOSP 2013 - Farmington, PA, United States Duration: 3 Nov 2013 → 3 Nov 2013 |
Conference
Conference | 7th Workshop on Programming Languages and Operating Systems, PLOS 2013 - In Conjunction with the 24th ACM Symposium on Operating Systems Principles, SOSP 2013 |
---|---|
Country/Territory | United States |
City | Farmington, PA |
Period | 3/11/13 → 3/11/13 |