Trinh G, Benhamou B, Pastva S, Soliman S. Scalable enumeration of trap spaces in boolean networks via answer set programming. In: Proceedings of the 38th AAAI Conference on Artificial Intelligence. Vol 38. Association for the Advancement of Artificial Intelligence; 2024:10714-10722. doi:10.1609/aaai.v38i9.28943
LibreCat: https://research-explorer.ista.ac.at/record/15321
DOI: 10.1609/aaai.v38i9.28943

Chalupa M, Richter C. Bubaak-SpLit: Split what you cannot verify (Competition contribution). In: 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 14572. Springer Nature; 2024:353–358. doi:10.1007/978-3-031-57256-2_20
LibreCat: https://research-explorer.ista.ac.at/record/15333
DOI: 10.1007/978-3-031-57256-2_20

Avni G, Mallik K, Sadhukhan S. Auction-based scheduling. In: 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 14572. Springer Nature; 2024:153-172. doi:10.1007/978-3-031-57256-2_8
LibreCat: https://research-explorer.ista.ac.at/record/15376
DOI: 10.1007/978-3-031-57256-2_8
arXiv: 2310.11798

Majumdar R, Saflam I, Thejaswini KS. Rabin games and colourful universal trees. In: 30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 14572. Springer Nature; 2024:213-231. doi:10.1007/978-3-031-57256-2_11
LibreCat: https://research-explorer.ista.ac.at/record/15377
DOI: 10.1007/978-3-031-57256-2_11
arXiv: 2401.07548

Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Oliveira da Costa A. Information-flow interfaces. Formal Methods in System Design. 2024. doi:10.1007/s10703-024-00447-0
LibreCat: https://research-explorer.ista.ac.at/record/17094
DOI: 10.1007/s10703-024-00447-0
arXiv: 2002.06465

Froleyks N, Yu Z, Biere A. Ternary simulation as abstract interpretation (Work in Progress). In: 27th Workshop on Methods and Description Languages for Modeling and Verification of Circuits and Systems. ; :148-151.
LibreCat: https://research-explorer.ista.ac.at/record/17053

Chalupa M, Henzinger TA. Bubaak: Runtime monitoring of program verifiers. In: Tools and Algorithms for the Construction and Analysis of Systems. Vol 13994. Springer Nature; 2023:535-540. doi:10.1007/978-3-031-30820-8_32
LibreCat: https://research-explorer.ista.ac.at/record/12854
DOI: 10.1007/978-3-031-30820-8_32

Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. Vamos: Middleware for best-effort third-party monitoring. In: Fundamental Approaches to Software Engineering. Vol 13991. Springer Nature; 2023:260-281. doi:10.1007/978-3-031-30826-0_15
LibreCat: https://research-explorer.ista.ac.at/record/12856
DOI: 10.1007/978-3-031-30826-0_15

Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria; 2023. doi:10.15479/AT:ISTA:12407
LibreCat: https://research-explorer.ista.ac.at/record/12407
DOI: 10.15479/AT:ISTA:12407

Chatterjee K, Henzinger TA, Lechner M, Zikelic D. A learner-verifier framework for neural network controllers and certificates of stochastic systems. In: Tools and Algorithms for the Construction and Analysis of Systems . Vol 13993. Springer Nature; 2023:3-25. doi:10.1007/978-3-031-30823-9_1
LibreCat: https://research-explorer.ista.ac.at/record/13142
DOI: 10.1007/978-3-031-30823-9_1

Anand A, Mallik K, Nayak SP, Schmuck AK. Computing adequately permissive assumptions for synthesis. In: TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems. Vol 13994. Springer Nature; 2023:211-228. doi:10.1007/978-3-031-30820-8_15
LibreCat: https://research-explorer.ista.ac.at/record/13141
DOI: 10.1007/978-3-031-30820-8_15

Henzinger TA, Mazzocchi NA, Sarac NE. Quantitative safety and liveness. In: 26th International Conference Foundations of Software Science and Computation Structures. Vol 13992. Springer Nature; 2023:349-370. doi:10.1007/978-3-031-30829-1_17
LibreCat: https://research-explorer.ista.ac.at/record/12467
DOI: 10.1007/978-3-031-30829-1_17
arXiv: 2301.11175

Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. Regular methods for operator precedence languages. In: 50th International Colloquium on Automata, Languages, and Programming. Vol 261. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023:129:1--129:20. doi:10.4230/LIPIcs.ICALP.2023.129
LibreCat: https://research-explorer.ista.ac.at/record/13292
DOI: 10.4230/LIPIcs.ICALP.2023.129
arXiv: 2305.03447

Lechner M, Amini A, Rus D, Henzinger TA. Revisiting the adversarial robustness-accuracy tradeoff in robot learning. IEEE Robotics and Automation Letters. 2023;8(3):1595-1602. doi:10.1109/LRA.2023.3240930
LibreCat: https://research-explorer.ista.ac.at/record/12704
DOI: 10.1109/LRA.2023.3240930
WoS: 000936534100012
arXiv: 2204.07373

Benes N, Brim L, Huvar O, Pastva S, Safránek D. Boolean network sketches: A unifying framework for logical model inference. Bioinformatics. 2023;39(4). doi:10.1093/bioinformatics/btad158
LibreCat: https://research-explorer.ista.ac.at/record/12876
DOI: 10.1093/bioinformatics/btad158
WoS: 000976610800001
PMID: 37004199

Lechner M, Zikelic D, Chatterjee K, Henzinger TA, Rus D. Quantization-aware interval bound propagation for training certifiably robust quantized neural networks. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence. Vol 37. Association for the Advancement of Artificial Intelligence; 2023:14964-14973. doi:10.1609/aaai.v37i12.26747
LibreCat: https://research-explorer.ista.ac.at/record/14242
DOI: 10.1609/aaai.v37i12.26747
arXiv: 2211.16187

Avni G, Jecker IR, Zikelic D. Bidding graph games with partially-observable budgets. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence. Vol 37. ; 2023:5464-5471. doi:10.1609/aaai.v37i5.25679
LibreCat: https://research-explorer.ista.ac.at/record/14243
DOI: 10.1609/aaai.v37i5.25679
arXiv: 2211.13626

Henzinger TA, Karimi M, Kueffner K, Mallik K. Monitoring algorithmic fairness. In: Computer Aided Verification. Vol 13965. Springer Nature; 2023:358–382. doi:10.1007/978-3-031-37703-7_17
LibreCat: https://research-explorer.ista.ac.at/record/13310
DOI: 10.1007/978-3-031-37703-7_17
arXiv: 2305.15979

Boker U, Henzinger TA, Mazzocchi NA, Sarac NE. Safety and liveness of quantitative automata. In: 34th International Conference on Concurrency Theory. Vol 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.CONCUR.2023.17
LibreCat: https://research-explorer.ista.ac.at/record/13221
DOI: 10.4230/LIPIcs.CONCUR.2023.17
arXiv: 2307.06016

Bartocci E, Henzinger TA, Nickovic D, Oliveira da Costa A. Hypernode automata. In: 34th International Conference on Concurrency Theory. Vol 279. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.CONCUR.2023.21
LibreCat: https://research-explorer.ista.ac.at/record/14405
DOI: 10.4230/LIPIcs.CONCUR.2023.21
arXiv: 2305.02836