Write a Blog >>
PLDI 2020
Mon 15 - Fri 19 June 2020
Wed 17 Jun 2020 10:40 - 11:00 at PLDI Research Papers live stream - Verification I Chair(s): Stephen N. Freund

Concurrent separation logics have had great success reasoning about
concurrent data structures.
This success stems from their application of modularity on multiple levels, leading to proofs that are decomposed according to program structure, program state, and individual threads.
Despite these advances, it remains difficult to achieve proof reuse across
different data structure implementations.
For the large class of \emph{search structures}, we demonstrate how one can achieve further proof modularity by decoupling the proof of thread safety from the proof of structural integrity.
We base our work on the \emph{template} algorithms of Shasha and
Goodman that dictate how threads interact but abstract from the
concrete layout of nodes in memory.
Building on the recently proposed flow framework of compositional abstractions and the separation logic Iris, we show how to prove correctness of template algorithms, and how to instantiate them to obtain multiple verified implementations.

We demonstrate our approach by mechanizing the proofs of three concurrent search
structure templates, based on link, give-up, and lock-coupling synchronization, and deriving verified implementations based on B-trees, hash tables, and linked lists.
These case studies include algorithms used in real-world file systems
and databases, which have been beyond the capability of prior automated or mechanized verification techniques.
In addition, our approach reduces proof complexity and is able to achieve significant proof reuse.

Wed 17 Jun

Displayed time zone: Pacific Time (US & Canada) change

10:40 - 12:00
Verifying Concurrent Search Structure Templates
PLDI Research Papers
Siddharth Krishna Microsoft Research, Cambridge, Nisarg Patel New York University, USA, Dennis Shasha New York University, USA, Thomas Wies New York University, USA
Armada: Low-Effort Verification of High-Performance Concurrent Programs
PLDI Research Papers
Jacob R. Lorch Microsoft Research, USA, Yixuan Chen University of Michigan, USA / Yale University, USA, Manos Kapritsos University of Michigan, USA, Bryan Parno Carnegie Mellon University, USA, Shaz Qadeer Novi, USA, Upamanyu Sharma University of Michigan, USA, James R. Wilcox Certora, USA, Xueyuan Zhao Carnegie Mellon University, USA
Decidable Verification under a Causally Consistent Shared Memory
PLDI Research Papers
Ori Lahav Tel Aviv University, Israel, Udi Boker IDC Herzliya, Israel
Inductive Sequentialization of Asynchronous Programs
PLDI Research Papers
Bernhard Kragl IST Austria, Constantin Enea University of Paris Diderot, France, Thomas A. Henzinger IST Austria, Austria, Suha Orhun Mutluergil IRIF, France / University of Paris, France / CNRS, France, Shaz Qadeer Novi, USA