7 citations · 15 across the 8 of their papers we have counts for
10 papers
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…
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…
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…
Integrating Owicki-Gries for C11-Style Memory Models into Isabelle/HOL
Sadegh Dalvandi, Brijesh Dongol, Simon Doherty
Weak memory presents a new challenge for program verification and has resulted in the development of a variety of specialised logics. For C11-style memory models, our previous work…
Convolution and Concurrency
James Cranch, Simon Doherty, Georg Struth
We show how concurrent quantales and concurrent Kleene algebras arise as convolution algebras of functions from structures with two ternary relations that satisfy relatio…
Relational Semigroups and Object-Free Categories
James Cranch, Simon Doherty, Georg Struth
This note relates axioms for partial semigroups and monoids with those for small object-free categories, either with multiple monoidal units or with source and target maps. We disc…
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…
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…
Reducing Opacity to Linearizability: A Sound and Complete Method
Alasdair Armstrong, Brijesh Dongol, Simon Doherty
Transactional memory is a mechanism that manages thread synchronisation on behalf of a programmer so that blocks of code execute with an illusion of atomicity. The main safety crit…
Causal Linearizability
Simon Doherty, John Derrick
Most work on the verification of concurrent objects for shared memory assumes sequential consistency, but most multicore processors support only weak memory models that do not prov…