A mini challenge: build a verifiable filesystem
Formal Aspects of Computing2007Vol. 19(2), pp. 269–272
Citations Over TimeTop 10% of 2007 papers
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.
Related Papers
- → Critical survey of existing publicly verifiable secret sharing schemes(2012)9 cited
- Non-Interactive and Information-Theoretic Secure Publicly Verifiable Secret Sharing.(2004)
- → Security analysis and improvement of two verifiable multi-secret sharing schemes(2013)
- Development and Status of Research on Verifiable Secret Sharing(2008)
- Publicly Verifiable Secret Sharing Scheme(2007)