A major obstacle to putting software verification research into practice is the high cost of
developing the infrastructure enabling the application of verification algorithms to actual …

We address the problem of verifying message passing programs, defined as a set of
processes communicating through unbounded FIFO buffers. We introduce a bounded …

Verifying fine-grained optimistic concurrent programs remains an open problem. Modern
program logics provide abstraction mechanisms and compositional reasoning principles to …

We address the verification problem of eventual consistency of optimistic replication
systems. Such systems are typically used to implement distributed data structures over large …

Efficient implementations of concurrent objects such as semaphores, locks, and atomic
collections are essential to modern computing. Yet programming such objects is error prone …

Modern highly-concurrent search data structures, such as search trees, obtain multi-core
scalability and performance by having operations traverse the data structure without any …

Linearizability is the standard correctness criterion for concurrent data structures such as
stacks and queues. It allows to establish observational refinement between a concurrent …

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

Efficient implementations of atomic objects such as concurrent stacks and queues are
especially susceptible to programming errors, and necessitate automatic verification …

While many program properties like the validity of assertions and in-bounds array accesses
admit nearly-trivial monitoring algorithms, the standard correctness criterion for concurrent …