(PLDI 2020) Inductive Sequentialization of Asynchronous Programs
Asynchronous programs are notoriously difficult to reason about because they spawn computation tasks which take effect asynchronously in a non-deterministic way. Devising inductive invariants for such programs requires understanding and stating complex relationships between an unbounded number of computation tasks in arbitrarily long executions. In this paper, we introduce inductive sequentialization, a new proof rule that sidesteps this complexity via a sequential reduction, a sequential program that captures every behavior of the original program up to reordering of coarse-grained commutative actions. A sequential reduction of a concurrent program is easy to reason about since it corresponds to a simple execution of the program in an idealized synchronous environment, where processes act in a fixed order and at the same speed. We have implemented and integrated our proof rule in the CIVL verifier, allowing us to provably derive fine-grained implementations of asynchronous programs. We have successfully applied our proof rule to a diverse set of message-passing protocols, including leader election protocols, Two-Phase Commit, and Paxos.
Wed 15 JunDisplayed time zone: Pacific Time (US & Canada) change
15:30 - 16:50
|(PLDI 2020) Inductive Sequentialization of Asynchronous Programs|
|(PLDI 2021) When Threads Meet Events: Efficient and Precise Static Race Detection with Origins|
|(POPL 2021) Optimal Prediction of Synchronization-Preserving Races|
|(POPL 2022) Visibility Reasoning for Concurrent Snapshot Algorithms|