{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T00:46:39Z","timestamp":1782521199075,"version":"3.54.5"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Probabilistic pushdown automata (pPDA) are a standard operational model for\nprogramming languages involving discrete random choices and recursive\nprocedures. Temporal properties are useful for specifying the chronological\norder of events during program execution. Existing approaches for model\nchecking pPDA against temporal properties have focused mostly on\n$\\omega$-regular and LTL properties. In this paper, we give decidability and\ncomplexity results for the model checking problem of pPDA against\n$\\omega$-visibly pushdown languages that can be described by specification\nlogics such as CaRet. These logical formulae allow specifying properties that\nexplicitly take the structured computations arising from procedural programs\ninto account. For example, CaRet is able to match procedure calls with their\ncorresponding future returns, and thus allows to express fundamental program\nproperties such as total and partial correctness.<\/jats:p>","DOI":"10.46298\/lmcs-19(4:24)2023","type":"journal-article","created":{"date-parts":[[2023,12,16]],"date-time":"2023-12-16T00:00:06Z","timestamp":1702684806000},"source":"Crossref","is-referenced-by-count":3,"title":["Model Checking Temporal Properties of Recursive Probabilistic Programs"],"prefix":"10.46298","volume":"Volume 19, Issue 4","author":[{"given":"Tobias","family":"Winkler","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christina","family":"Gehnen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2023,12,15]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/12698\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/12698\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,16]],"date-time":"2023-12-16T00:00:06Z","timestamp":1702684806000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/10029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,15]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-19(4:24)2023","relation":{"has-preprint":[{"id-type":"arxiv","id":"2111.03501v4","asserted-by":"subject"},{"id-type":"arxiv","id":"2111.03501v3","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2111.03501","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2111.03501","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,15]]},"article-number":"10029"}}