{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T05:57:21Z","timestamp":1783490241423,"version":"3.55.0"},"reference-count":39,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T00:00:00Z","timestamp":1687737600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,26]]},"DOI":"10.1109\/lics56636.2023.10175714","type":"proceedings-article","created":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T17:18:23Z","timestamp":1689355103000},"page":"1-13","source":"Crossref","is-referenced-by-count":4,"title":["On Certificates, Expected Runtimes, and Termination in Probabilistic Pushdown Automata"],"prefix":"10.1109","author":[{"given":"Tobias","family":"Winkler","sequence":"first","affiliation":[{"name":"RWTH Aachen University,Software Modeling and Verification Group,Aachen,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[{"name":"RWTH Aachen University,Software Modeling and Verification Group,Aachen,Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2013.07.001"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1017\/9781108770750.005"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-99253-8_23"},{"key":"ref34","author":"kulkarni","year":"1995","journal-title":"Modeling and Analysis of Stochastic Systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-007-0066-8"},{"key":"ref37","article-title":"Nonnegative matrices and stochastic matrices","author":"rothblum","year":"2006","journal-title":"Handbook of Linear Algebra"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2019.05.004"},{"key":"ref36","doi-asserted-by":"crossref","DOI":"10.1109\/LICS56636.2023.10175714","article-title":"On certificates, expected runtimes, and termination in probabilistic pushdown automata","author":"winkler","year":"2023"},{"key":"ref31","article-title":"On the Termination Problem for Probabilistic Higher-Order Recursive Programs","volume":"16","author":"kobayashi","year":"2020","journal-title":"Log Methods Comput Sci"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_72"},{"key":"ref11","article-title":"Model checking probabilistic pushdown automata","volume":"2","author":"kucera","year":"2006","journal-title":"Log Methods Comput Sci"},{"key":"ref33","author":"mciver","year":"2005","journal-title":"Abstraction Refinement and Proof for Probabilistic Systems ser Monographs in Computer Science"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/QEST.2005.8"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3498702"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2935317"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2004.1319596"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_9"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmp.2019.102308"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-012-0166-0"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1201\/b10576"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250822"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2789208"},{"key":"ref24","article-title":"An Introduction to Probabilistic Programming","volume":"abs 1809 10756","author":"van de meent","year":"2018","journal-title":"CoRR"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2010.09.009"},{"key":"ref26","article-title":"Recursive probabilistic models : efficient analysis and implementation","author":"wojtczak","year":"2009","journal-title":"Ph D Dissertation"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_58"},{"key":"ref20","first-page":"289","article-title":"Convergence Thresholds of Newton’s Method for Monotone Polynomial Equations","volume":"1","author":"esparza","year":"2008","journal-title":"STACS Ser LIPIcs"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30820-8_24"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/090749591"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45190-5_18"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-53291-8_26"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45190-5_24"},{"key":"ref8","first-page":"49","article-title":"On the memory consumption of probabilistic pushdown automata","author":"br\u00e1zdil","year":"2009","journal-title":"FSTTCS ser LIPIcs vol 4 Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.39"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_12"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"1:1","DOI":"10.1145\/1462153.1462154","article-title":"Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations","volume":"56","author":"etessami","year":"2009","journal-title":"J ACM"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_28"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.06.005"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22012-8_25"}],"event":{"name":"2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Boston, MA, USA","start":{"date-parts":[[2023,6,26]]},"end":{"date-parts":[[2023,6,29]]}},"container-title":["2023 38th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10175635\/10175671\/10175714.pdf?arnumber=10175714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T17:59:22Z","timestamp":1690912762000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10175714\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,26]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/lics56636.2023.10175714","relation":{},"subject":[],"published":{"date-parts":[[2023,6,26]]}}}