research
∙
03/22/2023
Dynamic Partial Order Reduction for Checking Correctness against Transaction Isolation Levels
Modern applications, such as social networking systems and e-commerce pl...
share
research
∙
03/10/2023
A Domain Specific Language for Testing Consensus Implementations
Large-scale, fault-tolerant, distributed systems are the backbone for ma...
research
∙
01/24/2023
Quorum Tree Abstractions of Consensus Protocols
Distributed algorithms solving agreement problems like consensus or stat...
research
∙
01/13/2023
The Commutativity Quotients of Concurrent Objects
Concurrent objects form the foundation of many applications that exploit...
research
∙
11/22/2022
A Pragmatic Approach to Stateful Partial Order Reduction
Partial order reduction (POR) is a classic technique for dealing with th...
research
∙
09/14/2022
Automated Synthesis of Asynchronizations
Asynchronous programming is widely adopted for building responsive and e...
research
∙
06/29/2021
Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs
Strong adversaries obtain additional power when a linearizable object is...
research
∙
05/14/2021
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers
A key way to construct complex distributed systems is through modular co...
research
∙
03/04/2021
MonkeyDB: Effectively Testing Correctness against Weak Isolation Levels
Modern applications, such as social networking systems and e-commerce pl...
research
∙
01/22/2021
Checking Robustness Between Weak Transactional Consistency Models
Concurrent accesses to databases are typically encapsulated in transacti...
research
∙
11/19/2020
Checking Causal Consistency of Distributed Databases
The CAP Theorem shows that (strong) Consistency, Availability, and Parti...
research
∙
10/02/2020
Proving Highly-Concurrent Traversals Correct
Modern highly-concurrent search data structures, such as search trees, o...
research
∙
11/04/2019
Verifying Visibility-Based Weak Consistency
Multithreaded programs generally leverage efficient and thread-safe conc...
research
∙
08/13/2019
On the Complexity of Checking Transactional Consistency
Transactions simplify concurrent programming by enabling computations on...
research
∙
06/28/2019
Robustness Against Transactional Causal Consistency
Distributed storage systems and databases are widely used by various typ...
research
∙
05/28/2019
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects
It has been observed that linearizability, the prevalent consistency con...
research
∙
05/21/2019
Checking Robustness Against Snapshot Isolation
Transactional access to databases is an important abstraction allowing p...
research
∙
03/15/2019
Replication-Aware Linearizability
Geo-distributed systems often replicate data at multiple locations to ac...
research
∙
07/10/2018
Datalog-based Scalable Semantic Diffing of Concurrent Programs
When an evolving program is modified to address issues related to thread...
research
∙
05/10/2018
Order out of Chaos: Proving Linearizability Using Local Views
Proving the linearizability of highly concurrent data structures, such a...
research
∙
04/18/2018
On the Completeness of Verifying Message Passing Programs under Bounded Asynchrony
We address the problem of verifying message passing programs, defined as...
research
∙
04/14/2018
Reasoning About TSO Programs Using Reduction and Abstraction
We present a method for proving that a program running under the Total S...
research
∙
07/03/2017