Generating a family of Byzantine tolerant protocol implementations using a meta-model architecture

Graham Kirby; Alan Dearle; Stuart Norcross

Generating a family of Byzantine tolerant protocol implementations using a meta-model architecture

Graham Kirby, Alan Dearle, Stuart Norcross

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English
Title of host publication	37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Workshop on Architecting Dependable Systems
Subtitle of host publication	DSN 2007
Publisher	University of Edinburgh
Pages	178-183
Publication status	Published - 25 Jun 2007
Event	37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Workshop on Architecting Dependable Systems - Edinburgh, United Kingdom Duration: 25 Jun 2007 → …

Conference

Conference	37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Workshop on Architecting Dependable Systems
Country/Territory	United Kingdom
City	Edinburgh
Period	25/06/07 → …

Keywords

cs.DC
Distributed, parallel and cluster computing

Access to Document

Open Access version in Research@StAndrews:FullTextSubmitted manuscript, 602 KB

Cite this

@inproceedings{bf38d07ee83940309e451fafb17a928b,

title = "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.",

keywords = "cs.DC, Distributed, parallel and cluster computing",

author = "Graham Kirby and Alan Dearle and Stuart Norcross",

year = "2007",

month = jun,

day = "25",

language = "English",

pages = "178--183",

booktitle = "37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Workshop on Architecting Dependable Systems",

publisher = "University of Edinburgh",

address = "United Kingdom",

note = "37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Workshop on Architecting Dependable Systems ; Conference date: 25-06-2007",

}

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.

Generating a family of Byzantine tolerant protocol implementations using a meta-model architecture. / Kirby, Graham ; Dearle, Alan ; Norcross, Stuart.
37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Workshop on Architecting Dependable Systems: DSN 2007. University of Edinburgh, 2007. p. 178-183.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Generating a family of Byzantine tolerant protocol implementations using a meta-model architecture

AU - Kirby, Graham

AU - Dearle, Alan

AU - Norcross, Stuart

PY - 2007/6/25

Y1 - 2007/6/25

N2 - 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.

AB - 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.

KW - cs.DC

KW - Distributed, parallel and cluster computing

UR - http://2007.dsn.org/

UR - http://arxiv.org/abs/1006.3452

M3 - Conference contribution

SP - 178

EP - 183

BT - 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Workshop on Architecting Dependable Systems

PB - University of Edinburgh

T2 - 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, Workshop on Architecting Dependable Systems

Y2 - 25 June 2007

ER -

Generating a family of Byzantine tolerant protocol implementations using a meta-model architecture

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

RSE SCOT EXEC FELLOWSHIP: Fellowship- Self-Managed Reliable Location-Independent Distributed Storage.

Cite this

Generating a family of Byzantine tolerant protocol implementations using a meta-model architecture

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Projects

RSE SCOT EXEC FELLOWSHIP: Fellowship- Self-Managed Reliable Location-Independent Distributed Storage.

Cite this