Generating a family of Byzantine tolerant protocol implementations using a meta-model architecture
Abstract
We describe an approach to modelling a Byzantine tolerant distributed algorithm as a family of related finite state machines, generated from a single meta-model. Various artefacts are generated from each state machine, including diagrams and source-level protocol implementations. The approach allows a state machine formulation to be applied to problems for which it would not otherwise be suitable, increasing confidence in correctness.
Citation
Kirby , G , Dearle , A & Norcross , S 2007 , Generating a family of Byzantine tolerant protocol implementations using a meta-model architecture . in 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Workshop on Architecting Dependable Systems : DSN 2007 . University of Edinburgh , pp. 178-183 , 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Workshop on Architecting Dependable Systems , Edinburgh , United Kingdom , 25/06/07 . conference
Publication
37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Workshop on Architecting Dependable Systems
Type
Conference item
Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.