Iris is a framework for higher-order concurrent separation logic, which has been implemented in the Coq proof assistant and deployed very effectively in a wide variety of verification projects. These projects include but are not limited to: verification of fine-grained concurrent data structures, logical-relations for relational reasoning, program logics for relaxed memory models, program logics for object capabilities, and a safety proof for a realistic subset of the Rust programming language. In this tutorial, you will learn how use the Iris framework to reason about concurrent programs. This tutorial will be hands-on: we will use the Coq implementation of Iris to mechanize our proofs. It is recommended to come with Coq and Iris pre-installed on your machine so that you can play with Iris yourself.

Mon 8 Jan

Displayed time zone: Tijuana, Baja California change

14:00 - 15:30
Iris - A Higher-Order Concurrent Separation LogicTutorialFest at Museum B
14:00
90m
Talk
Iris - A Modular Foundation for Higher-Order Concurrent Separation Logic.
TutorialFest
Jacques-Henri Jourdan CNRS, LRI, Université Paris-Sud, A: Robbert Krebbers Delft University of Technology
Media Attached
16:00 - 17:00
Iris - A Higher-Order Concurrent Separation LogicTutorialFest at Museum B
16:00
60m
Talk
Iris - A Modular Foundation for Higher-Order Concurrent Separation Logic.
TutorialFest
Jacques-Henri Jourdan CNRS, LRI, Université Paris-Sud, A: Robbert Krebbers Delft University of Technology
Media Attached