Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a novel approach to verifying cache coherence protocols through compositional proof strategies in this 21-minute conference presentation from CPP 2026. Learn how researchers from EPFL tackle the notoriously difficult problem of cache coherence protocol verification by introducing protocol decomposition and local invariant frameworks as alternatives to traditional global inductive invariant discovery. Discover how the standard MSI protocol can be proven correct compositionally by independently verifying simpler MI and SI subprotocols and demonstrating that MSI behaves as their combination. Understand how this decomposition reveals that necessary invariants can be established using a small set of simple local invariants between a single cache and its parent and memory, eliminating the need for complex global reasoning across children caches. See how this approach dramatically reduces the number of required invariants from dozens or hundreds in prior work to a small, structured, and manageable set, significantly simplifying correctness proofs. The presentation covers the complete formalization of this development in Lean 4, demonstrating practical applications of formal verification and theorem proving in computer architecture and distributed protocols.
