Formal Verification of the HAL S1 System Cache Coherence Protocol

Formal Verification of the HAL S1 System Cache Coherence Protocol (1997)

Cached

Download Links

[www.cs.ubc.ca]
[www.cs.ubc.ca]

Other Repositories/Bibliography

DBLP

by Alan J. Hu , Masahiro Fujita , Chris Wilson

Venue:	Int'l Conf on Computer Design
Citations:	2 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Formal Verification of the HAL S1 System Cache Coherence Protocol	user correction - Legacy Corrections
AUTHOR NAME	Alan J. Hu	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science; University of British Columbia	user correction - Legacy Corrections
AUTHOR ADDR	2366 Main Mall; Vancouver, BC V6T 1Z4; Canada	user correction - Legacy Corrections
AUTHOR NAME	Masahiro Fujita	user correction - Legacy Corrections
AUTHOR AFFIL	Fujitsu Laboratories of America	user correction - Legacy Corrections
AUTHOR ADDR	3350 Scott Blvd., Bldg. #34; Santa Clara, CA 95054-3104	user correction - Legacy Corrections
AUTHOR NAME	Chris Wilson	user correction - Legacy Corrections
AUTHOR AFFIL	HAL Computer Systems	user correction - Legacy Corrections
AUTHOR ADDR	1315 Dell Avenue; Campbell, CA 95008	user correction - Legacy Corrections
ABSTRACT	This paper describes our experience applyingformal verification to the cache coherence protocol of the HAL S1 System, a shared-memory and/or message-passing multiprocessor consisting of standard Intel Pentium R fl Pro symmetric multiprocessing (SMP) servers connected by HAL's proprietary Mercury Interconnect to create a cache-coherent, non-uniform memory access (CC-NUMA) machine. In recent years, several researchers have described the verification of cache coherence protocols to demonstrate the potential of formal verification. In this project, we sought to quantify this potential by carefully tracking the effort and results of applying formal verification, rather than simply demonstrating that verification was possible. Based on our records and experience, we show that protocol-level formal verification, properly applied, is sufficiently well-understood to be routinely undertaken, and we describe the techniques used to simplify the verification process. On the negative side, our form...	user correction - Legacy Corrections
YEAR	1997	INFERENCE
VENUE	Int'l Conf on Computer Design	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	438--444	INFERENCE
CITATIONS	17 found	ParsCit 1.0