Trinh, Giang, et al. “Scalable Enumeration of Trap Spaces in Boolean Networks via Answer Set Programming.”10.1609/aaai.v38i9.28943__Proceedings of the 38th AAAI Conference on Artificial Intelligence, vol. 38, no. 9, Association for the Advancement of Artificial Intelligence, 2024, pp. 10714–22, doi:10.1609/aaai.v38i9.28943.

Chalupa, Marek, and Cedric Richter. “Bubaak-SpLit: Split What You Cannot Verify (Competition Contribution).”10.1007/978-3-031-57256-2_20__30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 14572, Springer Nature, 2024, pp. 353–358, doi:10.1007/978-3-031-57256-2_20.

Avni, Guy, et al. “Auction-Based Scheduling.”10.1007/978-3-031-57256-2_8__30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 14572, Springer Nature, 2024, pp. 153–72, doi:10.1007/978-3-031-57256-2_8.

Majumdar, Rupak, et al. “Rabin Games and Colourful Universal Trees.”10.1007/978-3-031-57256-2_11__30th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 14572, Springer Nature, 2024, pp. 213–31, doi:10.1007/978-3-031-57256-2_11.

Chalupa, Marek, and Thomas A. Henzinger. “Bubaak: Runtime Monitoring of Program Verifiers.”10.1007/978-3-031-30820-8_32__Tools and Algorithms for the Construction and Analysis of Systems, vol. 13994, Springer Nature, 2023, pp. 535–40, doi:10.1007/978-3-031-30820-8_32.

Chalupa, Marek, et al. “Vamos: Middleware for Best-Effort Third-Party Monitoring.”10.1007/978-3-031-30826-0_15__Fundamental Approaches to Software Engineering, vol. 13991, Springer Nature, 2023, pp. 260–81, doi:10.1007/978-3-031-30826-0_15.

Chalupa, Marek, et al. VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:12407.

Chatterjee, Krishnendu, et al. “A Learner-Verifier Framework for Neural Network Controllers and Certificates of Stochastic Systems.”10.1007/978-3-031-30823-9_1__Tools and Algorithms for the Construction and Analysis of Systems , vol. 13993, Springer Nature, 2023, pp. 3–25, doi:10.1007/978-3-031-30823-9_1.

Anand, Ashwani, et al. “Computing Adequately Permissive Assumptions for Synthesis.”10.1007/978-3-031-30820-8_15__TACAS 2023: Tools and Algorithms for the Construction and Analysis of Systems, vol. 13994, Springer Nature, 2023, pp. 211–28, doi:10.1007/978-3-031-30820-8_15.

Henzinger, Thomas A., et al. “Quantitative Safety and Liveness.”10.1007/978-3-031-30829-1_17__26th International Conference Foundations of Software Science and Computation Structures, vol. 13992, Springer Nature, 2023, pp. 349–70, doi:10.1007/978-3-031-30829-1_17.

Henzinger, Thomas A., et al. “Regular Methods for Operator Precedence Languages.”10.4230/LIPIcs.ICALP.2023.129__50th International Colloquium on Automata, Languages, and Programming, vol. 261, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, p. 129:1--129:20, doi:10.4230/LIPIcs.ICALP.2023.129.

Lechner, Mathias, et al. “Revisiting the Adversarial Robustness-Accuracy Tradeoff in Robot Learning.”10.1109/LRA.2023.3240930__IEEE Robotics and Automation Letters, vol. 8, no. 3, Institute of Electrical and Electronics Engineers, 2023, pp. 1595–602, doi:10.1109/LRA.2023.3240930.

Benes, Nikola, et al. “Boolean Network Sketches: A Unifying Framework for Logical Model Inference.”10.1093/bioinformatics/btad158__Bioinformatics, vol. 39, no. 4, btad158, Oxford Academic, 2023, doi:10.1093/bioinformatics/btad158.

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.

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.

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.

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.

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.

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.

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.