2022W

• Formal Methods in Computer Science / 185.A93 / UE
• Formal Methods in Computer Science / 185.291 / VU

Note: Due to the rollout of TU Wien’s new publication database, the list below may be slightly outdated. Once APIs for the new database have been released, everything will be up to date again.

• Moment-based Invariants for Probabilistic Loops with non-polynomial assignments / A. Kofnov, M. Moosbrugger, S. Stankovic, E. Bartocci, E. Bura / accepted as talk for: Proc. of QEST 2022: the 19th International Conference on Quantitative Evaluation of SysTems, Warsaw, Poland; 2022-09-12 - 2022-09-16; in: "Proc. of QEST'22: the 19th International Conference on Quantitative Evaluation of SysTems", (2022)
• Distribution Estimation for Probabilistic Loops / A. Karimi, S. Stankovic, M. Moosbrugger, L. Kovacs, E. Bartocci, E. Bura / accepted as talk for: Proc. of QEST 2022: the 19th International Conference on Quantitative Evaluation of SysTems, Warsaw, Poland; 2022-09-12 - 2022-09-16; in: "Proc. of QEST'22: the 19th International Conference on Quantitative Evaluation of SysTems", (2022)
• Automated Termination Analysis of Polynomial Probabilistic Programs / M. Moosbrugger, E. Bartocci, J. Katoen, L. Kovacs / Talk: 30th European Symposium on Programming (ESOP 2021), Luxembourg (online); 2021-03-27 - 2021-04-01; in: "Proc. of ESOP 2021: the 30th European Symposium on Programming", Springer, 12648 (2021), 491 - 518
• Automating Termination Analysis of Probabilistic Programs / Master Thesis by M. Moosbrugger / Supervisor: L. Kovacs; Institut for Logic and Computation, E192.04, 2020; final examination: 2020-06-23