Murφ is a formal verification system for finite-state concurrent systems developed as a research project at Stanford University. It has been widely used for many protocols especially for multiprocessor cache coherence protocols and cryptographic protocols. This paper reviews the history of Murφ, some of results that of the project, and lessons learned. © 2008 Springer-Verlag.
CITATION STYLE
Dill, D. L. (2008). A retrospective on Murφ. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5000 LNCS, pp. 77–88). https://doi.org/10.1007/978-3-540-69850-0_5
Mendeley helps you to discover research relevant for your work.