activity
20002021
most citedVerifying linearizability: A comparative survey

9 citations · 29 across the 14 of their papers we have counts for

collaborators

15 papers

cs.DC2021

On Strong Observational Refinement and Forward Simulation

John Derrick, Simon Doherty, Brijesh Dongol +2

Hyperproperties are correctness conditions for labelled transition systems that are more expressive than traditional trace properties, with particular relevance to security. Recent…

cs.DC2020★ 7 cited

Modularising Verification Of Durable Opacity

Eleni Bila, John Derrick, Simon Doherty +3

Non-volatile memory (NVM), also known as persistent memory, is an emerging paradigm for memory that preserves its contents even after power loss. NVM is widely expected to become u…

cs.DC2020

Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory

Eleni Bila, Simon Doherty, Brijesh Dongol +3

Non-volatile memory (NVM), aka persistent memory, is a new paradigm for memory that preserves its contents even after power loss. The expected ubiquity of NVM has stimulated intere…

cs.PL2018

Verifying C11 Programs Operationally

Simon Doherty, Brijesh Dongol, Heike Wehrheim +1

This paper develops an operational semantics for a release-acquire fragment of the C11 memory model with relaxed accesses. We show that the semantics is both sound and complete wit…

cs.LO2018

Proceedings 18th Refinement Workshop

John Derrick, Brijesh Dongol, Steve Reeves

Refinement is one of the cornerstones of a formal approach to software engineering. Refinement is the process of developing a more detailed design or implementation from an abstrac…

cs.LO2018★ 1 cited

Causal Linearizability: Compositionality for Partially Ordered Executions

Simon Doherty, John Derrick, Brijesh Dongol +1

In the interleaving model of concurrency, where events are totally ordered, linearizability is compositional: the composition of two linearizable objects is guaranteed to be linear…