Verification, probabilistic models, infinite-state systems, program analysis, automata theory.
- Highlights 2018 (invited talk): Efficient Analysis of Probabilistic Systems That Accumulate Quantities
- Concur 2018: Selective Monitoring
- ICALP 2018: On Computing the Total Variation Distance of Hidden Markov Models
- Probability and Computing (Michaelmas 2015, with S. Živný)
- Probability and Computing (Michaelmas 2014, with S. Živný)
- Probability and Computing (Michaelmas 2013, with S. Živný)
- PC member of 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. I hold 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.
- Mahsa Shirmohammadi (2014-2017)
- Qiyi Tang (2019-)
- Ines Marusic (co-supervised with M. Benedikt and J. Worrell), graduated 02/2017
- Cas Widdershoven: 2017-
- Oscar Darwin: 2018-