LogSem Seminar, 2024
A seminar series on program verification, logic, semantics, type theory, proof assistants and related topics.
The presentation format is pretty open. Everyone is welcome (and encouraged!) to present previous/current work, explain interesting papers, give tutorial talks on topics they find worth sharing. Typically, it is a 45 min presentation + 15 min discussion, but, of course, flexible.
We meet on Mondays from 13:00 to 15:00. Currently all meetings are either in-person (in Ada-333 unless otherwise stated) or virtual on Zoom.
This meeting is organized by Alejandro Aguirre and Sergei Stepanenko.
A preliminary schedule is available below.
Date | Who | Topic |
---|---|---|
September 30, 2024 | Sergei Stepanenko, Aarhus University | Introduction to Guarded Interaction Trees |
October 07, 2024 | Arnaud Daby-Seesaram, Aarhus University | Osiris: an Iris-based program logic for OCaml |
October 10, 2024 | Justin Hsu, Cornell University | Type Systems for Numerical Error Analysis |
October 14, 2024 | Maxime Robert Sébastien Legoupil, Aarhus University | Iris-MSWasm: Elucidating and Mechanising the Security Invariants of Memory-Safe WebAssembly |
October 21, 2024 | Kwing Hei Li, Aarhus University | How to deal with rejections – Separation logics for probability |
October 28, 2024 | Armaël Guéneau, INRIA | The state of the Creusot verifier |
November 04, 2024 | Jean Pichon-Pharabod, Aarhus University | Synchronous Programming for Kids: A Manifesto |
November 18, 2024 | Amal Ahmed, Northeastern University | Formally Specifying ABIs using Realistic Realizability |
November 25, 2024 | Zongyuan Liu, Aarhus University | Reasoning about concurrency with graphs instead of heaps in Iris |
December 02, 2024 | Steffan Christ Sølvsten, Aarhus University | Correctness of Time-forward Processing Algorithms |
December 09, 2024 | Ilya Sergey, National University of Singapore | Compositional Verification of Composite Byzantine Protocols |
December 10, 2024 | Ilya Sergey, National University of Singapore | Mechanised Hypersafety Proofs about Structured Data |