E-LIB Suche - Ergebnisse für: Moosbrugger, Marcel

1

Strong Invariants Are Hard: On the Hardness of Strongest Po..:

Müllner, Julian ; Moosbrugger, Marcel ; Kovács, Laura
Proceedings of the ACM on Programming Languages. 8 (2024) POPL - p. 882-910 , 2024

Link: https://doi.org/10.1145/..

2

(Un)Solvable loop analysis:

Amrollahi, Daneshvar ; Bartocci, Ezio ; Kenison, George...
Formal Methods in System Design. , 2024

Link: https://doi.org/10.1007/..

3

Exact and Approximate Moment Derivation for Probabilistic L..:

Kofnov, Andrey ; Moosbrugger, Marcel ; Stankovič, Miroslav..
ACM Transactions on Modeling and Computer Simulation. 34 (2024) 3 - p. 1-25 , 2024

Link: https://doi.org/10.1145/..

4

Automated Sensitivity Analysis for Probabilistic Loops:

, In: Lecture Notes in Computer Science; Integrated Formal Methods,

Moosbrugger, Marcel ; Müllner, Julian ; Kovács, Laura - p. 21-39 , 2023

Link: https://doi.org/10.1007/..

5

Distribution Estimation for Probabilistic Loops:

, In: Quantitative Evaluation of Systems; Lecture Notes in Computer Science,

Karimi, Ahmad ; Moosbrugger, Marcel ; Stankovič, Miroslav... - p. 26-42 , 2022

Link: https://doi.org/10.1007/..

6

The probabilistic termination tool amber:

Moosbrugger, Marcel ; Bartocci, Ezio ; Katoen, Joost-Pieter.
Formal Methods in System Design. 61 (2022) 1 - p. 90-109 , 2022

Link: https://doi.org/10.1007/..

7

Solving Invariant Generation for Unsolvable Loops:

, In: Static Analysis; Lecture Notes in Computer Science,

Amrollahi, Daneshvar ; Bartocci, Ezio ; Kenison, George... - p. 19-43 , 2022

Link: https://doi.org/10.1007/..

8

This is the moment for probabilistic loops:

Moosbrugger, Marcel ; Stankovič, Miroslav ; Bartocci, Ezio.
Proceedings of the ACM on Programming Languages. 6 (2022) OOPSLA2 - p. 1497-1525 , 2022

Link: https://doi.org/10.1145/..

9

Moment-Based Invariants for Probabilistic Loops with Non-po..:

, In: Quantitative Evaluation of Systems; Lecture Notes in Computer Science,

Kofnov, Andrey ; Moosbrugger, Marcel ; Stankovič, Miroslav.. - p. 3-25 , 2022

Link: https://doi.org/10.1007/..

10

Automated Termination Analysis of Polynomial Probabilistic ..:

, In: Programming Languages and Systems; Lecture Notes in Computer Science,

Moosbrugger, Marcel ; Bartocci, Ezio ; Katoen, Joost-Pieter. - p. 491-518 , 2021

Link: https://doi.org/10.1007/..

11

The Probabilistic Termination Tool Amber:

, In: Formal Methods; Lecture Notes in Computer Science,

Moosbrugger, Marcel ; Bartocci, Ezio ; Katoen, Joost-Pieter. - p. 667-675 , 2021

Link: https://doi.org/10.1007/..

12

Exact and Approximate Moment Derivation for Probabilistic L..:

Kofnov, Andrey ; Moosbrugger, Marcel ; Stankovič, Miroslav..
http://arxiv.org/abs/2306.07072. , 2023

Link: http://arxiv.org/abs/230..

13

(Un)Solvable Loop Analysis:

Amrollahi, Daneshvar ; Bartocci, Ezio ; Kenison, George...
http://arxiv.org/abs/2306.01597. , 2023

Link: http://arxiv.org/abs/230..

14

Automated Sensitivity Analysis for Probabilistic Loops:

Moosbrugger, Marcel ; Müllner, Julian ; Kovács, Laura
http://arxiv.org/abs/2305.15259. , 2023

Link: http://arxiv.org/abs/230..

15

Strong Invariants Are Hard: On the Hardness of Strongest Po..:

Müllner, Julian ; Moosbrugger, Marcel ; Kovács, Laura
http://arxiv.org/abs/2307.10902. , 2023

Link: http://arxiv.org/abs/230..