Hierarchical cache coherence protocol verification one level at a time through assume guarantee

Authors:
Xiaofang Chen; Yu Yang;Michael Delisi; Ching-Tsun Chou
Affiliations:
Ganesh Gopalakrishnan School of Computing, University of Utah Salt Lake City, 84112, USA;Ganesh Gopalakrishnan School of Computing, University of Utah Salt Lake City, 84112, USA;Ganesh Gopalakrishnan School of Computing, University of Utah Salt Lake City, 84112, USA;Intel Corporation Santa Clara, CA 95054, USA
Venue:
HLDVT '07 Proceedings of the 2007 IEEE International High Level Design Validation and Test Workshop
Year:
2007

Citing 0
Cited 2

Efficient methods for formally verifying safety properties of hierarchical cache coherence protocols

Formal Methods in System Design
Automated generation of directed tests for transition coverage in cache coherence protocols

DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose the generalized de Bruijn graph as a reliable and efficient network topology for a Network on-Chip (NoC) design. We also propose a reliable routing algorithm to detour a problematic (i.e., faulty or congested) link. Our experimental ...