We consider the problem of making apps fault-tolerant through replication, when apps
operate at the microsecond scale, as in finance, embedded computing, and microservices …

Conflict-free replicated data types (CRDTs) are a promising tool for designing scalable,
coordination-free distributed systems. However, constructing correct CRDTs is difficult …

Distributed system replication is widely used as a means of fault-tolerance and scalability.
However, it provides a spectrum of consistency choices that impose a dilemma for clients …

To ease the development of geo-distributed applications, replicated data types (RDTs) offer
a familiar programming interface while ensuring state convergence, low latency, and high …

Programming concurrent, distributed systems is hard—especially when these systems
mutate shared, persistent state replicated at geographic scale. To enable high availability …

Feature stores (also sometimes referred to as embedding stores) are becoming ubiquitous
in model serving systems: downstream applications query these stores for auxiliary inputs at …

The reactive programming paradigm aims to simplify the development of reactive systems. It
provides abstractions to define time-changing values that are automatically updated by the …

Storage systems based on Weak Consistency provide better availability and lower latency
than systems that use Strong Consistency, especially in geo-replicated settings. However …

We present a framework for efficient stateless model checking (SMC) of concurrent
programs under three prominent models of causal consistency, CCv, CM, CC. Our approach …

Despite decades of research and practical experience, developers have few tools for
programming reliable distributed applications without resorting to expensive coordination …