Tom Henzinger Group

Tom Henzinger’s group is interested in mathematical methods for improving the quality of software. More and more aspects of our lives are controlled by software and over 90% of the computing power is in places you wouldn’t expect, such as cell phones, kitchen appliances, and pacemakers. Computer software has, at the same time, become one of the most complicated artifacts produced by man. It is therefore unavoidable that software contains errors and vulnerabilities, and preventing and fixing software bugs is a major technological challenge.

List of research topics includes:

  • Analysis and synthesis of concurrent software
  • Quantitative modeling and verification of reactive systems
  • Predictability and robustness for real-time and embedded systems
  • Model checking biochemical reaction networks
  • Formal methods for neural networks
  • Formal methods for quantum computation
  • Run-time verification

Current group members

Léonard Brice photo
Léonard Brice
Postdoc

leonard.brice@ist.ac.at
 

Filip Cano Cordoba photo
Filip Cano Cordoba
Postdoc

filip.cano@ist.ac.at
 

Pavol Kebis photo
Pavol Kebis
PhD Student

Pavol.Kebis@ista.ac.at
 

Fabian Kresse photo
Fabian Kresse
PhD Student

Fabian.Kresse@ist.ac.at
 

Konstantin Kueffner photo
Konstantin Kueffner
PhD Student

konstantin.kueffner@ista.ac.at
 

Stefanie Muroya Lei photo
Stefanie Muroya Lei
PhD Student

Stefanie.MuroyaLei@ist.ac.at
 

Ana Oliveira da Costa photo
Ana Oliveira da Costa
Postdoc

ana.costa@ista.ac.at
 

Anton Varonka photo
Anton Varonka
Postdoc

Anton.Varonka@ist.ac.at
 

Past group members

PhD students
Masters
  • Mahyar Karimi (grad. 2026 )
Postdocs
Interns
  • Ayaan Bedi (2026 )
  • William Bailkoski (2026 )
  • Harun Yilmaz (2025 )
  • David Pape (2024, 2025 )
  • Ouldouz Neysari (2023 )
  • Stefanie Muroya Lei (2022 )
  • Pavol Kebis (2022 )
  • Mahyar Karimi (2022 )
  • Parand Alizadeh Alamdari (2019 )
  • Soroush Ebadian (2019 )
  • Milad Aghajohari (2018 )
  • Alexander Scharinger (2018 )
  • N. Ege Sarac (2017 )
  • Bharat Khandelwal (2017 )
  • Chris Wendler (2016 )
  • Shubham Goel (2016 )
  • Aviral Kumar (2016 )
  • Charmi Dedhia (2015 )
  • Pradyot Prakash (2015 )
  • Pratik Pramod Fegade (2014 )
  • Vansh Pahwa (2014 )
  • Matthias Loening (2013 )
  • Sameep Bagadia (2013 )
  • Alexandre Thevenet-Montagne (2012 )
  • Aditya Ayyar (2012 )
  • Vipul Singh (2012 )
  • Gopi Sivakanth (2011 )
  • Nishant Totla (2010, 2011 )
  • Rohit Singh (2010 )
  • Raluca Halalai (2010 )
  • Yashdeep Godhal (2010 )
Administrative Assistant
Ksenja Harpprecht
ksenja.harpprecht@ist.ac.at
+43 2243 9000 1015
Am Campus 1, A-3400 Klosterneuburg

Courses

Formalisms Every Computer Scientist Should Know
Tuesdays and Thursdays from 10:15 to 11:30 C_CS-3002_F24

We will talk about logics, automata, grammars, function calculi, and process calculi, with an emphasis on syntax, operational semantics, and denotational semantics. We will also learn how to write definitions and proofs at different levels of formality.

Seminars and events

Recent publications

Kebis P, LUCA F, OUAKNINE J, SCOONES A, WORRELL J. Transcendence for Pisot morphic words over an algebraic base. Ergodic Theory and Dynamical Systems. 2026:1-22. doi:10.1017/etds.2026.10324
Cano Cordoba F, Henzinger TA, Kueffner K. Energy shields for fairness. In: Proceedings of the 2026 ACM Conference on Fairness, Accountability, and Transparency. Association for Computing Machinery; 2026:4243-4275. doi:10.1145/3805689.3806807
Hatua A, Nguyen T, Cano Cordoba F, Sung A. Machine unlearning using forgetting neural networks. In: Proceedings of the 18th International Conference on Agents and Artificial Intelligence. Vol 2. SciTePress; 2026:1536-1546. doi:10.5220/0014326500004052
Chalupa M, Henzinger TA, Sarac NE, Yu E. Quantitative monitoring of Signal First-Order logic. In: 27th International Symposium on Formal Methods. Vol 16557. Springer Nature; 2026:214-233. doi:10.1007/978-3-032-26220-2_11
Avni G, Henzinger TA. Bidding Games. In: Fijalkow ‪Nathanaël, ed. Games on Graphs. From Logic and Automata to Algorithms. Cambridge University Press; 2026:529-569. doi:10.1017/9781009500678.022
Cano Cordoba F. Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants. In: Proceedings of the 18th International Conference on Agents and Artificial Intelligence. Vol 5. Science and Technology Publications; 2026:4689-4696. doi:10.5220/0014483200004052
Karimi M. Privacy-preserving runtime verification. 2026. doi:10.15479/AT-ISTA-21401
Barrett C, Henzinger TA, Seshia SA. Certificates in AI: Learn but verify. Communications of the ACM. 2026;69(1):66-75. doi:10.1145/3737447
Bartocci E, Chalupa M, Henzinger TA, Nickovic D, Oliveira da Costa A. Hypernode automata. Acta Informatica. 2025;62(4). doi:10.1007/s00236-025-00509-8
Chalupa M, Henzinger TA, Oliveira da Costa AA. Flavors of quantifiers in hyperlogics. In: 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:20:1-20:18. doi:10.4230/LIPICS.FSTTCS.2025.20

Current projects