Fri 12 Jan 2018 16:15 - 16:40 at Watercourt - Types for State Chair(s): Neel Krishnaswami

We provide a practical way to ease the verification of programs whose state evolves monotonically. The main idea is that a property witnessed in a prior state can be recalled in the current state, provided (1) state evolves according to a given preorder, and (2) the property is preserved by this preorder. In many realistic scenarios, such monotonic reasoning yields concise modular proofs, saving the need for explicit program invariants. We distill our approach into the monotonic-state monad, a general yet compact interface for Hoare-style reasoning about monotonic state in a dependently typed language. We prove the soundness of the monotonic-state monad and use it as a unified foundation for reasoning about monotonic state in the F* verification system. Based on this foundation, we build libraries for various mutable data structures like monotonic references and apply these libraries at scale to the verification of several distributed applications.

Fri 12 Jan

POPL-2018-papers
15:50 - 17:05: Research Papers - Types for State at Watercourt
Chair(s): Neel KrishnaswamiComputer Laboratory, University of Cambridge
POPL-2018-papers15:50 - 16:15
Talk
Amin Timanyimec-Distrinet KU-Leuven, Leo StefanescoENS Lyon, Morten Krogh-JespersenAarhus University, Lars BirkedalAarhus University
POPL-2018-papers16:15 - 16:40
Talk
Danel AhmanInria Paris, Cédric FournetMicrosoft Research, Cătălin HriţcuInria Paris, Kenji MaillardInria Paris and ENS Paris, Aseem RastogiMicrosoft Research, Nikhil SwamyMicrosoft Research
Pre-print
POPL-2018-papers16:40 - 17:05
Talk
Ralf JungMPI-SWS, Jacques-Henri JourdanCNRS, LRI, Université Paris-Sud, Robbert KrebbersDelft University of Technology, Derek DreyerMPI-SWS