Over the last decade, great progress has been made in developing practical transactional
memory (TM) implementations, but relatively little attention has been paid to precisely …

Linearizability of concurrent data structures is usually proved by monolithic simulation
arguments relying on identifying the so-called linearization points. Regrettably, such proofs …

Efficient implementations of data structures such as queues, stacks or hash-tables allow for
concurrent access by many processes at the same time. To increase concurrency, these …

We explore the potential of hardware transactional memory (HTM) to improve concurrent
algorithms. We illustrate a number of use cases in which HTM enables significantly simpler …

Linearizability of concurrent data structures is usually proved by monolithic simulation
arguments relying on the identification of the so-called linearization points. Regrettably, such …

We show that, in contrast to the general belief in the distributed computing community,
linearizability, the celebrated consistency property, is not always a safety property. More …

We describe ongoing work in which we aim to formally specify a correctness condition for
transactional memory (TM) called Weakest Reasonable Condition (WRC), and to facilitate …

Verification of concurrent data structures is one of the most challenging tasks in software
verification. The topic has received considerable attention over the course of the last …

We consider the verification of lock-free data structures that manually manage their memory
with the help of a safe memory reclamation (SMR) algorithm. Our first contribution is a type …

Veri cation of concurrent data structures is one of the most challenging tasks in software veri
cation. The topic has received considerable attention over the course of the last decade …