activity
20162020
most citedAn algebra of synchronous atomic steps

22 citations · 24 across the 3 of their papers we have counts for

collaborators

5 papers

cs.PL2020

An abstract semantics of speculative execution for reasoning about security vulnerabilities

Robert J. Colvin, Kirsten Winter

Reasoning about correctness and security of software is increasingly difficult due to the complexity of modern microarchitectural features such as out-of-order execution. A class o…

cs.PL2018★ 2 cited

Correctness of Concurrent Objects under Weak Memory Models

Graeme Smith, Kirsten Winter, Robert J. Colvin

In this paper we develop a theory for correctness of concurrent objects under weak memory models. Central to our definitions is the concept of observations which determine when eff…

cs.LO2018

A sound and complete definition of linearizability on weak memory models

Graeme Smith, Kirsten Winter, Robert J. Colvin

Linearizability is a widely accepted notion of correctness for concurrent objects. Recent research has investigated redefining linearizability for particular hardware weak memory m…

cs.LO2017

A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency

Ian J. Hayes, Larissa A. Meinicke, Kirsten Winter +1

This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, i…

cs.LO2016★ 22 cited

An algebra of synchronous atomic steps

Ian J. Hayes, Robert Colvin, Larissa Meinicke +2

This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, i…