Modern programming languages such as Scala, Java, and Rust are examples of concurrent higher-order imperative programming languages.
In this talk I will introduce our research on Iris, a logical framework, implemented and verified in the Coq proof assistant, which can be used for mathematical reasoning about safety and correctness of concurrent higher-order imperative programs. (See iris-project.org for more about Iris.)
Lars Birkedal is Professor of Computer Science at Aarhus University. He received his Ph.D. in Computer Science from Carnegie Mellon University, USA, in Dec. 1999 and until Dec. 2012 he was at the IT University of Copenhagen, Denmark. He served as Head of Department of Computer Science in Aarhus from 2014 to 2017.
Lars Birkedal is a Fellow of the ACM, an elected member of the Royal Danish Academy of Sciences and Letters, the recipient of a Villum Investigator grant from the Villum Foundation 2019, the Danish Minister of Research Elite Research Award 2015, and the ACM SIGPLAN Milner Award 2013. Lars Birkedal’s main research interests lie in the area of logic and semantics of programming languages and type theories. Current work focuses on program logics for reasoning about concurrent, higher-order, and imperative programs; cyber-security; and type theories with guarded recursion.
Host: Martin Odersky and Viktor Kuncak