Formalising Flash Memory: First Steps

Butterfield, Andrew; Woodcock, Jim

doi:10.1109/iceccs.2007.23

Cited by 24 publications

(18 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Modelling the communication between host and target was straightforward as this is well documented as the external interface of ONFi devices, and had already been modelled in Z at an abstract level [BW07,BFW09]. In CSP M we used events with names of the form ht_XXXX to model these communications, which basically consisted of the byte-level transfers of commands, addresses, data and the single-bit signals (e.g.…”

Section: The Csp Modelmentioning

confidence: 99%

“…This was built on top of a simple flash model (at roughly the same level of abstraction as [BW07]). and implements wear-leveling and block mapping, so covering the "soft" parts of the FTL.…”

Section: Related Workmentioning

confidence: 99%

“…Of particular interest are filestores based on the relatively recent NAND Flash Memory technology, now very popular in portable datastorage devices such as MP3 players and datakeys. This paper follows on from initial formal models of NAND Flash Memory, reported in [BW07,BFW09] based on the specification published by the "Open NAND Flash Interface (ONFi)" consortium [H + 06]. That work looked at a formal model of flash memory in terms of its internal data storage architecture, and the top-level operations that manipulate that storage.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Concurrent Models of Flash Memory Device Behaviour

Butterfield

Catháin

2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. We present a CSP model of the internal behaviour of Flash Memory, based on its specification by the Open Nand-Flash Interface (ONFi) consortium. This contributes directly to the low-level modelling of the data-storage technology that is the target of the POSIX filestore mini-challenge. The key objective was to ensure that the internal behaviour was well-specified, and that it was consistent with the specification of the external interface of such devices. The FDR toolkit was used to perform the revelent refinement/model-checking. In addition to uncovering errors and possible sources of misinterpretation in the ONFi standard, this work also describes a methodology for model data-entry based on a "state-chart" dialect of XML (SCXML) using XSLT to translate into CSP, and HTML, to support validation.

show abstract

Section: The Csp Modelmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Concurrent Models of Flash Memory Device Behaviour

Butterfield

Catháin

2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…Since the filestore challenge was proposed by Joshi and Holzmann [13] in 2005, other researchers have addressed this challenge. For example, Butterfield and Woodcook [7] have developed an abstract specification in Z of the ONFi specification [16]. In addition, Ferreira et al [9] have developed and verified a specification of the Intel Flash File System Core [17] in VDM.…”

Section: Comparison With Related Workmentioning

confidence: 99%

Modelling and Proof of a Tree-Structured File System in Event-B and Rodin

Damchoom

Butler

Abrial

2008

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. Event-B is a formalism used for specifying and reasoning about complex discrete systems. The Rodin platform is a new tool for specification, refinement and proof in Event-B. In this paper, we present a verified model of a tree-structured file system which was carried out using Event-B and the Rodin platform. The model is focused on basic functionalities affecting the tree structure including create, copy, delete and move. This work is aimed at constructing a clear and accurate model with all proof obligations discharged. While constructing the model of a file system, we begin with an abstract model of a file system and subsequently refine it by adding more details through refinement steps. We have found that careful formulation of invariants and useful theorems that can be reused for discharging similar proof obligations make models simpler and easier to prove.

show abstract

“…In response to the challenge, Woodcock reports on the partial specification of the file system (the 'file store') and a refinement proof mapping the store to a Java program [14]. Simultaneously, the Flash hardware is being formalized [15]. Verifying a low-level Flash driver and integrating it into the filesystem proofs are future work.…”

Section: Introductionmentioning

confidence: 99%

Formal Functional Verification of Device Drivers

Alkassar

Hillebrand

Verified Software: Theories, Tools, Experiments

View full text Add to dashboard Cite

Abstract. We report on the formal functional verification of a simple device driver for an ATAPI hard disk in Isabelle/HOL. The proof is based on a functional model of the hard disk, which has been integrated into the instruction set architecture of a verified RISC processor as one of several memory-mapped devices. The result is an interleaved computational model, in which the devices and the processor take turns in execution. Even in this concurrent context, the verification can be kept largely sequential and modular with respect to the other devices. This is made possible by sound reordering of computation traces, given that devices do not interfere with each other and the driver monopolizes the hard disk. To the best of our knowledge, this paper presents the first formal functional verification of a device driver against a realistic device and system model.

show abstract

Formalising Flash Memory: First Steps

Cited by 24 publications

References 10 publications

Concurrent Models of Flash Memory Device Behaviour

Concurrent Models of Flash Memory Device Behaviour

Modelling and Proof of a Tree-Structured File System in Event-B and Rodin

Formal Functional Verification of Device Drivers

Contact Info

Product

Resources

About