Marcel Moosbrugger

Orcid: 0000-0002-2006-3741

According to our database1, Marcel Moosbrugger authored at least 15 papers between 2021 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
(Un)Solvable loop analysis.
Formal Methods Syst. Des., April, 2025

2024
Exact and Approximate Moment Derivation for Probabilistic Loops With Non-Polynomial Assignments.
ACM Trans. Model. Comput. Simul., July, 2024

Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs.
Proc. ACM Program. Lang., January, 2024

Polar: An Algebraic Analyzer for (Probabilistic) Loops.
Proceedings of the Principles of Verification: Cycling the Probabilistic Landscape, 2024

2023
Automated Sensitivity Analysis for Probabilistic Loops.
Proceedings of the iFM 2023 - 18th International Conference, 2023

2022
The probabilistic termination tool amber.
Formal Methods Syst. Des., August, 2022

This is the Moment for Probabilistic Loops - Artifact (Polar).
Dataset, July, 2022

This is the Moment for Probabilistic Loops - Artifact (Polar).
Dataset, July, 2022

This is the Moment for Probabilistic Loops - Artifact (Polar).
Dataset, July, 2022

This is the Moment for Probabilistic Loops - Artifact (Polar).
Dataset, July, 2022

This is the moment for probabilistic loops.
Proc. ACM Program. Lang., 2022

Solving Invariant Generation for Unsolvable Loops.
Proceedings of the Static Analysis - 29th International Symposium, 2022

Moment-Based Invariants for Probabilistic Loops with Non-polynomial Assignments.
Proceedings of the Quantitative Evaluation of Systems - 19th International Conference, 2022

Distribution Estimation for Probabilistic Loops.
Proceedings of the Quantitative Evaluation of Systems - 19th International Conference, 2022

2021
Automated Termination Analysis of Polynomial Probabilistic Programs.
Proceedings of the Programming Languages and Systems, 2021


  Loading...