Formal Aspects of Computing

, Volume 19, Issue 2, pp 269–272

A mini challenge: build a verifiable filesystem

Authors

    • Laboratory for Reliable Software, Jet Propulsion LaboratoryCalifornia Institute of Technology
  • Gerard J. Holzmann
    • Laboratory for Reliable Software, Jet Propulsion LaboratoryCalifornia Institute of Technology
Original Article

DOI: 10.1007/s00165-006-0022-3

Cite this article as:
Joshi, R. & Holzmann, G.J. Form Asp Comp (2007) 19: 269. doi:10.1007/s00165-006-0022-3

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 verifiably reliable 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.

Keywords

Verification grand challengeFilesystem designFormal verification

Copyright information

© British Computer Society 2007