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

  • Kriangsak Damchoom
  • Michael Butler
  • Jean-Raymond Abrial
Conference paper

DOI: 10.1007/978-3-540-88194-0_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5256)
Cite this paper as:
Damchoom K., Butler M., Abrial JR. (2008) Modelling and Proof of a Tree-Structured File System in Event-B and Rodin. In: Liu S., Maibaum T., Araki K. (eds) Formal Methods and Software Engineering. ICFEM 2008. Lecture Notes in Computer Science, vol 5256. Springer, Berlin, Heidelberg

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.

Keywords

File system Tree structure Refinement Proof Event-B Rodin tool 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Kriangsak Damchoom
    • 1
  • Michael Butler
    • 1
  • Jean-Raymond Abrial
    • 2
  1. 1.University of SouthamptonUnited Kingdom
  2. 2.ETH ZurichSwitzerland

Personalised recommendations