Fair Operational Semantics

Fairness properties, which state that a sequence of bad events cannot happen infinitely before good event takes place, are often crucial in program verification. However, general methods for expressing and reasoning about various kinds fairness properties relatively underdeveloped compared to those safety properties. This paper proposes FOS (Fair Operational Semantics), theory capable arbitrary notions as an operational semantics these fairness. In addition, enables thread-local by providing simulation relations equipped with separation- logic-style resource algebras. We verify ticket lock implementation client the under weak memory concurrency example, requires different including scheduler, implementation, even memory. The FOS, well examples paper, fully formalized Coq.