Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

34

CHARME
2001
Springer

favoriteEmaildiscussreport

162views Hardware» more CHARME 2001»

Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking

14 years 2 months ago

Parameterized Verification of the FLASH Cache Coherence Protocol by Compositional Model Checking

Download www.kenmcmil.com

We consider the formal verification of the cache coherence protocol of the Stanford FLASH multiprocessor for N processors. The proof uses the SMV proof assistant, a proof system based on symbolic model checking. The proof process is described step by step. The protocol model is derived from an earlier proof of the FLASH protocol, using the PVS system, allowing a direct comparison between the two methods.

Kenneth L. McMillan

Real-time Traffic

Cache Coherence Protocol | CHARME 2001 | Hardware | Proof Process | SMV Proof Assistant |

claim paper

Related Content

» A Simple Method for Parameterized Verification of Cache Coherence Protocols

» Verification of the Futurebus Cache Coherence protocol A case study in model checking

» Exact and Efficient Verification of Parameterized Cache Coherence Protocols

» A Java Supercompiler and Its Application to Verification of CacheCoherence Protocols

» Automatic NonInterference Lemmas for Parameterized Model Checking

» Automatic Checking of Aggregation Abstractions Through State Enumeration

» An invariantbased approach to the verification of asynchronous parameterized networks

» Improving MultipleCMP Systems Using Token Coherence

» Bounded Model Construction for Monadic SecondOrder Logics

Post Info
More Details (n/a)

Added	23 Aug 2010
Updated	23 Aug 2010
Type	Conference
Year	2001
Where	CHARME
Authors	Kenneth L. McMillan

Comments (0)