View-Based Axiomatic Reasoning for PSO (Extended Version)
Lara Bargmann, Heike Wehrheim

TL;DR
This paper extends view-based axiomatic reasoning to the PSO memory model by developing a new semantics and analyzing its axiomatic properties, enabling correctness proofs for concurrent programs under PSO.
Contribution
It introduces a view-based semantics for PSO and analyzes its axioms, showing how to adapt axiomatic reasoning techniques to this memory model.
Findings
The view-based semantics for PSO coincides with the standard semantics.
PSO satisfies all but one of the core axioms, specifically message-passing.
Proofs requiring message-passing are not transferable to PSO.
Abstract
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,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Formal Methods in Verification · Distributed systems and fault tolerance
