Linearisability is a key correctness criterion for concurrent data structures, ensuring that
each history of the concurrent object under consideration is consistent with respect to a …

Kernel concurrency bugs are challenging to find because they depend on very specific
thread interleavings and test inputs. While separately exploring kernel thread interleavings …

Modular development of concurrent applications requires thread-safe components that
behave correctly when called concurrently by multiple client threads. This paper focuses on …

Locating linearization points (LPs) is an intuitive approach for proving linearizability, but it is
difficult to apply the idea in Hoare-style logic for formal program verification, especially for …

Random-based approaches and heuristics are commonly used in kernel concurrency
testing due to the massive scale of modern kernels and corresponding interleaving space …

Priority queues are fundamental to many multiprocessor applications. Several priority queue
algorithms based on skiplists have been proposed, as skiplists allow concurrent accesses to …

We present the first formal verification of a networked server implemented in C. Interaction
trees, a general structure for representing reactive computations, are used to tie together …

Many modern software systems are composed of multiple execution flows that run
simultaneously, spanning from applications designed to exploit the power of modern multi …

Modern architectures implement relaxed memory models which may reorder memory
operations or execute them non-atomically. Special instructions called memory fences are …

We address the problem of testing atomicity of composed concurrent operations. Concurrent
libraries help programmers exploit parallel hardware by providing scalable concurrent …