ETAPS 2019
Sat 6 - Thu 11 April 2019 Prague, Czech Republic
Wed 10 Apr 2019 11:30 - 12:00 at SUN II - Security and Incremental Computation Chair(s): Zhong Shao

Memory management in lock-free data structures remains a major challenge in concurrent programming. Design techniques including read-copy-update (RCU) and hazard pointers provide workable solutions, and are widely used to great effect. These techniques rely on the concept of a grace period: nodes that should be freed are placed on a deferred free list, and all threads obey a protocol to ensure that the deallocating thread can detect when all possible readers have completed their use of the object. This provides an approach to safe deallocation, but only when these subtle protocols are implemented correctly. We present a static type system to ensure correct use of RCU memory management: that nodes removed from a data structure are always scheduled for subsequent deallocation, and that nodes are scheduled for deallocation at most once. As part of our soundness proof, we give an abstract semantics for RCU memory management primitives which captures the fundamental properties of RCU. Our type system allows us to give the first proofs of memory safety for RCU linked list and binary search tree implementations without requiring full verification.

Wed 10 Apr

Displayed time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change

10:30 - 12:30
Security and Incremental ComputationESOP at SUN II
Chair(s): Zhong Shao Yale University
10:30
30m
Talk
Robustly Safe Compilation
ESOP
Marco Patrignani Stanford University & CISPA Helmholtz Center for Information Security, Deepak Garg Max Planck Institute for Software Systems
Link to publication
11:00
30m
Talk
Compiling Sandboxes: Formally Verified Software Fault Isolation
ESOP
Frédéric Besson , Sandrine Blazy Univ Rennes- IRISA, Alexandre Dang , Thomas P. Jensen INRIA Rennes, Pierre Wilke Yale University
Link to publication
11:30
30m
Talk
Safe Deferred Memory Reclamation with Types
ESOP
Ismail Kuru Drexel University, Colin Gordon Drexel University
Link to publication
12:00
30m
Talk
Incremental λ-Calculus in Cache-Transfer Style, Static Memoization by Program Transformation
ESOP
Paolo G. Giarrusso TU Delft, The Netherlands, Yann Régis-Gianas IRIF, University Paris Diderot and CNRS, France / INRIA PI.R2, Philipp Schuster University of Tübingen, Germany
Link to publication