I am occupying a post-doc position (adiunkt naukowy) in the computer science institute of the University of Warsaw (MIMUW), where I am part of the project «A unified theory of finite-state recognisability» lead by Mikołaj Bojanczyk. In this project, I am working with Bruno Guillon, Laure Daviaud and Sreejith Ajithkumar Vijayalekshmi. We are currently working on the characterisation of graphs describing the origin semantics of streaming transducers (and their extensions), and on the decidability of logics over words (i.e. determine which predicate can be added to MSO/FO while retaining decidability).
Last year, I had a half-time ATER position in the Laboratoire d’Informatique Gaspard Monge (Champs-sur-Marne) until January, after which I visited Matthew Hague in the computer science department of the Royal Holloway university of London (Egham). We worked on extending verification techniques for higher order models to models which include an arborescent behaviour.
In general, I am mainly interested in the study of infinite graphs, and the model-checking problem over them. During my PhD, I worked on the class of graphs defined by higher-order stack tree rewriting systems, and on the study of counter systems and their trace languages, essentially for flat counter systems and vector addition systems. I did my PHD in the Laboratoire d’Informatique Gaspard Monge (Champs-sur-Marne) with Didier Caucal and Antoine Meyer.