Automated Termination Analysis of Polynomial Probabilistic Programs. - Marcel Moosbrugger; Ezio Bartocci; Joost-Pieter Katoen; Laura Kovács (ESOP, 2021)

Distribution Estimation for Probabilistic Loops. - Ahmad Karimi; Marcel Moosbrugger; Miroslav Stankovic; Laura Kovács; Ezio Bartocci; Efstathia Bura (QEST, 2022)

Moment-Based Invariants for Probabilistic Loops with Non-polynomial Assignments. - Andrey Kofnov; Marcel Moosbrugger; Miroslav Stankovic; Ezio Bartocci; Efstathia Bura (QEST, 2022)

Solving Invariant Generation for Unsolvable Loops. - Daneshvar Amrollahi; Ezio Bartocci; George Kenison; Laura Kovács; Marcel Moosbrugger; Miroslav Stankovic (SAS, 2022)

This is the moment for probabilistic loops. - Marcel Moosbrugger; Miroslav Stankovic; Ezio Bartocci; Laura Kovács (Proc. ACM Program. Lang., 2022)

This is the Moment for Probabilistic Loops - Artifact (Polar). - Marcel Moosbrugger; Miroslav Stankovic; Ezio Bartocci; Laura Kovács (Zenodo, 2022)

This is the Moment for Probabilistic Loops - Artifact (Polar). - Marcel Moosbrugger; Miroslav Stankovic; Ezio Bartocci; Laura Kovács (Zenodo, 2022)

This is the Moment for Probabilistic Loops - Artifact (Polar). - Marcel Moosbrugger; Miroslav Stankovic; Ezio Bartocci; Laura Kovács (Zenodo, 2022)

This is the Moment for Probabilistic Loops - Artifact (Polar). - Marcel Moosbrugger; Miroslav Stankovic; Ezio Bartocci; Laura Kovács (Zenodo, 2022)

The probabilistic termination tool amber. - Marcel Moosbrugger; Ezio Bartocci; Joost-Pieter Katoen; Laura Kovács (Formal Methods Syst. Des., 2022)

Automated Sensitivity Analysis for Probabilistic Loops. - Marcel Moosbrugger; Julian Müllner; Laura Kovács (iFM, 2023)

Polar: An Algebraic Analyzer for (Probabilistic) Loops. - Marcel Moosbrugger; Julian Müllner; Ezio Bartocci; Laura Kovács (Principles of Verification (1), 2024)

Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs. - Julian Müllner; Marcel Moosbrugger; Laura Kovács (Proc. ACM Program. Lang., 2024)

Exact and Approximate Moment Derivation for Probabilistic Loops With Non-Polynomial Assignments. - Andrey Kofnov; Marcel Moosbrugger; Miroslav Stankovic; Ezio Bartocci; Efstathia Bura (ACM Trans. Model. Comput. Simul., 2024)

(Un)Solvable loop analysis. - Daneshvar Amrollahi; Ezio Bartocci; George Kenison; Laura Kovács; Marcel Moosbrugger; Miroslav Stankovic (Formal Methods Syst. Des., 2025)