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+/TLC), with the cost effectiveness of formal methods, and with software engineering of formal specs. © Springer-Verlag Berlin Heidelberg 2000.
Cite
CITATION STYLE
Mokkedem, A., & Leonard, T. (2000). Formal verification of the alpha 21364 network protocol. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 1869, 443–461. https://doi.org/10.1007/3-540-44659-1_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
