Formal Verification of the Alpha 21364 Network Protocol

Authors:
Abdel Mokkedem;Tim Leonard
Affiliations:
-;-
Venue:
TPHOLs '00 Proceedings of the 13th International Conference on Theorem Proving in Higher Order Logics
Year:
2000

Citing 4
Cited 3

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
Functional verification of a multiple-issue, pipelined, superscalar Alpha processor—the Alpha 21164 CPU chip

Digital Technical Journal - Special 10th anniversary issue
Functional verification of a multiple-issue, out-of-order, superscalar Alpha processor—the DEC Alpha 21264 microprocessor

DAC '98 Proceedings of the 35th annual Design Automation Conference
Formalization and Analysis of a Solution to the PCI 2.1 Bus Transaction Ordering Problem

Formal Methods in System Design - Special issue on formal methods for computer-added design

Proof Engineering in the Large: Formal Verification of Pentium® 4 Floating-Point Divider

CHARME '01 Proceedings of the 11th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Formal Verification Methods for Industrial Hardware Design

SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Predicate Subtyping with Predicate Sets

TPHOLs '01 Proceedings of the 14th International Conference on Theorem Proving in Higher Order Logics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe our formal verification that the Alpha 21364's network protocol guarantees delivery and maintains necessary message ordering. We describe the protocol and its formalization, and the formalization and proof of deadlock freedom and liveness. We briefly describe our experience with using three tools (SMV, PVS, and TLA-I-/TLC), with the cost effectiveness of formal methods, and with software engineering of formal specs.