We introduce streaming data string transducers that map input data strings to output data
strings in a single left-to-right pass in linear time. Data strings are (unbounded) sequences of …

We present an algorithmic method for the quantitative, performance-aware synthesis of
concurrent programs. The input consists of a nondeterministic partial program and of a …

We present a new version of ReLoC: a relational separation logic for proving refinements of
programs with higher-order state, fine-grained concurrency, polymorphism and recursive …

We present a technique for automatically verifying safety properties of concurrent programs,
in particular programs that rely on subtle dependencies of local states of different threads …

Concurrent separation logics have had great success reasoning about concurrent data
structures. This success stems from their application of modularity on multiple levels, leading …

Linearisability is the standard correctness criterion for concurrent data structures. In this
paper, we present a sound and complete proof technique for linearisability based on …

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 introduce nondeterministic streaming string transducers (nssts)–a new computational
model that can implement MSO-definable relations between strings. An nsst makes a single …

Linearisability is the key correctness criterion for concurrent implementations of data
structures shared by multiple processes. In this paper we present a proof of linearisability of …

Linearizability is a well established correctness condition for concurrent datatypes.
Informally, a concurrent datatype is linearizable if operation calls appear to have an effect …