Marcel Moosbrugger

Orcid: 0000-0002-2006-3741

According to our database1, Marcel Moosbrugger authored at least 10 papers between 2021 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

2023
Exact and Approximate Moment Derivation for Probabilistic Loops With Non-Polynomial Assignments.
CoRR, 2023

(Un)Solvable Loop Analysis.
CoRR, 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.
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...