Difference between pages "Event-B Examples" and "Rodin Workshop 2010"

From Event-B
(Difference between pages)
Jump to navigationJump to search
imported>Steve
 
imported>WikiSysop
 
Line 1: Line 1:
{{TOCright}}
+
= Rodin User and Developer Workshop, University of Duesseldorf, 20-22 September 2010 =
This page is for listing available example Event-B/Rodin projects.
 
  
  
== Year 2009 ==
 
  
=== [http://deploy-eprints.ecs.soton.ac.uk/017/ Real-time controller for a water tank]===  
+
==Monday 20th September==
By Michael Butler.
+
09h00 - 16h00 Rodin tutorial (by Systerel)
  
The draft paper outlines an approach to treating continuous behaviour in Event-B by a discrete approximation.
+
==Tuesday 21st September (Workshop Day 1)==
An example of a water tank system is used to illustrate the proposed approach. The archive containts the
+
* 09h00 - 10h30 Atomicity Decomposition a Technique for Structuring Refinement in Event-B, Asieh Salehi Fathabadi, Michael Butler
Event-B development for the water tank system.
+
* 09h30 - 10h00 Integrating astd in the Rodin platform, Paul Amar, Marc Frappier, Cecile Lartaud, and Jeremy Milhau
 +
* 10h00 - 10h30 Potpourri of what? One year in a DA's life, Aryldo G. Russo Jr., Thiago C. de Sousa, Haniel Barbosa, Paulo Muniz, and David Deharbe
 +
* 10h30 - 11h00 Coffee break
 +
* 11h00 - 11h30 The ProR Requirements Engineering Platform, Michael Jastram
 +
* 11h30 - 12h00 A Refinement Planning Sheet, Shin Nakajima
 +
* 12h00 - 12h30 Refinement Plans for Reasoned Modelling, Maria Teresa Llano, Andrew Ireland, and Gudmund Grov
 +
* 12h30 - 14h00 Lunch break and tool demos
 +
* 14h00 - 15h00 Invited Talk, Jean-Raymond Abrial
 +
* 15h00 - 15h30 Reflections on the teaching of System Modelling and Design, Ken Robinson
 +
* 15h30 - 16h00 Coffee break
 +
* 16h00 - 16h30 Verification of a Byzantine Agreement Protocol using Event-B, Roman Krenicky and Mattias Ulbrich
 +
* 16h30 - 17h00 Code Generation with the Event-B Tasking Extension (Tool Development), Andy Edmunds
 +
* 17h00 - 17h30 Modelling Recursion in Event-B, Stefan Hallerstede
  
=== [http://deploy-eprints.ecs.soton.ac.uk/95/ UML-B Development of an ATM]===
+
==Wednesday 22nd September (Workshop Day 2)==
By Mar Yah Said, Michael Butler and Colin Snook.
+
* 09h00 - 09h30 Using automated theory formation to discover invariants of Event-B models, Maria Teresa Llano, Andrew Ireland, Alison Pease, Simon Colton, John Charnley
 +
* 09h30 - 10h00 Specifying and Solving Constraint Satisfaction Problems in B, Michael Leuschel and Daniel Plagge
 +
* 10h00 - 10h30 Fault Tolerance View in Event-B Development, Ilya Lopatkin, Alexei Iliasov, Alexander Romanovsky
 +
* 10h30 - 11h00 Coffee break
 +
* 11h00 - 11h30 Event-B models of P systems, Florentin Ipate, Turcanu Adrian
 +
* 11h30 - 11h45 Records, Vitaly Savicks, Colin Snook, Michael Butler
 +
* 11h45 - 12h00 Decomposition Tool: Development and Usage, Renato Silva, Carine Pascal, T.S. Hoang, and Michael Butler
 +
* 12h00 - 12h15 Sequence Refinement, Modularisation Plugin, Alexei Iliasov
 +
* 12h15 - 12h30 Modelling Views Paradigm Support for Rodin, Alexei Iliasov
 +
* 12h30 - 14h00 Lunch break and tool demos
 +
* 14h00 - 15h00 Invited Talk, Joe Kiniry
 +
* 15h00 - 15h30 A small experiment in Event-B rippling, Gudmund Grov, Alan Bundy & Lucas Dixon
 +
* 15h30 - 16h00 Coffee break
 +
* 16h00 - 16h30 Animation of UML-B State-machines, Vitaly Savicks, Colin Snook, Michael Butler
 +
* 16h30 - 17h00 Addressing Extensibility Issues in Rodin and Event-B, Issam Maamria and Michael Butler
  
This paper outlines support for refinement of classes and statemachines in UML-B and issustrates these
+
===Registration===
with an Automated Teller Machine (ATM) example.  The ATM development is contained in a Rodin
+
[http://www.formal-methods.de/avocs10/registration.html Registration page]
archive.  It consists of an abstract model focusing on bank account updates.  The ATM, pin cards and
 
messaging between ATMs and a bank server are introduced in successive refinements.
 
 
 
=== [http://deploy-eprints.ecs.soton.ac.uk/84/ MIDAS: A Formally Constructed Virtual Machine]===  
 
By [[Steve]].
 
 
 
MIDAS (Microprocessor Instruction and Data Abstraction System) is a specification of an Instruction Set Architecture (ISA). It is refined to a usable Virtual Machine (VM) capable of executing binary images compiled from the C language. It was developed to demonstrate a methodology for formal construction of various ISAs in Event-B via a generic model. There are two variants: a stack-based machine and a randomly accessible register array machine. The two variants employ the same instruction codes, the differences being limited to register file behavior.
 
 
 
The archive supplied at the Deploy repository contains: C-coded prototypes of the MIDAS VMs, an Event-B model refinement constructing the same VMs, the B2C Event-B to C auto-generation tool, C compiler/assembler/linkers for the VMs, an example C test suite, and execution environments for running compiled C on the machines.
 
 
 
=== [http://deploy-eprints.ecs.soton.ac.uk/82/ Development of a Network Topology Discovery Algorithm]===
 
By ''Hoang, Thai Son and Basin, David and Kuruma, Hironobu and Abrial, Jean-Raymond''.
 
 
 
This paper and this Rodin development is another version of the [[#Link State Routing Development|Link State Routing Development]] presented in 2008.
 
 
 
== Year 2008 ==
 
=== [http://deploy-eprints.ecs.soton.ac.uk/31/ Link State Routing Development]===
 
By ''Hoang, Thai Son and Basin, David and Kuruma, Hironobu and Abrial, Jean-Raymond''.
 
 
 
We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core several routing algorithms and is the problem of each node in a network discovering and maintaining information on the network topology. One of the key challenges in developing this algorithm is specifying the problem itself.We provide a specification that includes both safety properties, formalizing invariants that should hold in all system states, and liveness properties that characterize when the system reaches stable states. We specify these by appropriately combining invariants, event refinement, and proofs of event convergence and deadlock freedom. The combination of these features is novel and should be useful for formalizing and developing other kinds of semi-reactive systems, which are systems that react to, but do not modify, their environment.
 
 
 
=== [http://deploy-eprints.ecs.soton.ac.uk/22/ Modelling and proof of a Tree-structured File System] ===
 
By ''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.
 
 
 
=== [http://deploy-eprints.ecs.soton.ac.uk/56/ Deliverable D8 D10.1 "Teaching Materials"] ===
 
By ''Abrial, Jean-Raymond and Hoang, Thai Son and Schmalz, Matthias''.
 
 
 
==Year 2007==
 
=== [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.
 
 
 
[[Category:Examples]]
 

Revision as of 15:13, 10 September 2010

Rodin User and Developer Workshop, University of Duesseldorf, 20-22 September 2010

Monday 20th September

09h00 - 16h00 Rodin tutorial (by Systerel)

Tuesday 21st September (Workshop Day 1)

  • 09h00 - 10h30 Atomicity Decomposition a Technique for Structuring Refinement in Event-B, Asieh Salehi Fathabadi, Michael Butler
  • 09h30 - 10h00 Integrating astd in the Rodin platform, Paul Amar, Marc Frappier, Cecile Lartaud, and Jeremy Milhau
  • 10h00 - 10h30 Potpourri of what? One year in a DA's life, Aryldo G. Russo Jr., Thiago C. de Sousa, Haniel Barbosa, Paulo Muniz, and David Deharbe
  • 10h30 - 11h00 Coffee break
  • 11h00 - 11h30 The ProR Requirements Engineering Platform, Michael Jastram
  • 11h30 - 12h00 A Refinement Planning Sheet, Shin Nakajima
  • 12h00 - 12h30 Refinement Plans for Reasoned Modelling, Maria Teresa Llano, Andrew Ireland, and Gudmund Grov
  • 12h30 - 14h00 Lunch break and tool demos
  • 14h00 - 15h00 Invited Talk, Jean-Raymond Abrial
  • 15h00 - 15h30 Reflections on the teaching of System Modelling and Design, Ken Robinson
  • 15h30 - 16h00 Coffee break
  • 16h00 - 16h30 Verification of a Byzantine Agreement Protocol using Event-B, Roman Krenicky and Mattias Ulbrich
  • 16h30 - 17h00 Code Generation with the Event-B Tasking Extension (Tool Development), Andy Edmunds
  • 17h00 - 17h30 Modelling Recursion in Event-B, Stefan Hallerstede

Wednesday 22nd September (Workshop Day 2)

  • 09h00 - 09h30 Using automated theory formation to discover invariants of Event-B models, Maria Teresa Llano, Andrew Ireland, Alison Pease, Simon Colton, John Charnley
  • 09h30 - 10h00 Specifying and Solving Constraint Satisfaction Problems in B, Michael Leuschel and Daniel Plagge
  • 10h00 - 10h30 Fault Tolerance View in Event-B Development, Ilya Lopatkin, Alexei Iliasov, Alexander Romanovsky
  • 10h30 - 11h00 Coffee break
  • 11h00 - 11h30 Event-B models of P systems, Florentin Ipate, Turcanu Adrian
  • 11h30 - 11h45 Records, Vitaly Savicks, Colin Snook, Michael Butler
  • 11h45 - 12h00 Decomposition Tool: Development and Usage, Renato Silva, Carine Pascal, T.S. Hoang, and Michael Butler
  • 12h00 - 12h15 Sequence Refinement, Modularisation Plugin, Alexei Iliasov
  • 12h15 - 12h30 Modelling Views Paradigm Support for Rodin, Alexei Iliasov
  • 12h30 - 14h00 Lunch break and tool demos
  • 14h00 - 15h00 Invited Talk, Joe Kiniry
  • 15h00 - 15h30 A small experiment in Event-B rippling, Gudmund Grov, Alan Bundy & Lucas Dixon
  • 15h30 - 16h00 Coffee break
  • 16h00 - 16h30 Animation of UML-B State-machines, Vitaly Savicks, Colin Snook, Michael Butler
  • 16h30 - 17h00 Addressing Extensibility Issues in Rodin and Event-B, Issam Maamria and Michael Butler

Registration

Registration page