Byzantizing paxos by refinement

Authors:
Leslie Lamport
Affiliations:
Microsoft Research
Venue:
DISC'11 Proceedings of the 25th international conference on Distributed computing
Year:
2011

Citing 9
Cited 2

The existence of refinement mappings

Theoretical Computer Science
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
The part-time parliament

ACM Transactions on Computer Systems (TOCS)
The ABCD's of Paxos

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Practical byzantine fault tolerance and proactive recovery

ACM Transactions on Computer Systems (TOCS)
VIEWSTAMPED REPLICATION FOR HIGHLY AVAILABLE DISTRIBUTED SYSTEMS

VIEWSTAMPED REPLICATION FOR HIGHLY AVAILABLE DISTRIBUTED SYSTEMS
Fast Byzantine Consensus

DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Vertical paxos and primary-backup replication

Proceedings of the 28th ACM symposium on Principles of distributed computing
The PlusCal Algorithm Language

ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing

High-Level executable specifications of distributed algorithms

SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Brief announcement: parameterized model checking of fault-tolerant distributed algorithms by abstraction

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derive a 3f +1 process Byzantine Paxos consensus algorithm by Byzantizing a variant of the ordinary Paxos algorithm--that is, by having 2f+1 nonfaulty processes emulate the ordinary Paxos algorithm despite the presence of f malicious processes. We have written a formal, machine-checked proof that the Byzantized algorithm implements the ordinary Paxos consensus algorithm under a suitable refinement mapping.