Formalising Filesystems in the ACL2 Theorem Prover: an Application to FAT32

Mihir Parang Mehta
(UT Austin)

In this work, we present an approach towards constructing executable specifications of existing filesystems and verifying their functional properties in a theorem proving environment. We detail an application of this approach to the FAT32 filesystem.

We also detail the methodology used to build up this type of executable specification through a series of models which incrementally add features of the target filesystem. This methodology has the benefit of allowing the verification effort to start from simple models which encapsulate features common to many filesystems and which are thus suitable for reuse.

In Shilpi Goel and Matt Kaufmann: Proceedings of the 15th International Workshop on the ACL2 Theorem Prover and Its Applications (ACL2 2018), Austin, Texas, USA, November 5-6, 2018, Electronic Proceedings in Theoretical Computer Science 280, pp. 18–29.
Published: 29th October 2018.

ArXived at: http://dx.doi.org/10.4204/EPTCS.280.2 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org