DMCA
A Mini-Challenge: Build a Verifiable Filesystem
| Venue: | Formal Aspects of Computing |
| Citations: | 30 - 5 self |
BibTeX
@ARTICLE{Joshi_amini-challenge:,
author = {Rajeev Joshi and Gerard J. Holzmann},
title = {A Mini-Challenge: Build a Verifiable Filesystem},
journal = {Formal Aspects of Computing},
year = {},
volume = {19},
pages = {2007}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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. A mini challenge The verification grand challenge proposed by Hoare [1] sets the stage for the program verification community to embark upon a collaborative effort to build verifiable programs. At a recent workshop in Menlo Park [2], there seemed to be a consensus that a necessary stepping stone to such an effort would be the development of repositories for sharing specifications, models, implementations, and benchmarks so that different tools could be combined and compared. We believe that the best way of reaching agreement on common formats and forging the necessary collaborations to build such a repository is to embark upon a shorter-term “mini challenge”: a nontrivial verification project that can nonetheless be completed in a short time. An ideal candidate for such a mini challenge would have several characteristics: (a) it would be of sufficient complexity that traditional methods such as testing and code reviews are inadequate to establish its correctness, (b) it would be of sufficient simplicity that specification, design and verification could be completed by a dedicated team in a relatively short time, say 2-3 years, and (c) it would be of sufficient importance
Keyphrases
mini challenge verifiable filesystem short time common format verifiable program shorter-term mini challenge 15-year verification grand challenge small embedded filesystem collaborative effort necessary stepping stone ideal candidate verification community nontrivial verification effort necessary collaboration code review sufficient importance meeting hoare dedicated team verification grand challenge notational standard sufficient complexity different tool right candidate traditional method several characteristic menlo park flash memory program verification community recent workshop nontrivial verification project mini challenge problem sufficient simplicity suitable candidate
