Fair Operational Semantics
summary
Proposes FOS, an operational semantics that can encode arbitrary fairness notions and gives a concrete proof technique: a fairness counter that drops on bad events and resets on good events, enabling induction for termination. Provides thread-local simulation relations with separation-logic-style resource algebras, a mixed coinductive/inductive definition, and a mechanized development in Coq mechanization with reusable artifacts. Verifies a ticket lock verified implementation and a client under weak memory, showing the approach composes and works.
AI-written summary · about