Publications

2026
DOI
Details
Lina Gerlach, Christof Löding, and Erika Ábrahám. 2026. A Hyperlogic for Strategies in Stochastic Games. In Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems : Second International Joint Conference, QEST+FORMATS 2025, Aarhus, Denmark, August 26–28, 2025, Proceedings (Lecture Notes in Computer Science, Vol. 16143). Springer Nature Switzerland, Cham, 1–20.
DOI
Details
László Antal, Franz Link, and Erika Ábrahám. 2026. Counterexample-Guided Abstraction Refinement for Star-Based Neural Network Verification. In Reachability Problems : 19th International Conference, RP 2025, Madrid, Spain, October 1–3, 2025, Proceedings (Lecture Notes in Computer Science, Vol. 16230). Springer Nature Switzerland, Cham, 202–216.
DOI
Details
Erika Ábrahám, Nils Jansen, and Simon Jantsch. 2026. Probabilistic Counterexamples Through the Ages. In Principles of formal quantitative analysis : essays dedicated to Christel Baier on the occasion of her 60th birthday. Lecture notes in computer science, Vol. 15760. Festschrift. Springer, Cham, 174–196.
DOI
Details
László Antal. 2026. Synthesis and analysis of neural-network-based control in cyber-physical systems. Ph.D. Dissertation. RWTH Aachen University, Aachen.
DOI
Details
Jasper Nalbach and Gereon Kremer. 2026. Extensions of the Cylindrical Algebraic Covering Method for Quantifiers. Mathematics in computer science 20, 1 (2026), 7.
DOI
Details
Erika Ábrahám and Manuel Mazo Espinosa. 2026. Preface Special Issue SCICO on HSCC2024-software. Science of computer programming 248 (May 2026), 103364.
DetailsManuel Mazo Espinosa, Erika Ábrahám, Laura Nenzi, and Houssam Abbas (Eds.). 2026. Research software from the 27th ACM International Conference on Hybrid Systems: Computation and Control. Elsevier Science, Amsterdam.
2025
DOI
Details
Valentin Promies and Erika Ábrahám. 2025. A Divide-and-Conquer Approach to Variable Elimination in Linear Real Arithmetic. In Formal methods : 26th international symposium, FM 2024, Milan, Italy, September 9-13, 2024, proceedings (Lecture notes in computer science, Vol. 14933). Springer, Cham, 131–148.
DOI
Details
Joanna Delicaris, Anne Remke, Erika Ábrahám, Stefan Schupp, and Jonas Stubbe. 2025. Maximizing reachability probabilities in rectangular automata with random events. Science of computer programming 240 (July 2025), 103213.
DOI
Details
Erika Ábrahám and Houssam Abbas (Eds.). 2025. Runtime verification : 24th international conference, RV 2024, Istanbul, Turkey, October 15-17, 2024 : proceedings; Edition Number 1 (Lecture notes in computer science, Vol. 15191). Springer, Cham.
DOI
Details
Lisa Willemsen, Anne Remke, and Erika Ábrahám. 2025. (de-)Composed And More: Eager and Lazy Specifications (CAMELS) for Stochastic Hybrid Systems. In Principles of verification: cycling the probabilistic landscape : essays dedicated to Joost-Pieter Katoen on the occasion of his 60th Birthday : part III. Lecture notes in computer science, Vol. 15262. Springer, Cham, 309–337.
DOI
Details
Nicolai Radke, Patrick E. M. De Smet, and Erika Ábrahám. 2025. Numerical Modeling and Analysis of Shadow Flicker Using Solar Path Functions for Enhanced Predictive Accuracy. Energies : open-access journal of related scientific research, technology development and studies in policy and management 18, 2 (2025), 352.
DOI
Details
Valentin Promies, Jasper Nalbach, Erika Ábrahám, and Paul Kobialka. 2025. FMplex: Exploring a Bridge between Fourier-Motzkin and Simplex. Logical methods in computer science : LMCS 21, 2 (2025), 13362.
DOI
Details
Erika Ábrahám and Marco Paolieri. 2025. Introduction to the Special Issue on QEST 2022, Part 2. ACM transactions on internet technology : TOIT 35, 2 (Sept. 2025), 9.
DOI
Details
László Antal, Erika Ábrahám, and Hana Masara. 2025. Generalizing neural network verification to the family of piece-wise linear activation functions. Science of Computer Programming 243 (2025), 103269.
DOI
Details
Paul Kobialka, Lina Gerlach, Francesco Leofante, Erika Ábrahám, Silvia Lizeth, Tapia Tarifa, and Einar Brocj Johnsen. 2025. Counterfactual Strategies for Markov Decision Processes. arXiv:2505.09412.
DOI
Details
Lina Gerlach, Tobias Winkler, Erika Ábrahám, Borzoo Bonakdarpour, and Sebastian Junges. 2025. Efficient Probabilistic Model Checking for Relational Reachability (Extended Version). arXiv:2505.16357.
DOI
Details
Hossein Hojjat and Erika Ábrahám. 2025. Preface: Fundamentals of Software Engineering (extended versions of selected papers of FSEN 2023). Science of computer programming 243 (May 2025), 103244.
DetailsHossein Hojjat and Erika Ábrahám (Eds.). 2025. Fundamentals of Software Engineering (extended versions of selected papers of FSEN 2023) : Special issue. Elsevier Science, Amsterdam.
DOI
Details
Fatemeh Ghassemi, Saeed Zhiany, Nesa Abbasi, Ali Hodaei, Ali Ataollahi, József Kovács, Erika Ábrahám, and Marjan Sirjani. 2025. Reachability analysis of Hybrid Rebeca models. Journal of systems architecture : JSA 167 (2025), 103493.
DOI
Details
Lina Gerlach, Tobias Winkler, Erika Ábrahám, Borzoo Bonakdarpour, and Sebastian Junges. 2025. Efficient Probabilistic Model Checking for Relational Reachability. In Computer Aided Verification : 37th International Conference, CAV 2025, Zagreb, Croatia, July 23-25, 2025, Proceedings, Part I (Lecture Notes in Computer Science, Vol. 15931). Springer Nature Switzerland, Cham, 127–147.
DOI
Details
Jasper Nalbach. 2025. Cylindrical algebraic decomposition based methods in satisfiability modulo non-linear real arithmetic. Ph.D. Dissertation. RWTH Aachen University, Aachen.
DOI
Details
Isabela Drămnesc, Erika Ábrahám, László Antal, Péter Csóka, Nikolaos Fachantidis, Tudor Jebelean, Gábor Kusper, and Konstantinos Papadopoulos. 2025. Artificial Intelligence based robotic applications for higher education. Annales mathematicae et informaticae 61 (June 2025), 68–79.
DOI
Details
Jasper Nalbach and Erika Ábrahám. 2025. A Variant of Non-uniform Cylindrical Algebraic Decomposition for Real Quantifier Elimination. In SC-Square 2025 : Satisfiability Checking and Symbolic Computation 2025 : Proceedings of the 10th International Workshop on Satisfiability Checking and Symbolic Computation (SC-Square 2025), Collocated with The 30th International Conference on Automated Deduction (CADE 2025) : Stuttgart, Germany, August 2, 2025 (CEUR workshop proceedings, Vol. 4116). RWTH Aachen, Aachen, Germany, 19–34.
DOI
Details
Jasper Nalbach, Lucas Michel, Erika Ábrahám, Christopher W. Brown, James H. Davenport, Matthew England, Pierre Mathonet, and Naïm Zénaïdi. 2025. Projective Delineability for Single Cell Construction. In SC-Square 2025 : Satisfiability Checking and Symbolic Computation 2025 : Proceedings of the 10th International Workshop on Satisfiability Checking and Symbolic Computation (SC-Square 2025), Collocated with The 30th International Conference on Automated Deduction (CADE 2025) : Stuttgart, Germany, August 2, 2025 (CEUR workshop proceedings, Vol. 4116). RWTH Aachen, Aachen, Germany, 41–54.