The paper entitled “

Model Checking Temporal Properties of Recursive Probabilistic Programs" by Tobias Winkler, Christina Gehnen and Joost-Pieter Katoen has been accepted at the 25th Int. Conf. on Foundations of Software Science and Computation Structure (FoSSaCS 2022). The paper presents decidability and complexity results for checking quantitative properties of visibly omega-regular languages against probabilistic visibly pushdown automata. It enables the automated verification of temporal properties that allow for reasoning over calls and returns of procedures.