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)
Automated verification of real-time, probabilistic, and infinite-state systems
(e.g. model-checking algorithms, synthesis problems, complexity)
Logic and applications to verification
Automated software analysis
Concurrency
PhD Students:
Piotr Bacik, Joris Nieuwveld, Mihir Vahanwala
Postdocs:
Quentin Guilmant, Gorav Jindal, Toghrul Karimov
Former Members and Visitors