Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
438 Publications
2026 |
Published |
Conference Paper |
IST-REx-ID: 22006 |
M. Chalupa, T. A. Henzinger, N. E. Sarac, and E. Yu, “Quantitative monitoring of Signal First-Order logic,” in 27th International Symposium on Formal Methods, Tokyo, Japan, 2026, vol. 16557, pp. 214–233.
[Published Version]
View
| Files available
| DOI
| arXiv
2026 |
Published |
Journal Article |
IST-REx-ID: 21012 |
| 
|
C. Barrett, T. A. Henzinger, and S. A. Seshia, “Certificates in AI: Learn but verify,” Communications of the ACM, vol. 69, no. 1. Association for Computing Machinery, pp. 66–75, 2026.
[Published Version]
View
| Files available
| DOI
2026 |
Published |
Thesis | MS |
IST-REx-ID: 21401 |
M. Karimi, “Privacy-preserving runtime verification,” Institute of Science and Technology Austria, 2026.
[Published Version]
View
| Files available
| DOI
2026 |
Published |
Conference Paper |
IST-REx-ID: 22103 |
F. Cano Cordoba, “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, Marbella, Spain, 2026, vol. 5, pp. 4689–4696.
[Accepted Version]
View
| DOI
| Download Accepted Version (ext.)
2025 |
Published |
Journal Article |
IST-REx-ID: 20866 |
E. Bartocci, M. Chalupa, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Hypernode automata,” Acta Informatica, vol. 62, no. 4. Springer Nature, 2025.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 21020 |
T. A. Henzinger, M. Karimi, and K. S. Thejaswini, “Privacy-preserving runtime verification,” in Proceedings of the 2025 ACM SIGSAC Conference on Computer and Communications Security, Taipei, Taiwan, 2025, pp. 2774–2787.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 21089 |
M. Chalupa, T. A. Henzinger, and A. A. Oliveira da Costa, “Flavors of quantifiers in hyperlogics,” in 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Pilani, India, 2025, vol. 360, p. 20:1-20:18.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 21090 |
F. Cano Cordoba, T. A. Henzinger, and K. Kueffner, “Algorithmic fairness: A runtime perspective,” in 25th International Conference on Runtime Verification, Graz, Austria, 2025, vol. 16087, pp. 1–21.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 21091 |
T. A. Henzinger, K. Kueffner, and E. Yu, “Formal verification of neural certificates done dynamically,” in 25th International Conference on Runtime Verification, Graz, Austria, 2025, vol. 16087, pp. 54–72.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 21092 |
T. A. Henzinger, K. Kueffner, V. Singh, and I. Sun, “Alignment monitoring,” in 25th International Conference on Runtime Verification, Graz, Austria, 2025, vol. 16087, pp. 140–159.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 21093 |
M. Chalupa, T. A. Henzinger, and A. A. Oliveira da Costa, “Monitoring hypernode logic over infinite domains,” in 25th International Conference on Runtime Verification, Graz, Austria, 2025, vol. 16087, pp. 417–437.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 17094 |
|
|
E. Bartocci, T. Ferrere, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Information-flow interfaces,” Formal Methods in System Design, vol. 66. Springer Nature, pp. 3–48, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19499 |
S. Muroya Lei, K. Chatterjee, and T. A. Henzinger, “Hardware-optimal quantum algorithms,” Proceedings of the National Academy of Sciences, vol. 122, no. 12. National Academy of Sciences, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2025 |
Published |
Conference Paper |
IST-REx-ID: 19665 |
F. Cano Cordoba, T. A. Henzinger, B. Könighofer, K. Kueffner, and K. Mallik, “Fairness shields: Safeguarding against biased decision makers,” in Proceedings of the 39th AAAI Conference on Artificial Intelligence, Philadelphia, PA, United States, 2025, vol. 39, no. 15, pp. 15659–15668.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19668 |
E. Yu, D. Zikelic, and T. A. Henzinger, “Neural control and certificate repair via runtime monitoring,” in Proceedings of the 39th AAAI Conference on Artificial Intelligence, Philadelphia, PA, United States, 2025, vol. 39, no. 25, pp. 26409–26417.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19739 |
M. Chalupa and C. Richter, “BUBAAK: Dynamic cooperative verification,” in 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Hamilton, ON, Canada, 2025, vol. 15698, pp. 212–216.
[Published Version]
View
| Files available
| DOI
2025 |
Published |
Conference Paper |
IST-REx-ID: 19741 |
M. Chalupa, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Automating the analysis of quantitative automata with QuAK,” in 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2025, vol. 15696, pp. 303–312.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Journal Article |
IST-REx-ID: 19796 |
V. G. Trinh, K. H. Park, S. Pastva, and J. C. Rozum, “Mapping the attractor landscape of Boolean networks with biobalm,” Bioinformatics, vol. 41, no. 5. Oxford University Press, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
2025 |
Published |
Journal Article |
IST-REx-ID: 19854 |
S. Pastva, K. H. Park, O. Huvar, J. C. Rozum, and R. Albert, “An open problem: Why are motif-avoidant attractors so rare in asynchronous Boolean networks?,” Journal of Mathematical Biology, vol. 91. Springer Nature, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv