{"external_id":{"arxiv":["1806.06683"],"isi":["000916310900011"]},"date_published":"2018-12-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"language":[{"iso":"eng"}],"quality_controlled":"1","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"}],"date_updated":"2023-09-13T09:02:22Z","department":[{"_id":"KrCh"}],"publisher":"Springer","page":"181-201","type":"conference","article_processing_charge":"No","year":"2018","alternative_title":["LNCS"],"citation":{"ama":"Huang M, Fu H, Chatterjee K. New approaches for almost-sure termination of probabilistic programs. In: Ryu S, ed. Vol 11275. Springer; 2018:181-201. doi:10.1007/978-3-030-02768-1_11","short":"M. Huang, H. Fu, K. Chatterjee, in:, S. Ryu (Ed.), Springer, 2018, pp. 181–201.","ista":"Huang M, Fu H, Chatterjee K. 2018. New approaches for almost-sure termination of probabilistic programs. 16th Asian Symposium on Programming Languages and Systems, APLAS, LNCS, vol. 11275, 181–201.","chicago":"Huang, Mingzhang, Hongfei Fu, and Krishnendu Chatterjee. “New Approaches for Almost-Sure Termination of Probabilistic Programs.” edited by Sukyoung Ryu, 11275:181–201. Springer, 2018. https://doi.org/10.1007/978-3-030-02768-1_11.","mla":"Huang, Mingzhang, et al. New Approaches for Almost-Sure Termination of Probabilistic Programs. Edited by Sukyoung Ryu, vol. 11275, Springer, 2018, pp. 181–201, doi:10.1007/978-3-030-02768-1_11.","apa":"Huang, M., Fu, H., & Chatterjee, K. (2018). New approaches for almost-sure termination of probabilistic programs. In S. Ryu (Ed.) (Vol. 11275, pp. 181–201). Presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand: Springer. https://doi.org/10.1007/978-3-030-02768-1_11","ieee":"M. Huang, H. Fu, and K. Chatterjee, “New approaches for almost-sure termination of probabilistic programs,” presented at the 16th Asian Symposium on Programming Languages and Systems, APLAS, Wellington, New Zealand, 2018, vol. 11275, pp. 181–201."},"author":[{"first_name":"Mingzhang","full_name":"Huang, Mingzhang","last_name":"Huang"},{"first_name":"Hongfei","last_name":"Fu","full_name":"Fu, Hongfei"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"date_created":"2018-12-16T22:59:20Z","scopus_import":"1","intvolume":" 11275","title":"New approaches for almost-sure termination of probabilistic programs","day":"01","isi":1,"editor":[{"first_name":"Sukyoung","full_name":"Ryu, Sukyoung","last_name":"Ryu"}],"main_file_link":[{"url":"http://arxiv.org/abs/1806.06683","open_access":"1"}],"abstract":[{"lang":"eng","text":"We study the almost-sure termination problem for probabilistic programs. First, we show that supermartingales with lower bounds on conditional absolute difference provide a sound approach for the almost-sure termination problem. Moreover, using this approach we can obtain explicit optimal bounds on tail probabilities of non-termination within a given number of steps. Second, we present a new approach based on Central Limit Theorem for the almost-sure termination problem, and show that this approach can establish almost-sure termination of programs which none of the existing approaches can handle. Finally, we discuss algorithmic approaches for the two above methods that lead to automated analysis techniques for almost-sure termination of probabilistic programs."}],"doi":"10.1007/978-3-030-02768-1_11","publication_identifier":{"isbn":["9783030027674"],"issn":["03029743"]},"month":"12","conference":{"name":"16th Asian Symposium on Programming Languages and Systems, APLAS","end_date":"2018-12-06","start_date":"2018-12-02","location":"Wellington, New Zealand"},"volume":11275,"oa_version":"Preprint","status":"public","_id":"5679"}