Verifying distributed programs via canonical sequentialization
Citations Over TimeTop 10% of 2017 papers
Abstract
We introduce canonical sequentialization, a new approach to verifying unbounded, asynchronous, message-passing programs at compile-time. Our approach builds upon the following observation: due the combinatorial explosion in complexity, programmers do not reason about their systems by case-splitting over all the possible execution orders. Instead, correct programs tend to be well-structured so that the programmer can reason about a small number of representative executions, which we call the program’s canonical sequentialization. We have implemented our approach in a tool called Brisk that synthesizes canonical sequentializations for programs written in Haskell, and evaluated it on a wide variety of distributed systems including benchmarks from the literature and implementations of MapReduce, two-phase commit, and a version of the Disco distributed file-system. We show that unlike model checking, which gets prohibitively slow with just 10 processes Brisk verifies the unbounded versions of the benchmarks in tens of milliseconds, yielding the first concurrency verification tool that is fast enough to be integrated into a design-implement-check cycle.
Related Papers
- Proceedings of the first ACM SIGPLAN symposium on Haskell(2008)
- → Proceedings of the 2006 ACM SIGPLAN workshop on Haskell(2006)4 cited
- → Proceedings of the first ACM SIGPLAN symposium on Haskell(2008)1 cited
- → Haskell_#: Coordinating Functional Processes(2012)
- → Tuning the Performance of Haskell Parallel Programs Using GC-Tune(2017)