Protocol verification in nuprl

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1427 LNCS, Issue , 1998, Pages 428-439

  Felty, Amy P ^a   Howe, Douglas J ^a   Stomp, Frank A ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

AUTOMATED REASONING; CACHE COHERENCE PROTOCOLS; CONSTRUCTIVE TYPE THEORY; FORMAL MATHEMATICS; INTERACTIVE THEOREM PROVER; PROTOCOL VERIFICATION; THEOREM PROVING SYSTEMS; TYPE INFORMATION; TYPE ANNOTATIONS;

THEOREM PROVING;

EID: 84863975620     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028764     Document Type: Conference Paper

References (12)

1. C.-T. Chou and D. Peled. Verifying a model-checking algorithm. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1055 of Lecture Notes in Computer Science, pages 241-257. Springer-Verlag, 1996.
2. R. L. Constable, et al. Implementing Mathematics with the Nuprl Proof Development System. Prentice-Hall, Englewood Cliffs, New Jersey, 1986.
3. A. Felty and F. Stomp. A correctness proof of a cache coherence protocol. 1997. Available at www.cs.bell-labs.com/~felty/sci/. An earlier version appears in Proceedings of the 11th Annual Conference on Computer Assurance, 1996.
4. A. P. Felty and D. J. Howe. Hybrid interactive theorem proving using Nuprl and HOL. In Fourteenth International Conference on Automated Deduction, volume 1249 of Lecture Notes in Computer Science, pages 351-365. Springer-Verlag, 1997. (Pubitemid 127089537)
5. M. J. C. Gordon and T. F. Melham. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
6. D. J. Howe. On computational open-endedness in Martin-Löf's type theory. In Proceedings of the Sixth Annual Symposium on Logic in Computer Science, pages 162-172. IEEE Computer Society, 1991.
7. D. J. Howe. Importing mathematics from HOL into Nuprl. In Theorem Proving in Higher Order Logics, volume 1125 of Lecture Notes in Computer Science, pages 267-281. Springer-Verlag, 1996.
8. IEEE-P1596-05Nov90-doc197-iii. Part HIA: SCI Coherence Overview, 1990. Unapproved Draft. Approved standard is described in IEEE Std. 1596-1992 "The Scalable Coherent Interface".
9. S. Owre and N. Shankar. The formal semantics of PVS. Technical report, SRI, August 1997.
10. S. Park and D. L. Dill. Verification of FLASH cache coherence protocol by aggregation of distributed transactions. In 8th ACM Symposium on Parallel Algorithms and Architectures, 1996.
11. U. Stern and D. L. Dill. Automatic verification of the SCI cache coherence protocol. In Correct Hardware Design and Verification Methods, 1995.
12. B. Werner. Sets in types, types in sets. In International Symposium on Theoretical Aspects of Computer Software, volume 1281 of Lecture Notes in Computer Science. Springer-Verlag, 1997.