Published several papers, such as 'Integer linear-exponential programming in NP by quantifier elimination' (ICALP'24), 'The complexity of Presburger arithmetic with power or powers' (ICALP'23), and others.
Research Experience
Before joining IMDEA, he was a Research Associate in the Automated Verification Group at the University of Oxford. His current research projects include non-linear existential arithmetic theories, advanced reasoning in arithmetic theories, and reachability predicates in separation logic.
Education
PhD in Computer Science from École Normale Supérieure Paris-Saclay, supervised by Stéphane Demri and Étienne Lozes.
Background
Assistant Professor at the IMDEA Software Institute, with research interests in non-linear existential arithmetic theories and advanced reasoning in arithmetic theories.
Miscellany
His research is currently funded by the European Union under an MSCA Fellowship (GA 101154447).