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

近年来，随着 C11 片段的操作语义和相关逻辑的发展，C11 程序的验证技术取得了显着进步。然而，这些语义和逻辑是在有限的环境中开发的，以避免稀薄的读取问题。在本文中，我们提出了一种利用线程内偏序（称为语义依赖）的操作语义）由最近开发的基于指称事件结构的语义引起。我们证明我们的操作语义相对于指称语义是合理且完整的。我们提出了一个相关的逻辑，概括了最近的 RC11 RAR（修复后的 C11）的 Owicki-Gries 框架，具有宽松的和释放获取的访问权限。我们描述了 Isabelle/HOL 定理证明器中逻辑的机械化，我们用它来证明许多例子的正确性。