A Mini Challenge: Build a Verifiable Filesystem

Authors:
Rajeev Joshi;Gerard J. Holzmann
Affiliations:
Laboratory for Reliable Software, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, USA CA 91109;Laboratory for Reliable Software, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, USA CA 91109
Venue:
Verified Software: Theories, Tools, Experiments
Year:
2005

Citing 2
Cited 0

The verifying compiler: A grand challenge for computing research

Journal of the ACM (JACM)
Using model checking to find serious file system errors

OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose tackling a "mini challenge" problem: a nontrivial verification effort that can be completed in 2-3 years, and will help establish notational standards, common formats, and libraries of benchmarks that will be essential in order for the verification community to collaborate on meeting Hoare's 15-year verification grand challenge. We believe that a suitable candidate for such a mini challenge is the development of a filesystem that is verifiablyreliable and secure. The paper argues why we believe a filesystem is the right candidate for a mini challenge and describes a project in which we are building a small embedded filesystem for use with flash memory.