Developing a Consensus Algorithm using Stepwise Refinement
- Lookup NU author(s)
- Dr Jeremy Bryans
|
|
|
|
| Author(s) | | Bryans JW |
| Publication type | | Report |
| Series Title | | School of Computing Science Technical Report Series |
| Year | | 2010 |
| Date | | December 2010 |
| Report Number | | 1228 |
| Pages | | 22 |
|
|
|
| Full text is not currently available for this publication. |
|
|
|
|
| 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. |
|
|
|
| Institution | | School of Computing Science, University of Newcastle upon Tyne |
| Place Published | | Newcastle upon Tyne |
| Actions | |  |
