Show simple item record

On Verifying a File System Implementation

dc.date.accessioned2005-12-22T01:30:49Z
dc.date.accessioned2018-11-24T10:24:08Z
dc.date.available2005-12-22T01:30:49Z
dc.date.available2018-11-24T10:24:08Z
dc.date.issued2004-05-06
dc.identifier.urihttp://hdl.handle.net/1721.1/30468
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/30468
dc.description.abstractWe present a correctness proof for a basic file system implementation. This implementation contains key elements of standard Unix file systems such as inodes and fixed-size disk blocks. We prove the implementation correct by establishing a simulation relation between the specification of the file system (which models the file system as an abstract map from file names to sequences of bytes) and its implementation (which uses fixed-size disk blocks to store the contents of the files).We used the Athena proof checker to represent and validate our proof. Our experience indicates that Athena's use of block-structured natural deduction, support for structural induction and proof abstraction, and seamless connection with high-performance automated theorem provers were essential to our ability to successfully manage a proof of this size.
dc.format.extent31 p.
dc.format.extent26287249 bytes
dc.format.extent1119970 bytes
dc.language.isoen_US
dc.titleOn Verifying a File System Implementation


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2004-028.pdf1.119Mbapplication/pdfView/Open
MIT-CSAIL-TR-2004-028.ps26.28Mbapplication/postscriptView/Open

This item appears in the following Collection(s)

Show simple item record