{"article_processing_charge":"No","department":[{"_id":"KrCh"}],"date_created":"2019-02-10T22:59:17Z","month":"01","citation":{"ieee":"H. Fu and K. Chatterjee, “Termination of nondeterministic probabilistic programs,” in <i>International Conference on Verification, Model Checking, and Abstract Interpretation</i>, Cascais, Portugal, 2019, vol. 11388, pp. 468–490.","short":"H. Fu, K. Chatterjee, in:, International Conference on Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2019, pp. 468–490.","mla":"Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.” <i>International Conference on Verification, Model Checking, and Abstract Interpretation</i>, vol. 11388, Springer Nature, 2019, pp. 468–90, doi:<a href=\"https://doi.org/10.1007/978-3-030-11245-5_22\">10.1007/978-3-030-11245-5_22</a>.","ama":"Fu H, Chatterjee K. Termination of nondeterministic probabilistic programs. In: <i>International Conference on Verification, Model Checking, and Abstract Interpretation</i>. Vol 11388. Springer Nature; 2019:468-490. doi:<a href=\"https://doi.org/10.1007/978-3-030-11245-5_22\">10.1007/978-3-030-11245-5_22</a>","apa":"Fu, H., &#38; Chatterjee, K. (2019). Termination of nondeterministic probabilistic programs. In <i>International Conference on Verification, Model Checking, and Abstract Interpretation</i> (Vol. 11388, pp. 468–490). Cascais, Portugal: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-030-11245-5_22\">https://doi.org/10.1007/978-3-030-11245-5_22</a>","chicago":"Fu, Hongfei, and Krishnendu Chatterjee. “Termination of Nondeterministic Probabilistic Programs.” In <i>International Conference on Verification, Model Checking, and Abstract Interpretation</i>, 11388:468–90. Springer Nature, 2019. <a href=\"https://doi.org/10.1007/978-3-030-11245-5_22\">https://doi.org/10.1007/978-3-030-11245-5_22</a>.","ista":"Fu H, Chatterjee K. 2019. Termination of nondeterministic probabilistic programs. International Conference on Verification, Model Checking, and Abstract Interpretation. VMCAI: Verification, Model Checking, and Abstract Interpretation, LNCS, vol. 11388, 468–490."},"external_id":{"isi":["000931943000022"],"arxiv":["1701.02944"]},"page":"468-490","status":"public","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","type":"conference","volume":11388,"date_updated":"2023-08-24T14:42:22Z","isi":1,"alternative_title":["LNCS"],"author":[{"last_name":"Fu","first_name":"Hongfei","full_name":"Fu, Hongfei"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"doi":"10.1007/978-3-030-11245-5_22","conference":{"start_date":"2019-01-13","end_date":"2019-01-15","location":"Cascais, Portugal","name":"VMCAI: Verification, Model Checking, and Abstract Interpretation"},"_id":"5948","abstract":[{"lang":"eng","text":"We study the termination problem for nondeterministic probabilistic programs. We consider the bounded termination problem that asks whether the supremum of the expected termination time over all schedulers is bounded. First, we show that ranking supermartingales (RSMs) are both sound and complete for proving bounded termination over nondeterministic probabilistic programs. For nondeterministic probabilistic programs a previous result claimed that RSMs are not complete for bounded termination, whereas our result corrects the previous flaw and establishes completeness with a rigorous proof. Second, we present the first sound approach to establish lower bounds on expected termination time through RSMs."}],"publication":"International Conference on Verification, Model Checking, and Abstract Interpretation","publication_status":"published","day":"11","publisher":"Springer Nature","year":"2019","date_published":"2019-01-11T00:00:00Z","language":[{"iso":"eng"}],"intvolume":"     11388","title":"Termination of nondeterministic probabilistic programs","scopus_import":"1","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1701.02944"}],"oa_version":"Preprint"}