{"external_id":{"arxiv":["1901.06087"]},"project":[{"name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","grant_number":"S11407","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7"},{"name":"Quantitative Analysis of Probablistic Systems with a focus on Crypto-currencies","_id":"267066CE-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Game-theoretic Analysis of Blockchain Applications and Smart Contracts","_id":"266EEEC0-B435-11E9-9278-68D0E5697425"}],"author":[{"first_name":"Mingzhang","full_name":"Huang, Mingzhang","last_name":"Huang"},{"last_name":"Fu","full_name":"Fu, Hongfei","first_name":"Hongfei"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"},{"orcid":"0000-0003-1702-6584","id":"391365CE-F248-11E8-B48F-1D18A9856A87","full_name":"Goharshady, Amir Kafshdar","last_name":"Goharshady","first_name":"Amir Kafshdar"}],"doi":"10.1145/3360555","_id":"6780","volume":3,"conference":{"end_date":"2019-10-25","start_date":"2019-10-23","name":"OOPSLA: Object-oriented Programming, Systems, Languages and Applications","location":"Athens, Greece"},"date_published":"2019-10-01T00:00:00Z","publication_status":"published","day":"01","publication":"Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications ","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file_date_updated":"2020-07-14T12:47:40Z","file":[{"date_created":"2019-08-12T15:40:57Z","file_id":"6807","checksum":"3482d8ace6fb4991eb7810e3b70f1b9f","file_name":"oopsla-2019.pdf","access_level":"open_access","relation":"main_file","file_size":1024643,"date_updated":"2020-07-14T12:47:40Z","creator":"akafshda","content_type":"application/pdf"},{"date_updated":"2020-07-14T12:47:40Z","file_size":538579,"creator":"dernst","content_type":"application/pdf","date_created":"2020-05-12T15:15:14Z","checksum":"4e5a6fb2b59a75222a4e8335a5a60eac","file_id":"7821","relation":"main_file","access_level":"open_access","file_name":"2019_ACM_Huang.pdf"}],"oa":1,"tmp":{"image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)"},"license":"https://creativecommons.org/licenses/by-nc/4.0/","intvolume":"         3","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"8934"}]},"language":[{"iso":"eng"}],"quality_controlled":"1","article_processing_charge":"No","month":"10","date_updated":"2024-07-16T22:30:53Z","title":"Modular verification for almost-sure termination of probabilistic programs","citation":{"chicago":"Huang, Mingzhang, Hongfei Fu, Krishnendu Chatterjee, and Amir Kafshdar Goharshady. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” In <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>, Vol. 3. ACM, 2019. <a href=\"https://doi.org/10.1145/3360555\">https://doi.org/10.1145/3360555</a>.","apa":"Huang, M., Fu, H., Chatterjee, K., &#38; Goharshady, A. K. (2019). Modular verification for almost-sure termination of probabilistic programs. In <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i> (Vol. 3). Athens, Greece: ACM. <a href=\"https://doi.org/10.1145/3360555\">https://doi.org/10.1145/3360555</a>","ieee":"M. Huang, H. Fu, K. Chatterjee, and A. K. Goharshady, “Modular verification for almost-sure termination of probabilistic programs,” in <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>, Athens, Greece, 2019, vol. 3.","ama":"Huang M, Fu H, Chatterjee K, Goharshady AK. Modular verification for almost-sure termination of probabilistic programs. In: <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>. Vol 3. ACM; 2019. doi:<a href=\"https://doi.org/10.1145/3360555\">10.1145/3360555</a>","short":"M. Huang, H. Fu, K. Chatterjee, A.K. Goharshady, in:, Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications , ACM, 2019.","ista":"Huang M, Fu H, Chatterjee K, Goharshady AK. 2019. Modular verification for almost-sure termination of probabilistic programs. Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications . OOPSLA: Object-oriented Programming, Systems, Languages and Applications vol. 3, 129.","mla":"Huang, Mingzhang, et al. “Modular Verification for Almost-Sure Termination of Probabilistic Programs.” <i>Proceedings of the 34th ACM International Conference on Object-Oriented Programming, Systems, Languages, and Applications </i>, vol. 3, 129, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3360555\">10.1145/3360555</a>."},"type":"conference","article_number":"129","date_created":"2019-08-09T09:54:20Z","has_accepted_license":"1","status":"public","ec_funded":1,"oa_version":"Published Version","department":[{"_id":"KrCh"}],"abstract":[{"lang":"eng","text":"In this work, we consider the almost-sure termination problem for probabilistic programs that asks whether a\r\ngiven probabilistic program terminates with probability 1. Scalable approaches for program analysis often\r\nrely on modularity as their theoretical basis. In non-probabilistic programs, the classical variant rule (V-rule)\r\nof Floyd-Hoare logic provides the foundation for modular analysis. Extension of this rule to almost-sure\r\ntermination of probabilistic programs is quite tricky, and a probabilistic variant was proposed in [16]. While the\r\nproposed probabilistic variant cautiously addresses the key issue of integrability, we show that the proposed\r\nmodular rule is still not sound for almost-sure termination of probabilistic programs.\r\nBesides establishing unsoundness of the previous rule, our contributions are as follows: First, we present a\r\nsound modular rule for almost-sure termination of probabilistic programs. Our approach is based on a novel\r\nnotion of descent supermartingales. Second, for algorithmic approaches, we consider descent supermartingales\r\nthat are linear and show that they can be synthesized in polynomial time. Finally, we present experimental\r\nresults on a variety of benchmarks and several natural examples that model various types of nested while\r\nloops in probabilistic programs and demonstrate that our approach is able to efficiently prove their almost-sure\r\ntermination property"}],"year":"2019","ddc":["000"],"publisher":"ACM"}