About

I find the following things interesting

Finite automata on infinite objects and their transformations, games of infinite duration played on finite graphs and algorithms to find winning strategies for them.
Reactive synthesis, program synthesis, model-checking.
Logic to specify, evaluate and verify the behaviour of programs, systems and agents.
Functional programming languages like F#, OCaml, Haskell (because they’re fun 😉 to build type-safe programs in)
Sports. Haven’t played one myself in a long while but I enjoy watching football, combat sports, sumo wrestling.
Coffee, manual brews roasted on the lighter side.

I have previously worked at

Clear as a Software Engineer.
School of Computer Science, University of Nottingham as a Research Fellow in the AGENTS lab.
CAU Kiel as a Researcher in the Theoretical Computer Science Group.