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

10/10/2018
by   Mihir Parang Mehta, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/23/2018

A general formal memory framework in Coq for verifying the properties of programs based on higher-order logic theorem proving with increased

In recent years, a number of lightweight programs have been deployed in ...
research
11/15/2019

Smarter Features, Simpler Learning?

Earlier work on machine learning for automated reasoning mostly relied o...
research
07/01/2021

Verifying Verified Code

A recent case study from AWS by Chong et al. proposes an effective metho...
research
12/28/2017

Object-Oriented Theorem Proving (OOTP): First Thoughts

Automatic (i.e., computer-assisted) theorem proving (ATP) can come in ma...
research
02/10/2022

Vehicle: Interfacing Neural Network Verifiers with Interactive Theorem Provers

Verification of neural networks is currently a hot topic in automated th...
research
05/10/2023

Building Interoperable Electronic Health Records as Purpose-Driven Knowledge Graphs

When building a new application we are increasingly confronted with the ...

Please sign up or login with your details

Forgot password? Click here to reset