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.
428 Publications
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 of the United States of America, vol. 122, no. 12. National Academy of Sciences, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| PubMed | Europe PMC
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
2025 | Published | Journal Article | IST-REx-ID: 20186 |
| 
|
T. H. Hsu, A. A. Oliveira da Costa, A. Wintenberg, E. Bartocci, and B. Bonakdarpour, “Gray-box runtime enforcement of hyperproperties,” Acta Informatica, vol. 62, no. 3. Springer Nature, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
2025 | Published | Conference Paper | IST-REx-ID: 20253 |
T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Quantitative language automata,” in 36th International Conference on Concurrency Theory, Aarhus, Denmark, 2025, vol. 348.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20225 |
T. A. Henzinger, K. Mallik, P. Sadeghi, and D. Zikelic, “Supermartingale certificates for quantitative omega-regular verification and control,” in 37th International Conference on Computer Aided Verification, Zagreb, Croatia, 2025, vol. 15932, pp. 29–55.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20189 |
N. Froleyks, E. Yu, M. Preiner, A. Biere, and K. Heljanko, “Introducing certificates to the hardware model checking competition,” in 37th International Conference on Computer Aided Verification, Zagreb, Croatia, 2025, vol. 15931, pp. 281–295.
[Published Version]
View
| Files available
| DOI
| WoS
2025 | Published | Thesis | IST-REx-ID: 20147 |
N. E. Sarac, “A monitoring-oriented theory and classification of quantitative specifications,” Institute of Science and Technology Austria, 2025.
[Published Version]
View
| Files available
| DOI
2025 | Published | Journal Article | IST-REx-ID: 20342 |
|
|
U. Boker, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “ Safety and liveness of quantitative properties and automata,” Logical Methods in Computer Science, vol. 21, no. 2. EPI Sciences, 2025.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Book Chapter | IST-REx-ID: 20723 |
E. Bartocci, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Information-Flow Interfaces and Security Lattices,” in Engineering Safe and Trustworthy Cyber Physical Systems, vol. 15471, Cham: Springer Nature, 2025, pp. 251–263.
[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: 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
2024 | Published | Journal Article | IST-REx-ID: 14400 |
R. Majumdar, K. Mallik, A. K. Schmuck, and S. Soudjani, “Symbolic control for stochastic systems via finite parity games,” Nonlinear Analysis: Hybrid Systems, vol. 51, no. 2. Elsevier, 2024.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18955 |
A. Casares, M. Pilipczuk, M. Pilipczuk, U. S. Souza, and K. S. Thejaswini, “Simple and tight complexity lower bounds for solving Rabin games,” in 2024 Symposium on Simplicity in Algorithms, Alexandria, VA, United States, 2024, pp. 160–167.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15321 |
G. Trinh, B. Benhamou, S. Pastva, and S. Soliman, “Scalable enumeration of trap spaces in boolean networks via answer set programming,” in Proceedings of the 38th AAAI Conference on Artificial Intelligence, 2024, vol. 38, no. 9, pp. 10714–10722.
[Published Version]
View
| DOI
| Download Published Version (ext.)
2024 | Published | Conference Paper | IST-REx-ID: 15333 |
M. Chalupa and C. Richter, “Bubaak-SpLit: Split what you cannot verify (Competition contribution),” in 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Luxembourg City, Luxembourg, 2024, vol. 14572, pp. 353–358.
[Published Version]
View
| Files available
| DOI
| WoS
2024 | Published | Conference Paper | IST-REx-ID: 15376 |
G. Avni, K. Mallik, and S. Sadhukhan, “Auction-based scheduling,” in 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Luxembourg City, Luxembourg, 2024, vol. 14572, pp. 153–172.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15377 |
R. Majumdar, I. Sağlam, and K. S. Thejaswini, “Rabin games and colourful universal trees,” in 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2024, vol. 14572, pp. 213–231.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv