Partial Coherence Abstractions for Relaxed Memory Models

Presented by Michael Kuperstein, this presentation discusses the use of partial-coherence abstractions in relaxed memory models for programs. It covers concepts like mutual exclusion algorithms, store buffer-based models, memory fences, automatic solutions for enforcing memory consistency, abstract memory models, and fence inference methods for precise analysis. The goal is to verify program correctness without arbitrary bounds and synthesize optimal fences for mutual exclusion primitives.

mojer + Follow