Mechanised Operational Reasoning for C11 Programs with Relaxed Dependencies

Verification techniques for C11 programs have advanced significantly in recent years with the development of operational semantics and associated logics increasingly large fragments C11. However, these been developed a restricted setting to avoid thin-air-read problem. In this article, we propose an that leverages intra-thread partial order (called semantic dependencies ) induced by recently denotational event-structure-based semantics. We prove our is sound complete respect present logic generalises Owicki–Gries framework RC11 RAR (repaired C11) relaxed release-acquire accesses. describe mechanisation Isabelle/HOL theorem prover, which use correctness number examples.