Files in this item
Generating a family of Byzantine tolerant protocol implementations using a meta-model architecture
Item metadata
dc.contributor.author | Kirby, Graham | |
dc.contributor.author | Dearle, Alan | |
dc.contributor.author | Norcross, Stuart | |
dc.date.accessioned | 2011-03-30T15:01:02Z | |
dc.date.available | 2011-03-30T15:01:02Z | |
dc.date.issued | 2007-06-25 | |
dc.identifier | 5005152 | |
dc.identifier | bf38d07e-e839-4030-9e45-1fafb17a928b | |
dc.identifier.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 . | en |
dc.identifier.citation | conference | en |
dc.identifier.other | ArXiv: http://arxiv.org/abs/1006.3452v1 | |
dc.identifier.other | ORCID: /0000-0002-4422-0190/work/28429102 | |
dc.identifier.uri | https://hdl.handle.net/10023/1725 | |
dc.description.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. | |
dc.format.extent | 616248 | |
dc.language.iso | eng | |
dc.publisher | University of Edinburgh | |
dc.relation.ispartof | 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Workshop on Architecting Dependable Systems | en |
dc.subject | cs.DC | en |
dc.subject | Distributed, parallel and cluster computing | en |
dc.subject | QA76 Computer software | en |
dc.subject.lcc | QA76 | en |
dc.title | Generating a family of Byzantine tolerant protocol implementations using a meta-model architecture | en |
dc.type | Conference item | en |
dc.contributor.sponsor | The Royal Society of Edinburgh | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.identifier.url | http://2007.dsn.org/ | en |
dc.identifier.url | http://arxiv.org/abs/1006.3452 | en |
dc.identifier.grantnumber | RSE Scottish Executive Fellowship | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.