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.
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.
Regular group seminar held each Tuesday at ISTA.
A joint seminar with FORSYTE group at TU Wien.
| 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 |