Automatic synthesis of cache-coherence protocol processors using Bluespec

Authors:
N. Dave;M. C. Ng; Arvind
Affiliations:
Comput. Sci.&Artificial Intelligence Lab., Massachusetts Univ., Cambridge, MA, USA;Comput. Sci.&Artificial Intelligence Lab., Massachusetts Univ., Cambridge, MA, USA;Comput. Sci.&Artificial Intelligence Lab., Massachusetts Univ., Cambridge, MA, USA
Venue:
MEMOCODE '05 Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design
Year:
2005

Citing 0
Cited 4

Tackling an abstraction gap: co-simulating SystemC DE with bluespec ESL

Proceedings of the conference on Design, automation and test in Europe
Getting Formal Verification into Design Flow

FM '08 Proceedings of the 15th international symposium on Formal Methods
Embedded DSP Processor Design: Application Specific Instruction Set Processors

Embedded DSP Processor Design: Application Specific Instruction Set Processors
TRANSIT: specifying protocols with concolic snippets

Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

There are few published examples of the proof of correctness of a cache-coherence protocol expressed in an HDL. A designer generally shows the correctness of a protocol where many implementation details have been abstracted away. Abstract protocols are often expressed as a table of rules or state transition diagrams with an (implicit) model of atomic actions. There is enough of a semantic gap between these high-level abstract descriptions and HDLs that the task of showing the correctness of an implementation of a verified abstract protocol is as daunting as proving the abstract protocol's correctness in the first place. The main contribution of this paper is to show that this problem can be largely avoided by expressing the verified abstract protocol in Bluespec SystemVerilog (BSV), which is based on guarded atomic actions and is synthesizable into efficient hardware. Consequently, once a protocol has been verified at the rules-level, little verification effort is needed to verify the implementation. We illustrate our approach by synthesizing a non-blocking MSI cache-coherence protocol for distributed memory systems and discuss the performance of the resulting implementation.