Kofnov, A., Bartocci, E., & Bura, E. (2025). Moment-based Density Elicitation with Applications in Probabilistic Loops. ACM Transactions on Probabilistic Machine Learning. https://doi.org/10.1145/3728648 ( reposiTUm)

Kofnov, A., Moosbrugger, M., Stankovic, M., Bartocci, E., & Bura, E. (2024). Exact and Approximate Moment Derivation for Probabilistic Loops With Non-Polynomial Assignments. ACM Transactions on Modeling and Computer Simulation, 34(3), Article 18. https://doi.org/10.1145/3641545 ( reposiTUm)

Amrollahi, D., Bartocci, E., Kenison, G. J., Kovacs, L., Moosbrugger, M., & Stankovic, M. (2024). (Un)Solvable loop analysis. Formal Methods in System Design. https://doi.org/10.1007/s10703-024-00455-0 ( reposiTUm)

Amrollahi, D., Bartocci, E., Kenison, G., Kovács, L., Moosbrugger, M., & Stankovič, M. (2024). Correction: (Un)Solvable loop analysis. Formal Methods in System Design. https://doi.org/10.1007/s10703-024-00465-y ( reposiTUm)

Chiari, M., Mandrioli, D., Pontiggia, F., & Pradella, M. (2023). A model checker for operator precedence languages. ACM Transactions on Programming Languages and Systems, 45(3), 1–66. https://doi.org/10.1145/3608443 ( reposiTUm)

Song, M., Bura, E., Parzer, R., & Pfeiffer, R. (2023). Structured time-dependent inverse regression (STIR). Statistics in Medicine. https://doi.org/10.1002/sim.9670 ( reposiTUm)

Fertl, L., & Bura, E. (2022). The ensemble conditional variance estimator for sufficient dimension reduction. Electronic Journal of Statistics, 16(1), 1595–1634. https://doi.org/10.1214/22-EJS1994 ( reposiTUm)

Humenberger, A., Amrollahi, D., Bjørner, N., & Kovács, L. (2022). Algebra-Based Reasoning for Loop Synthesis. Formal Aspects of Computing, 34(1), 4:31. https://doi.org/10.1145/3527458 ( reposiTUm)

Brune, B., Scherrer, W., & Bura, E. (2022). A state-space approach to time-varying reduced-rank regression. Econometric Reviews, 41(8), 895–917. https://doi.org/10.1080/07474938.2022.2073743 ( reposiTUm)

Moosbrugger, M., Bartocci, E., Katoen, J.-P., & Kovacs, L. (2022). The probabilistic termination tool amber. Formal Methods in System Design, 61(1), 90–109. https://doi.org/10.1007/s10703-023-00424-z ( reposiTUm)

Ait El Manssour, R., Kenison, G., Shirmohammadi, M., & Varonka, A. (2025). Simple Linear Loops: Algebraic Invariants and Applications. In M. Hicks (Ed.), Proceedings of the ACM on Programming Languages (pp. 745–771). Association for Computing Machinery. https://doi.org/10.1145/3704862 ( reposiTUm)

Pontiggia, F., Bartocci, E., & Chiari, M. (2025). POPACheck: A Model Checker for Probabilistic Pushdown Automata. In R. Piskac & Z. Rakamaric (Eds.), Computer Aided Verification : 37th International Conference, CAV 2025, Zagreb, Croatia, July 23-25, 2025, Proceedings, Part II (pp. 105–121). Springer. https://doi.org/10.1007/978-3-031-98679-6_5 ( reposiTUm)

Kofnov, A., Kapla, D. B., Bartocci, E., & Bura, E. (2025). Exact Upper and Lower Bounds for the Output Distribution of Neural Networks with Random Inputs. In PMLR Proceedings of Machine Learning Research. 42nd International Conference on Machine Learning (ICML 2025), Vancouver, Canada. ( reposiTUm)

Bartocci, E. (2024). Quantifying Uncertainty in Probabilistic Loops Without Sampling: A Fully Automated Approach. In L. Kovacs & A. Sokolova (Eds.), Reachability Problems (pp. 3–8). Springer. https://doi.org/10.1007/978-3-031-72621-7_1 ( reposiTUm)

Stankovic, M., & Bartocci, E. (2024). Probabilistic Loop Synthesis from Sequences of Moments. In J. Hillston, S. Soudjani, & M. Waga (Eds.), Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems (pp. 233–248). https://doi.org/10.1007/978-3-031-68416-6_14 ( reposiTUm)

Bartocci, E., & Essbai, W. (2024). A Comparison of Monitoring Techniques for Deep Neural Networks. In Bridging the Gap Between AI and Reality : Second International Conference, AISoLA 2024, Crete, Greece, October 30 – November 3, 2024, Proceedings. AISoLA 2024: International Conference on Bridging the Gap between AI and Reality, Kreta, Greece. https://doi.org/10.1007/978-3-031-75434-0_13 ( reposiTUm)

Bartocci, E. (2024). The PROBING Project: Advancing Automatic Analysis of Probabilistic Loops. In T. Margaria & B. Steffen (Eds.), Leveraging Applications of Formal Methods, Verification and Validation. REoCAS Colloquium in Honor of Rocce De Nicola (pp. 152–167). Springer. https://doi.org/10.1007/978-3-031-73709-1_10 ( reposiTUm)

Hitarth, S., Kenison, G. J., Kovacs, L., & Varonka, A. (2024). Linear Loop Synthesis for Quadratic Invariants. In O. Beyersdorff, M. M. Kanté, O. Kupferman, & D. Lokshtanov (Eds.), 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2024.41 ( reposiTUm)

Athavale, A., Bartocci, E., Christakis, M., Maffei, M., Ničković, D., & Weissenbacher, G. (2024). Verifying Global Two-Safety Properties in Neural Networks with Confidence. In A. Gurfinkel & V. Ganesh (Eds.), Computer Aided Verification (pp. 329–351). Springer. https://doi.org/10.1007/978-3-031-65630-9_17 ( reposiTUm)

Kenison, G. J., Kovacs, L., & Varonka, A. (2023). From Polynomial Invariants to Linear Loops. In A. Dickenstein, E. Tsigaridas, & G. Jeronimo (Eds.), ISSAC ’23: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (pp. 398–406). Association for Computing Machinery. https://doi.org/10.1145/3597066.3597109 ( reposiTUm)

Kovács, L. (2023). Algebra-Based Loop Analysis. In A. Dickenstein, E. Tsigaridas, & G. Jeronimo (Eds.), ISSAC ’23: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (pp. 41–42). Association for Computing Machinery. https://doi.org/10.1145/3597066.3597150 ( reposiTUm)

Kovacs, L. (2023). Algebraic Reasoning for (Un)Solvable Loops (Invited Talk). In J. Leroux, S. Lombardy, & D. Peleg (Eds.), 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023) (pp. 4:1-4:2). Schloss-Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPICS.MFCS.2023.4 ( reposiTUm)

Andriushchenko, R., Bartocci, E., Češka, M., Pontiggia, F., & Sallinger, S. S. (2023). Deductive Controller Synthesis for Probabilistic Hyperproperties. In N. Jansen & M. Tribastone (Eds.), Quantitative Evaluation of Systems - 20th International Conference, QEST 2023 (pp. 47–64). Springer. https://doi.org/10.1007/978-3-031-43835-6_20 ( reposiTUm)

Kovács, L. (2023). Symbolic Computation in Automated Program Reasoning. In M. Chechik, J.-P. Katoen, & M. Leucker (Eds.), Formal Methods : 25th International Symposium, FM 2023, Lübeck, Germany, March 6–10, 2023, Proceedings (pp. 3–9). Springer. https://doi.org/10.1007/978-3-031-27481-7_1 ( reposiTUm)

Garlich, L., Dobe, O., Ábrahám, E., Bartocci, E., & Bonakdarpour, B. (2023). Introducing Asynchronicity to Probabilistic Hyperproperties. In N. Jansen & M. Tribastone (Eds.), Quantitative Evaluation of Systems : 20th International Conference, QEST 2023, Antwerp, Belgium, September 20–22, 2023, Proceedings (pp. 47–64). IEEE. https://doi.org/10.1007/978-3-031-43835-6_4 ( reposiTUm)

Kovács, L., & Varonka, A. (2023). What Else is Undecidable About Loops? In R. Glück, L. Santocanale, & M. Winter (Eds.), Relational and Algebraic Methods in Computer Science. RAMiCS 2023 (pp. 176–193). Springer. https://doi.org/10.1007/978-3-031-28083-2_11 ( reposiTUm)

Aguilar, E. A., Bartocci, E., Mateis, C., Nesterini, E., & Nickovic, D. (2023). Mining Specification Parameters for Multi-class Classification. In P. Katsaros & L. Nenzi (Eds.), Runtime Verification : 23rd International Conference, RV 2023, Thessaloniki, Greece, October 3–6, 2023, Proceedings (pp. 86–105). Springer. https://doi.org/10.1007/978-3-031-44267-4_5 ( reposiTUm)

Kenison, G., Nieuwveld, J., Ouaknine, J., & Worrell, J. (2023). Positivity Problems for Reversible Linear Recurrence Sequences. In K. Etessami, U. Feige, & G. Puppis (Eds.), 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) (pp. 1–17). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.130 ( reposiTUm)

Kenison, G., Nosan, K., Shirmohammadi, M., & Worrell, J. (2023). The Membership Problem for Hypergeometric Sequences with Quadratic Parameters. In A. Dickenstein, E. Tsigaridas, & G. Jeronimo (Eds.), ISSAC ’23: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (pp. 407–416). Association for Computing Machinery. https://doi.org/10.1145/3597066.3597121 ( reposiTUm)

Kenison, G. (2022). On the Skolem Problem for Reversible Sequences. In 47th International Symposium on Mathematical Foundations of Computer Science (MFCS 2022) (pp. 61:1-61:15). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2022.61 ( reposiTUm)

Karimi, A., Moosbrugger, M., Stankovič, M., Kovács, L., Bartocci, E., & Bura, E. (2022). Distribution Estimation for Probabilistic Loops. In E. Ábrahám & M. Paolieri (Eds.), Quantitative Evaluation of Systems (pp. 26–42). Springer-Verlag. https://doi.org/10.1007/978-3-031-16336-4_2 ( reposiTUm)

Kofnov, A., Moosbrugger, M., Stankovič, M., Bartocci, E., & Bura, E. (2022). Moment-Based Invariants for Probabilistic Loops with Non-polynomial Assignments. In E. Ábrahám & M. Paolieri (Eds.), Quantitative Evaluation of Systems (pp. 3–25). Springer. https://doi.org/10.1007/978-3-031-16336-4_1 ( reposiTUm)

Kenison, G. J., Klurman, O., Lefaucheux, E., Luca, F., Moree, P., Ouaknine, J., Whiteland, M., & Worrell, J. (2021). On Positivity and Minimality for Second-Order Holonomic Sequences. In F. Bonchi & S. Puglisi (Eds.), 46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021) (pp. 1–15). Schloss Dagstuhl -- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2021.67 ( reposiTUm)

Bartocci, E., Desharnais, J., Lindner, P., & Sokolova, A. (2025). A Probabilistic Analysis of Simplified Cluedo with Storm: The Birthday Cake Case. In N. Jansen, S. Junges, B. L. Kaminski, C. Matheja, T. Noll, T. Quatmann, M. Stoelinga, & M. Volk (Eds.), Principles of Verification: Cycling the Probabilistic Landscape (Vol. 15261, pp. 75–97). Springer. https://doi.org/10.1007/978-3-031-75775-4_4 ( reposiTUm)

Moosbrugger, M., Müllner, J., Bartocci, E., & Kovacs, L. (2025). Polar: An Algebraic Analyzer for (Probabilistic) Loops. In Principles of Verification: Cycling the Probabilistic Landscape (Vol. 15260, pp. 179–200). https://doi.org/10.1007/978-3-031-75783-9_8 ( reposiTUm)

Ait El Manssour, R., Kenison, G. J., Shirmohammadi, M., & Varonka, A. (2024, September 19). Simple Linear Loops: Algebraic Invariants and Synthesis [Presentation]. 18th International Conference on Reachability Problems (RP 2024), Wien, Austria. https://doi.org/10.1007/978-3-031-72621-7 ( reposiTUm)