View-Based Owicki–Gries Reasoning for Persistent x86-TSO

Bila, Eleni; Dongol, Brijesh; Lahav, Ori; Raad, Azalea; Wickerson, John

doi:10.1007/978-3-030-99336-8_9

Cited by 15 publications

(6 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We supplement that by giving a PSO specific semantics, showing which axioms hold for PSO and using them on a correctness proof of the MP with fence litmus test. Other Owicki-Gries related approaches on reasoning for weak memory models were made by [9,11,12,27]. While Bila et al [9] present an Owicki-Gries based logic for the persistent TSO memory model, Dalvandi et al [11,12] and Lahav and Vafeiadis [27] looked at the C11 memory model.…”

Section: Related Workmentioning

confidence: 99%

“…Other Owicki-Gries related approaches on reasoning for weak memory models were made by [9,11,12,27]. While Bila et al [9] present an Owicki-Gries based logic for the persistent TSO memory model, Dalvandi et al [11,12] and Lahav and Vafeiadis [27] looked at the C11 memory model. None of them introduce a generic proof calculus or a PSO specific one.…”

Section: Related Workmentioning

confidence: 99%

“…The operational style is more suitable for verification approaches like Hoare-style proof calculi [20] and their extensions to parallel programs by Owicki and Gries [31] which need to construct proof outlines and reason about program statements. Recently, a number of operational semantics based on the concept of views have been proposed [16,11,22,10,23,9]. Views are specific to threads in concurrent programs and -simply speaking -specify the values of shared variables a thread can read (i.e., view) in some particular state 1 .…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

View-Based Axiomatic Reasoning for PSO (Extended Version)

Lara¹,

Wehrheim²

2023

Preprint

View full text Add to dashboard Cite

Weak memory models describe the semantics of concurrent programs on modern multi-core architectures. Reasoning techniques for concurrent programs, like Owicki-Gries-style proof calculi, have to be based on such a semantics, and hence need to be freshly developed for every new memory model. Recently, a more uniform approach to reasoning has been proposed which builds correctness proofs on the basis of a number of core axioms. This allows to prove program correctness independent of memory models, and transfers proofs to specific memory models by showing these to instantiate all axioms required in a proof. The axiomatisation is built on the notion of thread views as first class elements in the semantics. In this paper, we investigate the applicability of this form of axiomatic reasoning to the Partial Store Order (PSO) memory model. As the standard semantics for PSO is not based on views, we first of all provide a view-based semantics for PSO and prove it to coincide with the standard semantics. We then show the new view-based semantics to satisfy all but one axiom. The missing axiom refers to message-passing (MP) abilities of memory models, which PSO does not guarantee. As a consequence, only proofs without usage of the MP axiom are transferable to PSO. We illustrate the reasoning technique by proving correctness of a litmus test employing a fence to ensure message passing.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

View-Based Axiomatic Reasoning for PSO (Extended Version)

Lara¹,

Wehrheim²

2023

Preprint

View full text Add to dashboard Cite

show abstract

“…In § 3.2, we present the Owicki-Gries proof rules. Our presentation combines prior works on Owicki-Gries for weak memory [2,3]. In § 3.3, we present the two weak-memory assertions from [3] that we use in our proof.…”

Section: Introductionmentioning

confidence: 98%

Verifying Read-Copy Update Under RC11

Semenyuk,

Batty,

Dongol

2023

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Read-Copy Update (RCU) is a key lock-free synchronisation mechanism that is used extensively in the Linux kernel. One use of RCU is safe memory reclamation in languages such as C/C++ that do not support garbage collection. Correctness of RCU is, however, difficult to verify, even when assuming sequentially consistent (SC) memory. In this paper, we develop and verify an RCU implementation under RC11 (a restricted version of C11 weak memory model, which includes relaxed and release-acquire accesses), increasing the verification challenge. Our proof technique is based on a notion of ownership, which we use to systematically track each thread's read/write capabilities to each memory location. In our proof, we extend a recent Owicki-Gries logic for RC11, which we combine with our ownership model to show correctness. All our proofs have been mechanised in the Isabelle/HOL theorem prover.

show abstract

“…Our interest here is the development and use of Hoare-style [17] structural proof calculi (and their extensions to concurrency by Owicki and Gries [27]) for weak memory models. Owicki-Gries-like proof calculi have been proposed by a number of researchers [10,11,22,40], and have also recently been given for nonvolatile memory [3,31]. Svendsen et al [35] have developed a separation logic for promises for the C11 memory model.…”

Section: Introductionmentioning

confidence: 99%

Formal Methods

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Modern processors such as ARMv8 and RISC-V allow executions in which independent instructions within a process may be reordered. To cope with such phenomena, so called promising semantics have been developed, which permit threads to read values that have not yet been written. Each promise is a speculative update that is later validated (fulfilled) by an actual write. Promising semantics are operational, providing a pathway for developing proof calculi. In this paper, we develop an incorrectness-style logic, resulting in a framework for reasoning about state reachability. Like incorrectness logic, our assertions are underapproximating, since the set of all valid promises are not known at the start of execution. Our logic uses event structures as assertions to compactly represent the ordering among events such as promised and fulfilled writes. We prove soundness and completeness of our proof calculus and demonstrate its applicability by proving reachability properties of standard weak memory litmus tests.

show abstract

View-Based Owicki–Gries Reasoning for Persistent x86-TSO

Cited by 15 publications

References 35 publications

View-Based Axiomatic Reasoning for PSO (Extended Version)

View-Based Axiomatic Reasoning for PSO (Extended Version)

Verifying Read-Copy Update Under RC11

Formal Methods

Contact Info

Product

Resources

About