Overcoming Memory Weakness with Unified Fairness

Abstract We consider the verification of liveness properties for concurrent programs running on weak memory models. To that end, we identify notions fairness preclude demonic non-determinism, are motivated by practical observations, and amenable to algorithmic techniques. provide both logical stochastic definitions our notions, prove they equivalent in context verification. In particular, show allows us reduce problem (repeated control state reachability) simple reachability. this is a general phenomenon developing uniform framework which serves as formal foundation definition, can be instantiated wide landscape These models include SC, TSO, PSO, (Strong/Weak) Release-Acquire, Strong Coherence, FIFO-consistency, RMO.