3 papers
cs.LO2021
Owicki-Gries Reasoning for C11 Programs with Relaxed Dependencies (Extended Version)
Daniel Wright, Mark Batty, Brijesh Dongol
Deductive verification techniques for C11 programs have advanced significantly in recent years with the development of operational semantics and associated logics for increasingly…
cs.LO2018
PrideMM: A Solver for Relaxed Memory Models
Simon Cooksey, Sarah Harris, Mark Batty +2
Relaxed memory models are notoriously delicate. To ease their study, several ad hoc simulators have been developed for axiomatic memory models. We show how axiomatic memory models…
cs.PL2018
Compositional Verification of Compiler Optimisations on Relaxed Memory
Mike Dodds, Mark Batty, Alexey Gotsman
A valid compiler optimisation transforms a block in a program without introducing new observable behaviours to the program as a whole. Deciding which optimisations are valid can be…