title: Developing a Consensus Algorithm using Stepwise Refinement
creator: Bryans, Jeremy W.
subject: Refinement
subject: Event-B Examples
subject: Event-B Theory
description: We give a formal development and proof of a known consensus algorithm using stepwise refinement.  We begin with an abstract specification of the intended result of the algorithm.  The algorithm is developed and proved correct over a number of refinement steps.  The proof of correctness is performed concurrently with the development. The development and proof make use of key fault and failure assumptions. The stepwise refinement approach allows us to introduce and prove each property at the most appropriate stage in the development, before detail irrelevant to that property has been added to the model.  Finally we introduce an abstract model of a possible network on which  the algorithm could be executed.
publisher: Newcastle University
date: 2010-12
type: Other
type: NonPeerReviewed
format: application/pdf
identifier: http://deploy-eprints.ecs.soton.ac.uk/285/1/root.pdf
identifier:   Bryans, Jeremy W.  (2010) Developing a Consensus Algorithm using Stepwise Refinement.  Newcastle University.    (Unpublished)  
relation: http://deploy-eprints.ecs.soton.ac.uk/285/

<script src='//archive-bar.soton.ac.uk/archive-bar.js'></script>