• Computer Science
  • Published 1992

Verifying the Interactive Convergence Clock Synchronization algorithm Using the Boyer-Moore Theorem Prover

@inproceedings{William1992VerifyingTI,
  title={Verifying the Interactive Convergence Clock Synchronization algorithm Using the Boyer-Moore Theorem Prover},
  author={D Young William},
  year={1992}
}
The application of formal methods to the analysis of computing systems promises to provide higher and higher levels of assurance as the sophistication of our tools and techniques increases. Improvements in tools and techniques come about as we pit the current state of the art against new and challenging problems. A promising area for the application of formal methods is in real-time and distributed computing. Some of the algorithms in this area are both subtle and important. In response to this… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 15 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

Functional Instantiation in First-Order Logic

  • Artificial and Mathematical Theory of Computation
  • 1991
VIEW 15 EXCERPTS
HIGHLY INFLUENTIAL

and F

J. Rushb
  • von Henke. Formal Verification of a Fault-Tolerant Clock Synchronization Algorithm. NASA CR-4239, June
  • 1989
VIEW 20 EXCERPTS
HIGHLY INFLUENTIAL

An Extension of the Boyer-Moore Theorem Prover to Handle First-Order Quantifiers

M. Kaufmann
  • To appear in Journal of Automated Reasoning,
  • 1992
VIEW 2 EXCERPTS

Kit and the short stack

  • Journal of Automated Reasoning
  • 1989
VIEW 1 EXCERPT

Microprocessor design verification

  • Journal of Automated Reasoning
  • 1989
VIEW 1 EXCERPT

2377

NASA Conference Publicatio
  • Peer Review of a Formal Verification/Design Proof Methodology. NASA, July,
  • 1983
VIEW 1 EXCERPT

A computational logic handbook

  • Perspectives in computing
  • 1979
VIEW 2 EXCERPTS

Computational Logic

  • ESPRIT Basic Research Series
  • 1979
VIEW 1 EXCERPT