Schneider [Sch87] generalizes a number of protocols for Byzantine fault-tolerant clock synchronization and presents a uniform proof for their correctness. We present a mechanical verification of Schneider's protocol leading to several significant clarifications and revisions. The verification was carried out with the Ehdm system [RvHO91] developed at the SRI Computer Science Laboratory. The mechanically checked proofs include the verification that the egocentric mean function used in Lamport and Melliar-Smith's Interactive Convergence Algorithm [LMS85] satisfies the requirements of Schneider's protocol. Our mechanical verification raises a number of issues regarding the verification of fault-tolerant, distributed, real-time p...
Abstract. This paper gives two simple efficient distributed algorithms: one for keeping clocks in a ...
to appear in Electronic Notes in Theoretical Computer Science - ENTCSWe report on an experiment in c...
A Byzantine fault is an arbitrary behavior on the part of a hardware component, a software module or...
Schneider generalizes a number of protocols for Byzantine fault tolerant clock synchronization and p...
We formalize the generalized Byzantine fault-tolerant clock synchronization protocol of Schneider. T...
Schneider [7] generalizes a number of protocols for Byzantine fault-tolerant clock synchronization a...
We formalize the generalized Byzantine fault-tolerant clock synchronization protocol of Schneider. T...
This paper presents the mechanical verification of a simplified model of a rapid byzantine-fault-tol...
All published fault-tolerant clock synchronization protocols are shown to result from refining a sin...
AbstractWe report on an experiment in combining the theorem prover Isabelle with automatic first-ord...
A critical function in a fault-tolerant computer architecture is the synchronization of the redundan...
We report on an experiment in combining the theorem prover Isabelle with au-tomatic first-order arit...
We describe a formal specification and mechanically checked verification of the Interactive Converge...
The following topics are covered in viewgraph form: (1) introduction to clock synchronization protoc...
This paper presents the mechanical verification of a simplified model of a rapid Byzantine-fault-tol...
Abstract. This paper gives two simple efficient distributed algorithms: one for keeping clocks in a ...
to appear in Electronic Notes in Theoretical Computer Science - ENTCSWe report on an experiment in c...
A Byzantine fault is an arbitrary behavior on the part of a hardware component, a software module or...
Schneider generalizes a number of protocols for Byzantine fault tolerant clock synchronization and p...
We formalize the generalized Byzantine fault-tolerant clock synchronization protocol of Schneider. T...
Schneider [7] generalizes a number of protocols for Byzantine fault-tolerant clock synchronization a...
We formalize the generalized Byzantine fault-tolerant clock synchronization protocol of Schneider. T...
This paper presents the mechanical verification of a simplified model of a rapid byzantine-fault-tol...
All published fault-tolerant clock synchronization protocols are shown to result from refining a sin...
AbstractWe report on an experiment in combining the theorem prover Isabelle with automatic first-ord...
A critical function in a fault-tolerant computer architecture is the synchronization of the redundan...
We report on an experiment in combining the theorem prover Isabelle with au-tomatic first-order arit...
We describe a formal specification and mechanically checked verification of the Interactive Converge...
The following topics are covered in viewgraph form: (1) introduction to clock synchronization protoc...
This paper presents the mechanical verification of a simplified model of a rapid Byzantine-fault-tol...
Abstract. This paper gives two simple efficient distributed algorithms: one for keeping clocks in a ...
to appear in Electronic Notes in Theoretical Computer Science - ENTCSWe report on an experiment in c...
A Byzantine fault is an arbitrary behavior on the part of a hardware component, a software module or...