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. © IFIP International Federation for Information Processing 2008.
Cite
CITATION STYLE
Joshi, R., & Holzmann, G. J. (2008). A mini challenge: Build a verifiable filesystem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4171 LNCS, pp. 49–56). https://doi.org/10.1007/978-3-540-69149-5_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
