1 citations · 1 across the 1 of their papers we have counts for
3 papers
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…
cs.PL2017
Proving Linearizability Using Partial Orders (Extended Version)
Artem Khyzha, Mike Dodds, Alexey Gotsman +1
Linearizability is the commonly accepted notion of correctness for concurrent data structures. It requires that any execution of the data structure is justified by a linearization…
cs.LO2015★ 1 cited
Refining Existential Properties in Separation Logic Analyses
Matko Botinčan, Mike Dodds, Stephen Magill
In separation logic program analyses, tractability is generally achieved by restricting invariants to a finite abstract domain. As this domain cannot vary, loss of information can…