Rely-guarantee reasoning for causally consistent shared memory
Rely-guarantee (RG) is a highly influential compositional proof technique for concurrent
programs, which was originally developed assuming a sequentially consistent shared …
programs, which was originally developed assuming a sequentially consistent shared …
Unifying operational weak memory verification: an axiomatic approach
In this article, we propose an approach to program verification using an abstract
characterisation of weak memory models. Our approach is based on a hierarchical axiom …
characterisation of weak memory models. Our approach is based on a hierarchical axiom …
Compositional reasoning for non-multicopy atomic architectures
Rely/guarantee reasoning provides a compositional approach to reasoning about
concurrent programs. However, such reasoning traditionally assumes a sequentially …
concurrent programs. However, such reasoning traditionally assumes a sequentially …
Unifying weak memory verification using potentials
Concurrency verification for weak memory models is inherently complex. Several deductive
techniques based on proof calculi have recently been developed, but these are typically …
techniques based on proof calculi have recently been developed, but these are typically …
Specifying and reasoning about shared-variable concurrency
Specifications are a necessary reference point for correctness arguments. Top-down
descriptions of concurrent programs require a way of recording information about the …
descriptions of concurrent programs require a way of recording information about the …
Reasoning about promises in weak memory models with event structures
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 …
instructions within a process may be reordered. To cope with such phenomena, so called …
Mechanised operational reasoning for C11 programs with relaxed dependencies
Verification techniques for C11 programs have advanced significantly in recent years with
the development of operational semantics and associated logics for increasingly large …
the development of operational semantics and associated logics for increasingly large …
Lifting the Reasoning Level in Generic Weak Memory Verification (Extended Version)
L Bargmann, H Wehrheim - arXiv preprint arXiv:2309.01433, 2023 - arxiv.org
Weak memory models specify the semantics of concurrent programs on multi-core
architectures. Reasoning techniques for weak memory models are often specialized to one …
architectures. Reasoning techniques for weak memory models are often specialized to one …
A Rely-Guarantee Framework for Proving Deadlock Freedom Under Causal Consistency
Jones' rely-guarantee framework (originally developed to enable reasoning about partial
correctness) has been extended in several works to additionally enable reasoning about …
correctness) has been extended in several works to additionally enable reasoning about …
Detecting Speculative Execution Vulnerabilities on Weak Memory Models
Speculative execution attacks affect all modern processors and much work has been done
to develop techniques for detection of associated vulnerabilities. Modern processors also …
to develop techniques for detection of associated vulnerabilities. Modern processors also …