Concurrent Models of Flash Memory Device Behaviour

Butterfield, Andrew; Catháin, Art Ó

doi:10.1007/978-3-642-10452-7_6

Cited by 8 publications

(4 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Z/Eves Theorem Prover has been used for describing the state model 2 http://czt.sourceforge.net/manual.html and initialisation operation of NAND flash memory. Papers [5,3] are about modelling the flash memory behaviour using CSP. In these works, Open NAND Flash Interface (ONFi) specifications are modelled.…”

Section: Verification Of Flash Memory Behaviourmentioning

confidence: 99%

Linking a state-rich process algebra to a state-free algebra to verify software/hardware implementation

Beg

Butterfield

2010

Proceedings of the 8th International Conference on Frontiers of Information Technology

Self Cite

View full text Add to dashboard Cite

Following the development of formalisms based on data and behavioural aspects of the system, there are number of attempts in which these two formalisms are mixed together to get benefit of both paradigms. 'Circus' being a living specification language with continuous collaboration from both academia and industry, is a combination of Z, CSP and the refinement calculus. To make use of the available and industry-proven tools for a particular programming paradigm, there is a need to develop a formally verified link between the one world and the other. The aim of this work is to develop a formally verified link between a state-rich process algebra i.e. 'Circus' to a state-free process algebra i.e. CSP. To achieve the research goal, the most suitable available tools are to identify. For developing link between targeted formal languages, we will identify the key translations required between the two languages. For ensuring correctness of the translation, we will formalise the key translation / refinement steps. These will form the theoretical core of the work and support the soundness of the link. In the end, we will select and verify a case study from the collection of software / hardware protocols.

show abstract

Section: Verification Of Flash Memory Behaviourmentioning

confidence: 99%

Linking a state-rich process algebra to a state-free algebra to verify software/hardware implementation

Beg

Butterfield

2010

Proceedings of the 8th International Conference on Frontiers of Information Technology

Self Cite

View full text Add to dashboard Cite

show abstract

“…Then, since R Á R id holds (5), the maximal solution of (45) is X :¼ R. all relevant in the sequel. For instance, thanks to (48), the shrinking combinator "simplifies" index F lash in (41) via relation (40). However, to ensure (40) antisymmetric, simple Jrnl also needs to be injective so as to prevent address duplication:…”

Section: The + (Shrinking) Combinatormentioning

confidence: 99%

“…On a more model-driven approach, Butterfield and Catháin [40] tackle the problem in a bottom up fashion by modeling and verifying FLASH memory devices based on the Open NAND Flash Interface (ONFi) specification. Their work builds from memory layout models in Z [41] to more advanced models in CSP [40] that already take into account the interleaving of concurrent low-level operations.…”

Section: Other Approaches To the Vfs Challengementioning

confidence: 99%

Alloy Meets the Algebra of Programming: A Case Study

Oliveira

Ferreira

2013

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Relational algebra offers to software engineering the same degree of conciseness and calculational power as linear algebra in other engineering disciplines. Binary relations play the role of matrices with similar emphasis on multiplication and transposition. This matches with Alloy's lemma "everything is a relation" and with the relational basis of the Algebra of Programming (AoP). Altogether, it provides a simple and coherent approach to checking and calculating programs from abstract models. In this paper, we put Alloy and the Algebra of Programming together in a case study originating from the Verifiable File System mini-challenge put forward by Joshi and Holzmann: verifying the refinement of an abstract file store model into a journaled (FLASH) data model catering to wear leveling and recovery from power loss. Our approach relies on diagrams to graphically express typed assertions. It interweaves model checking (in Alloy) with calculational proofs in a way which offers the best of both worlds. This provides ample evidence of the positive impact in software verification of Alloy's focus on relations, complemented by induction-free proofs about data structures such as stores and lists. Index Terms-Model checking, algebra of programming, software verification, grand challenges in computing Ç 1I NTRODUCTION T HIS paper is concerned with a major topic in software engineering: that of designing correct programs in the first place. Let us begin by inquiring into the phrase software engineering itself. The terminology seems to date from the Garmisch NATO conference in 1968, from whose report [1] the following excerpt is quoted: In late 1967, the Study Group recommended the holding of a working conference on Software Engineering. The phrase "software engineering" was deliberately chosen as being provocative, in implying the need for software manufacture to be based on the types of theoretical foundations and practical disciplines, that are traditional in the established branches of engineering.

show abstract

“…A model in the process algebra CSP which covers concurrent aspects of flash memory is described in [BC09]. The authors focused on developing a low-level model covering the internal behaviour of Open NAND flash devices.…”

Section: Verification Of File System Implementationsmentioning

confidence: 99%

Verifying compiled file system code

Mühlberg

Lüttgen

2012

Form. Asp. Comput.

View full text Add to dashboard Cite

This article presents a case study on retrospective verification of the Linux Virtual File System (VFS), which is aimed at checking violations of API usage rules and memory properties. Since VFS maintains dynamic data structures and is written in a mixture of C and inlined assembly, modern software model checkers cannot be applied. Our case study centres around our novel automated software verification tool, the SOCA Verifier, which symbolically executes and analyses compiled code. We describe how this verifier deals with complex features such as memory access, pointer aliasing and computed jumps in the VFS implementation, while reducing manual modelling to a minimum. Our results show that the SOCA Verifier is capable of analysing the complex Linux VFS implementation reliably and efficiently, thereby going beyond traditional testing tools and into niches that current software model checkers do not reach. This testifies to the SOCA Verifier's suitability as an effective and efficient bug-finding tool during the development of operating system components.

show abstract

Concurrent Models of Flash Memory Device Behaviour

Cited by 8 publications

References 20 publications

Linking a state-rich process algebra to a state-free algebra to verify software/hardware implementation

Linking a state-rich process algebra to a state-free algebra to verify software/hardware implementation

Alloy Meets the Algebra of Programming: A Case Study

Verifying compiled file system code

Contact Info

Product

Resources

About