Generating a Family of Byzantine Tolerant Protocol Implementations Using a Meta-Model Architecture
Graham Kirby, Alan Dearle, Stuart Norcross

TL;DR
This paper introduces a meta-model architecture for generating diverse Byzantine tolerant protocol implementations, enhancing flexibility and confidence in correctness through automated artefact generation from a unified model.
Contribution
It presents a novel meta-model approach that automates the creation of multiple Byzantine tolerant protocols from a single formal framework.
Findings
Automated generation of protocol artefacts from a meta-model.
Increased confidence in correctness of Byzantine tolerant protocols.
Applicability of state machine formulation to broader problems.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Security and Verification in Computing · Modular Robots and Swarm Intelligence
