Today's cloud databases offer strong properties, including serializability, sometimes called
the gold standard database correctness property. But cloud databases are complicated …

While causal consistency is one of the most fundamental consistency models weaker than
sequential consistency, the decidability of safety verification for (finite-state) concurrent …

Causal consistency is one of the most fundamental and widely used consistency models
weaker than sequential consistency. In this paper, we study the verification of safety …

Distributed storage systems and databases are widely used by various types of applications.
Transactional access to these storage systems is an important abstraction allowing …

Modern applications, such as social networking systems and e-commerce platforms are
centered around using large-scale databases for storing and retrieving data. Accesses to the …

We present an algorithm for automatically checking robustness of concurrent programs
against C/C++ 11 release/acquire semantics, namely verifying that all program behaviors …

Modern applications, such as social networking systems and e-commerce platforms are
centered around using large-scale storage systems for storing and retrieving data. In the …

Existing secure database management systems (DBMSs) focus on security and privacy of
data but overlook semantic properties, such as the correctness and ACID properties of …

Relational database applications are notoriously difficult to test and debug. Concurrent
execution of database transactions may violate complex structural invariants that constraint …

We study the problem of verifying the robustness of concurrent programs against a C11-style
memory model that includes relaxed accesses and release/acquire accesses and fences …