Owicki-Gries Reasoning for C11 RAR
| Autor: | Dalvandi, Sadegh, Doherty, Simon, Dongol, Brijesh, Wehrheim, Heike |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2020 |
| Předmět: |
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES
TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS Owicki-Gries Verification Theory of computation → Hoare logic Hoare logic Theory of computation → Concurrency Isabelle Theory of computation → Program reasoning Theory of computation → Logic and verification Theory of computation → Operational semantics C11 |
| DOI: | 10.4230/lipics.ecoop.2020.11 |
| Popis: | Owicki-Gries reasoning for concurrent programs uses Hoare logic together with an interference freedom rule for concurrency. In this paper, we develop a new proof calculus for the C11 RAR memory model (a fragment of C11 with both relaxed and release-acquire accesses) that allows all Owicki-Gries proof rules for compound statements, including non-interference, to remain unchanged. Our proof method features novel assertions specifying thread-specific views on the state of programs. This is combined with a set of Hoare logic rules that describe how these assertions are affected by atomic program steps. We demonstrate the utility of our proof calculus by verifying a number of standard C11 litmus tests and Peterson’s algorithm adapted for C11. Our proof calculus and its application to program verification have been fully mechanised in the theorem prover Isabelle. LIPIcs, Vol. 166, 34th European Conference on Object-Oriented Programming (ECOOP 2020), pages 11:1-11:26 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|