Structured event-b models and proofs

  • Authors:
  • Stefan Hallerstede

  • Affiliations:
  • University of Düsseldorf, Germany

  • Venue:
  • ABZ'10 Proceedings of the Second international conference on Abstract State Machines, Alloy, B and Z
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Event-B does not provide specific support for the modelling of problems that require some structuring, such as, local variables or sequential ordering of events. All variables need to be declared globally and sequential ordering of events can only be achieved by abstract program counters. This has two unfortunate consequences: such models become less comprehensible — we have to infer sequential ordering from the use of program counters; proof obligation generation does not consider ordering — generating too many proof obligations (although these are usually trivially discharged). In this article we propose a method for specifying structured models avoiding, in particular, the use of abstract program counters. It uses a notation that mainly serves to drive proof obligation generation. However, the notation also describes the structure of a model explicitly. A corresponding graphical notation is introduced that visualises the structure of a model.