Foundations of Algorithmic Verification and
Theoretical Computer Science; in particular:

Decision, control, and synthesis problems for discrete and continuous
linear dynamical systems (using tools from number theory,
Diophantine geometry, algebraic geometry)

Algorithmic analysis of real-time, probabilistic, and infinite-state systems
(e.g. model-checking and synthesis problems, complexity)

Logic in computer science (e.g. weak non-linear expansions of
Presburger arithmetic and MSO)
PhD Students:
Sanskar Agrawal, Piotr Bacik, Stef Nomden, Mihir Vahanwala, Emil Wieser
Postdocs:
Quentin Guilmant, Toghrul Karimov, Mikhail Starchak, Madhavan Venkatesh, Isa Vialard
Project Manager:
Taieb Oussaifi
Former Members and Visitors