Abstract

Consider a network of four processors that use the Oral Messages (Byzantine Generals) algorithm of Pease, Shostak and Lamport to achieve agreement in the presence of faults. Bevier and Young have published a functional description of a single processor that, when interconnected appropriately with three identical others, implements this network under the assumption that the four processors step in synchrony. By formalizing the original Pease, Shostak and Lamport work, Bevier and Young mechanically proved that such a network achieves fault tolerance. In this paper we develop, formalize and discuss a hardware design that has been mechanically proved to implement their processor. In particular, we formally define mapping functions from the abstract state space of the Bevier-Young processor to a concrete state space of a hardware module and state a theorem that expresses the claim that the hardware correctly implements the processor. We briefly discuss the Brock-Hunt Formal Hardware Descrip...

Citations

450	Reaching agreement in the presence of faults - Pease, Shostak, et al. - 1980
381	A Computational Logic Handbook - Boyer, Moore - 1988
172	The Verilog hardware description language - Thomas, Moorby - 1991
35	A formal model of asynchronous communication and its use in mechanically verifying a Biphase Mark Protocol - Moore - 1994
13	The proof of correctness of a fault-tolerant circuit design - Bevier, Young - 1991
12	Formal Verification of the Interactive Convergence Clock Synchronization Algorithm using EHDM - Rushby, Henke - 1989
3	A Formal Introduction to a Simple HDL - Brock, Hunt - 1990