Event-B Examples: Difference between revisions
imported>WikiSysop No edit summary |
imported>Mathieu m Category:Examples + better organization |
||
| Line 1: | Line 1: | ||
{{TOCright}} | |||
This page is for listing available example Event-B/Rodin projects. | This page is for listing available example Event-B/Rodin projects. | ||
== Year 2009 == | |||
== Year 2008 == | |||
=== [http://deploy-eprints.ecs.soton.ac.uk/31/ Link State Routing Development]=== | |||
From ''Hoang, Thai Son and Basin, David and Kuruma, Hironobu and Abrial, Jean-Raymond''. | |||
=== [http://deploy-eprints.ecs.soton.ac.uk/9/ Redevelopment of an Industrial Case Study Using Event-B and Rodin]=== | |||
From ''Rezazadeh, Abdolbaghi and Butler, Michael and Evans, Neil''. | |||
CDIS is a commercial air traffic information system that was developed using formal methods 15 years ago by Praxis, and it is still in operation today. This system is an example of an industrial scale system that has been developed using formal methods. In particular, the functional requirements of the system were specified using VVSL -- a variant of VDM. A subset of the original specification has been chosen to be reconstructed on the Rodin platform based on the new Event-B formalism. The goal of our reconstruction was to overcome three key difficulties of the original formalisation, namely the difficulty of comprehending the original specification, the lack of any mechanical proof of the consistency of the specification and the difficulty of dealing with distribution and atomicity refinement. In this paper we elucidate how a new formal notation and tool can help to overcome these difficulties. | |||
=== [http://deploy-eprints.ecs.soton.ac.uk/22/ Modelling and proof of a Tree-structured File System] === | |||
From ''Damchoom, Kriangsak and Butler, Michael and Abrial, Jean-Raymond''. | |||
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. | |||
[[Category:Examples]] | |||
Revision as of 10:13, 23 January 2009
This page is for listing available example Event-B/Rodin projects.
Year 2009
Year 2008
Link State Routing Development
From Hoang, Thai Son and Basin, David and Kuruma, Hironobu and Abrial, Jean-Raymond.
Redevelopment of an Industrial Case Study Using Event-B and Rodin
From Rezazadeh, Abdolbaghi and Butler, Michael and Evans, Neil.
CDIS is a commercial air traffic information system that was developed using formal methods 15 years ago by Praxis, and it is still in operation today. This system is an example of an industrial scale system that has been developed using formal methods. In particular, the functional requirements of the system were specified using VVSL -- a variant of VDM. A subset of the original specification has been chosen to be reconstructed on the Rodin platform based on the new Event-B formalism. The goal of our reconstruction was to overcome three key difficulties of the original formalisation, namely the difficulty of comprehending the original specification, the lack of any mechanical proof of the consistency of the specification and the difficulty of dealing with distribution and atomicity refinement. In this paper we elucidate how a new formal notation and tool can help to overcome these difficulties.
Modelling and proof of a Tree-structured File System
From Damchoom, Kriangsak and Butler, Michael and Abrial, Jean-Raymond.
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.
