This paper reports our experience applying lightweight formal methods to validate the
correctness of ShardStore, a new key-value storage node implementation for the Amazon …

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

GenMC is an LLVM-based state-of-the-art stateless model checker for concurrent C/C++
programs. Its modular infrastructure allows it to support complex memory models, such as …

Persistent memory (PM) technologies combine near DRAM performance with persistency
and open the possibility of using one copy of a data structure as both a working copy and a …

End-host runtime monitors (eg, CFI, system call IDS) flag processes in response to
symptoms of a possible attack. Unfortunately, the symptom (eg, invalid control transfer) may …

Data races are among the worst bugs in software in that they exhibit non-deterministic
symptoms and are notoriously difficult to detect. The problem is exacerbated by interactions …

Reproducing production failures is crucial for software reliability. Alas, existing bug
reproduction approaches are not suitable for production systems because they are not …

Stateless model checking (SMC) is one of the standard approaches to the verification of
concurrent programs. As scheduling non-determinism creates exponentially large spaces of …

Writing correct concurrent code that uses atomics under the C/C++ memory model is
extremely difficult. We present C11Tester, a race detector for the C/C++ memory model that …

Bounded verification techniques such as bounded model checking (BMC) have successfully
been used for many practical program analysis problems, but concurrency still poses a …