Unifying Operational Weak Memory Verification: An Axiomatic Approach

Doherty, Simon; Dalvandi, Sadegh; Dongol, Brijesh; Wehrheim, Heike

doi:10.1145/3545117

Cited by 9 publications

(11 citation statements)

References 64 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To alleviate this problem, Doherty et al [15] proposed a generic reasoning technique for weak memory models with a view-based operational semantics. The core of this technique are a number of axioms on the transition systems generated by the memory model.…”

Section: Introductionmentioning

confidence: 99%

“…A number of works have studied this memory model, proposing stateless model checking [1], proving the decidability of reachability [7] or the NP-hardness of the testing (or consistency) problem [18]. Besides an axiomatic semantics [3], PSO also has an operational semantics, however, not easily lending itself to the definition of views, in particular not for defining view maximality, the core concept underlying axiomatic reasoning in [15]. Our first step is thus to develop a new semantics definition for PSO and prove it to coincide with the standard semantics via simulations [30].…”

Section: Introductionmentioning

confidence: 99%

“…Our first step is thus to develop a new semantics definition for PSO and prove it to coincide with the standard semantics via simulations [30]. Equipped with the new semantics, we prove PSO to instantiate all but one axiom of [15]. The missing axiom refers to the ability of some memory models to provide message passing (MP) facilities, i.e.…”

Section: Introductionmentioning

confidence: 99%

“…Hence, only correctness proofs using the axioms other than MP are valid in PSO. Besides the already existing proofs in [15], we provide a new correctness proof for a message passing example with a fence, required to guarantee correctness for weak memory models without message passing facilities, i.e. requiring a proof without use of the MP axiom.…”

Section: Introductionmentioning

confidence: 99%

“…Before looking at PSO and its view-based semantics, we define our program syntax and semantics partly following the notation of [15].…”

Section: Introductionmentioning

confidence: 99%

See 4 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: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Before looking at PSO and its view-based semantics, we define our program syntax and semantics partly following the notation of [15].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

View-Based Axiomatic Reasoning for PSO (Extended Version)

Lara¹,

Wehrheim²

2023

Preprint

View full text Add to dashboard Cite

show abstract

Reasoning About Promises in Weak Memory Models with Event Structures

Wehrheim

Lara²,

Dongol³

2023

Lecture Notes in Computer Science

Self Cite

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

A Fine-Grained Semantics for Arrays and Pointers Under Weak Memory Models

Colvin

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Unifying Operational Weak Memory Verification: An Axiomatic Approach

Cited by 9 publications

References 64 publications

View-Based Axiomatic Reasoning for PSO (Extended Version)

View-Based Axiomatic Reasoning for PSO (Extended Version)

Reasoning About Promises in Weak Memory Models with Event Structures

A Fine-Grained Semantics for Arrays and Pointers Under Weak Memory Models

Contact Info

Product

Resources

About