Byzantizing Paxos by Refinement

DOI10.1007/978-3-642-24100-0_22zbMath1350.68281OpenAlexW87932605MaRDI QIDQ3095328

Leslie Lamport

Publication date: 28 October 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-24100-0_22

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (4)

Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker ⋮ Generalized Paxos made Byzantine (and less complex) ⋮ Tasks in modular proofs of concurrent algorithms ⋮ Analysis of the Blockchain Protocol in Asynchronous Networks

Uses Software

• PlusCal

Cites Work

• The existence of refinement mappings
• Refined quorum systems
• Fast Paxos
• The PlusCal Algorithm Language
• Impossibility of distributed consensus with one faulty process
• Unnamed Item

This page was built for publication: Byzantizing Paxos by Refinement