1. W. Bevier and W. Young, “Machine checked proofs of a Byzantine agreement algorithm,” Tech. Rep. 62, Computational Logic, Inc., June 1990.
2. M. Pease, R. Shostak, and L. Lamport, “Reaching agreement in the presence of faults,” JACM, vol. 27, pp. 228–234, April 1980.
3. L. Lamport, R. Shostak, and M. Pease, “The Byzantine generals problem,” ACM TOPLAS, vol. 4, pp. 382–401, July 1982.
4. R. Boyer and J. Moore, A Computational Logic. New York: Academic Press, 1979.
5. R. Boyer and J. Moore, A Computational Logic Handbook. Boston: Academic Press, 1988.