Verification of a lazy cache coherence protocol against a weak memory model

Christopher Banks, Marco Elver, Ruth Hoffmann, Susmit Sarkar, Paul Jackson, Vijay Nagarajan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we verify a modern lazy cache coherence protocol, TSO-CC, against the memory consistency model it was designed for, TSO. We achieve this by first showing a weak simulation relation between TSO-CC (with a fixed number of processors) and a novel finite-state operational model which exhibits the laziness of TSO-CC and satisfies TSO. We then extend this by an existing parameterisation technique, allowing verification for an unlimited number of processors. The approach is executed entirely within a model checker, no external tool is required and very little in-depth knowledge of formal verification methods is required of the verifier.
Original languageEnglish
Title of host publicationThe 17th Conference on Formal Methods in Computer-Aided Design (FMCAD 2017)
Place of PublicationVienna, Austria
PublisherFMCAD Inc
Pages60-67
Number of pages8
ISBN (Print)978-0-9835678-7-5
DOIs
Publication statusPublished - 2 Oct 2017
Event17th Conference on Formal Methods in Computer-Aided Design - Vienna, Austria
Duration: 2 Oct 20176 Oct 2017
https://www.cs.utexas.edu/~hunt/fmcad/FMCAD17/

Conference

Conference17th Conference on Formal Methods in Computer-Aided Design
Abbreviated titleFMCAD 2017
CountryAustria
CityVienna
Period2/10/176/10/17
Internet address

Fingerprint

Dive into the research topics of 'Verification of a lazy cache coherence protocol against a weak memory model'. Together they form a unique fingerprint.

Cite this