Model Checking Temporal Properties of Recursive Probabilistic Programs

Abstract Probabilistic pushdown automata (pPDA) are a standard operational model for programming languages involving discrete random choices, procedures, and returns. Temporal properties useful gaining insight into the chronological order of events during program execution. Existing approaches in literature have focused mostly on $$\omega $$ ω -regular LTL properties. In this paper, we study checking problem pPDA against -visibly that can be described by specification logics such as CaRet strictly more expressive than With these logical formulae, it is possible to specify explicitly take structured computations arising from procedural programs account. For example, able match procedure calls with their corresponding future returns, thus allows express fundamental like total partial correctness.