We present two novel algorithms for learning formulas in Linear Temporal Logic (LTL) from
examples. The first learning algorithm reduces the learning task to a series of satisfiability …

Distributed systems have become the backbone of cloud computing. Incorrect system
designs and implementations can greatly impair the reliability of distributed systems …

Transactions simplify concurrent programming by enabling computations on shared data
that are isolated from other concurrent computations and are resilient to failures. Modern …

Modern cluster managers like Borg, Omega and Kubernetes rely on the state-reconciliation
principle to be highly resilient and extensible. In these systems, all cluster-management …

Grey-box fuzzing is the lightweight approach of choice for finding bugs in sequential
programs. It provides a balance between efficiency and effectiveness by conducting a …

Despite their wide deployment, distributed systems remain notoriously hard to reason about.
Unexpected interleavings of concurrent operations and failures may lead to undefined …

This paper describes the design and implementation of the open-source tool for testing
concurrent programs written in the language. provides algorithmic capabilities to explore the …

High performance architectures for processing distributed data streams, such as Flink, Spark
Streaming, and Storm, are increasingly deployed in emerging data-driven computing …

Distributed and concurrent applications often have subtle bugs that only get exposed under
specific schedules. While these schedules may be found by systematic model checking …

Byzantine fault-tolerant algorithms promise agreement on a correct value, even if a subset of
processes can deviate from the algorithm arbitrarily. While these algorithms provide strong …