Lechner, Mathias, et al. “Quantization-Aware Interval Bound Propagation for Training Certifiably Robust Quantized Neural Networks.”10.1609/aaai.v37i12.26747__Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 12, Association for the Advancement of Artificial Intelligence, 2023, pp. 14964–73, 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, Guy, et al. “Bidding Graph Games with Partially-Observable Budgets.”10.1609/aaai.v37i5.25679__Proceedings of the 37th AAAI Conference on Artificial Intelligence, vol. 37, no. 5, 2023, pp. 5464–71, 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, Thomas A., et al. “Monitoring Algorithmic Fairness.”10.1007/978-3-031-37703-7_17__Computer Aided Verification, vol. 13965, Springer Nature, 2023, pp. 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, Udi, et al. “Safety and Liveness of Quantitative Automata.”10.4230/LIPIcs.CONCUR.2023.17__34th International Conference on Concurrency Theory, vol. 279, 17, 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, Ezio, et al. “Hypernode Automata.”10.4230/LIPIcs.CONCUR.2023.21__34th International Conference on Concurrency Theory, vol. 279, 21, 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

Henzinger, Thomas A., et al. “Monitoring Algorithmic Fairness under Partial Observations.”10.1007/978-3-031-44267-4_15__23rd International Conference on Runtime Verification, vol. 14245, Springer Nature, 2023, pp. 291–311, doi:10.1007/978-3-031-44267-4_15.
LibreCat: https://research-explorer.ista.ac.at/record/14454
DOI: 10.1007/978-3-031-44267-4_15
arXiv: 2308.00341

Avni, Guy, et al. “Reachability Poorman Discrete-Bidding Games.”10.3233/FAIA230264__Frontiers in Artificial Intelligence and Applications, vol. 372, IOS Press, 2023, pp. 141–48, doi:10.3233/FAIA230264.
LibreCat: https://research-explorer.ista.ac.at/record/14518
DOI: 10.3233/FAIA230264
arXiv: 2307.15218

Ansaripour, Matin, et al. “Learning Provably Stabilizing Neural Controllers for Discrete-Time Stochastic Systems.”10.1007/978-3-031-45329-8_17__21st International Symposium on Automated Technology for Verification and Analysis, vol. 14215, Springer Nature, 2023, pp. 357–79, doi:10.1007/978-3-031-45329-8_17.
LibreCat: https://research-explorer.ista.ac.at/record/14559
DOI: 10.1007/978-3-031-45329-8_17

Trinh, Van Giang, et al. “Trap Spaces of Multi-Valued Networks: Definition, Computation, and Applications.”10.1093/bioinformatics/btad262__Bioinformatics, vol. 39, no. Supplement_1, Oxford Academic, 2023, pp. i513–22, doi:10.1093/bioinformatics/btad262.
LibreCat: https://research-explorer.ista.ac.at/record/13263
DOI: 10.1093/bioinformatics/btad262
WoS: 001027457000060
PMID: 37387165

Majumdar, Rupak, et al. “Symbolic Control for Stochastic Systems via Finite Parity Games.”10.1016/j.nahs.2023.101430__Nonlinear Analysis: Hybrid Systems, vol. 51, 101430, Elsevier, 2023, doi:10.1016/j.nahs.2023.101430.
LibreCat: https://research-explorer.ista.ac.at/record/14400
DOI: 10.1016/j.nahs.2023.101430
WoS: 001093188100001
arXiv: 2101.00834