The paper entitled “Model Checking Temporal Properties of Recursive Probabilistic Programs” by Tobias Winkler, Christina Gehnen and Joost-Pieter Katoen has been accepted for the special issues devoted to FoSSaCS 2022 in the journal Logical Methods in Computer Science. The paper shows that model checking a probabilistic pushdown automata against omega visibly push-down languages (e.g., expressed as CaReT formulas) is decidable. It also provides some complexity bounds on this problem.