Author of the publication

Moment-Based Invariants for Probabilistic Loops with Non-polynomial Assignments.

, , , , and . QEST, volume 13479 of Lecture Notes in Computer Science, page 3-25. Springer, (2022)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Moment-Based Invariants for Probabilistic Loops with Non-polynomial Assignments., , , , and . QEST, volume 13479 of Lecture Notes in Computer Science, page 3-25. Springer, (2022)Exact and Approximate Moment Derivation for Probabilistic Loops With Non-Polynomial Assignments., , , , and . ACM Trans. Model. Comput. Simul., 34 (3): 18:1-18:25 (July 2024)The Probabilistic Termination Tool Amber., , , and . FM, volume 13047 of Lecture Notes in Computer Science, page 667-675. Springer, (2021)Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs., , and . Proc. ACM Program. Lang., 8 (POPL): 882-910 (January 2024)This is the moment for probabilistic loops., , , and . Proc. ACM Program. Lang., 6 (OOPSLA2): 1497-1525 (2022)Distribution Estimation for Probabilistic Loops., , , , , and . QEST, volume 13479 of Lecture Notes in Computer Science, page 26-42. Springer, (2022)Automated Termination Analysis of Polynomial Probabilistic Programs., , , and . ESOP, volume 12648 of Lecture Notes in Computer Science, page 491-518. Springer, (2021)Automated Sensitivity Analysis for Probabilistic Loops., , and . iFM, volume 14300 of Lecture Notes in Computer Science, page 21-39. Springer, (2023)Solving Invariant Generation for Unsolvable Loops., , , , , and . SAS, volume 13790 of Lecture Notes in Computer Science, page 19-43. Springer, (2022)