![]() |
CiteULike | ![]() |
kzk_mover's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
Correctness of a directory-based cache coherence protocol: Early experienceParallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on In Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on (1993), pp. 37-44.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractCache coherence protocols of increasing complexities call for automated verification tools which are both efficient and reliable. Most current approaches can only verify protocols at a high level of abstraction and the model size is limited to a small number of interacting processes. By using a simple full-map directory scheme as example, we present a verification technique which is extremely efficient and is independent of the model size. Several non-obvious problems affecting the correctness of a protocol design are identified by the verification procedure
BibTeX record
RIS record