Paper accepted at LICS 2022: 'The complexity of soundness in workflow nets' (with Michael Blondin and Filip Mazowiecki); Paper accepted at CAV 2022: 'Verifying generalised and structural soundness of workflow nets via relaxations' (with Michael Blondin and Filip Mazowiecki); Paper accepted at LICS 2021: 'Continuous One Counter Automata' (with Michael Blondin, Tim Leys, Filip Mazowiecki, and Guillermo Alberto Perez). Presented work on enabling the Apalache model checker to reason about temporal properties beyond safety at the TLA+ conference.
Research Experience
Ph.D. student at Université de Sherbrooke and Max Planck Institute for Software Systems, co-supervised by Michael Blondin and Filip Mazowiecki. Worked as a student assistant in the PaVeS research group.
Education
Bachelor's degree in Informatics from Technical University of Munich (2018); Master's degree in Informatics from Technical University of Munich (2019), supervised by Christoph Welzel for the master’s thesis.
Background
Research interests: formal verification, particularly of infinite-state systems. The overarching goal is to enable the development of more robust systems. Personally, also interested in the Internet-of-Things and artificial intelligence.