|
Research@StAndrews:FullText >
University of St Andrews Research >
University of St Andrews Research >
University of St Andrews Research >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10023/1725
| Title: | Generating a family of Byzantine tolerant protocol implementations using a meta-model architecture |
| Authors: | Kirby, Graham
Dearle, Alan
Norcross, Stuart |
| Keywords: | cs.DC
Distributed, parallel and cluster computing
QA76 Computer software |
| Issue Date: | 25-Jun-2007 |
| 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 June .
conference |
| 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. |
| Version: | Preprint |
| URI: | http://hdl.handle.net/10023/1725
http://2007.dsn.org/
http://arxiv.org/abs/1006.3452 |
| Type: | Conference item |
| Publisher: | University of Edinburgh |
| Appears in Collections: | University of St Andrews Research
Computer Science Research
|
This item is protected by original copyright
|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
|
