Verification, probabilistic models, infinite-state systems, program analysis, automata theory.
- On the State Complexity of Complementing Unambiguous Finite Automata
- ICALP 2020 (invited talk): How to Play in Infinite MDPs
- Probability and Computing (with S. Živný): Michaelmas 2013, Michaelmas 2014, Michaelmas 2015
- Linear Algebra: Michaelmas 2021, Michaelmas 2022, Michaelmas 2023
- co-PC chair of FoSSaCS'21
- Invited speaker at TASE'23, Trends in Concurrency Theory'22, ICALP'20, Highlights of Logic, Games and Automata'18
- PC member of MFCS'24, LICS'23, ICALP'23, Concur'22, MFCS'21, FSTTCS'19, LICS'19, TACAS'19, Concur'18, CAV'18, FoSSaCS'18, FCT'17, ICALP'17, CAV'17, STACS'16, MEMICS'15, Highlights'15
- Instructor at the ENS Lyon winter school 2015 on Probabilistic Techniques and Models in Computer Science
- Member of the EPSRC Peer Review College, since 2014
I received my undergraduate degree in computer science at the University of Stuttgart in 2005. I completed my doctoral degree (Dr. rer. nat., summa cum laude) at the TU München in 2009 under the supervision of Javier Esparza. From 2009 to 2013 I had postdoctoral positions, including a DAAD postdoctoral fellowship, at the University of Oxford. From 2013 to 2021 I held a Royal Society University Research Fellowship for my project on Quantitative Analysis of Infinite-State Systems. In 2013 I became a Research Lecturer and in 2014 an Associate Professor at the Oxford University Department of Computer Science. Since 2017 I am the Tutorial Fellow in Computer Science at St John's College, and since 2023 Professor of Computer Science at the University of Oxford.
- Ines Marusic (co-supervised with M. Benedikt and J. Worrell), graduated 02/2017
- Cas Widdershoven: 2017-2022
- Oscar Darwin: 2018-2023