{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:39:35Z","timestamp":1780994375121,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T00:00:00Z","timestamp":1591833600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100012659","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672310, 61527812"],"award-info":[{"award-number":["61672310, 61527812"]}],"id":[{"id":"10.13039\/501100012659","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Key R&D Program of China","award":["2018YFB1308601"],"award-info":[{"award-number":["2018YFB1308601"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,11]]},"DOI":"10.1145\/3385412.3386002","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:40:10Z","timestamp":1591494010000},"page":"869-882","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Proving almost-sure termination by omega-regular decomposition"],"prefix":"10.1145","author":[{"given":"Jianhui","family":"Chen","sequence":"first","affiliation":[{"name":"Tsinghua University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fei","family":"He","sequence":"additional","affiliation":[{"name":"Tsinghua University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the ACM on Programming Languages 2, POPL","author":"Agrawal Sheshansh","year":"2017","unstructured":"Sheshansh Agrawal, Krishnendu Chatterjee, and Petr Novotn`y. 2017. Lexicographic ranking supermartingales: an efficient approach to termination of probabilistic programs. Proceedings of the ACM on Programming Languages 2, POPL (2017), 34."},{"key":"e_1_3_2_1_2_1","volume-title":"Probability and measure theory","author":"Ash Robert B","unstructured":"Robert B Ash, B Robert, Catherine A Doleans-Dade, and A Catherine. 2000. Probability and measure theory. Academic Press."},{"key":"e_1_3_2_1_3_1","volume-title":"Formal Methods in Computer Aided Design","author":"Beyer Dirk","unstructured":"Dirk Beyer, M Erkan Keremoglu, and Philipp Wendler. 2010. Predicate abstraction with adjustable-block encoding. In Formal Methods in Computer Aided Design. IEEE, 189\u2013197."},{"key":"e_1_3_2_1_4_1","volume-title":"International Conference on Rewriting Techniques and Applications. Springer, 323\u2013337","author":"Bournez Olivier","year":"2005","unstructured":"Olivier Bournez and Florent Garnier. 2005. Proving positive almostsure termination. In International Conference on Rewriting Techniques and Applications. Springer, 323\u2013337."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39799-8_34"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41528-4_1"},{"key":"e_1_3_2_1_7_1","volume-title":"y, and Rouzbeh Hasheminezhad","author":"Chatterjee Krishnendu","year":"2016","unstructured":"Krishnendu Chatterjee, Hongfei Fu, Petr Novotn`y, and Rouzbeh Hasheminezhad. 2016. Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. In ACM SIGPLAN Notices, Vol. 51. ACM, 327\u2013342."},{"key":"e_1_3_2_1_8_1","volume-title":"y, and \u00d0or\u0111e \u017dikeli\u0107","author":"Chatterjee Krishnendu","year":"2017","unstructured":"Krishnendu Chatterjee, Petr Novotn`y, and \u00d0or\u0111e \u017dikeli\u0107. 2017. Stochastic invariants for probabilistic termination. In ACM SIGPLAN Notices, Vol. 52. ACM, 145\u2013160."},{"key":"e_1_3_2_1_9_1","unstructured":"Yu-Fang Chen Matthias Heizmann Ond\u0159ej Leng\u00e1l Yong Li Ming-Hsien Tsai Andrea Turrini and Lijun Zhang. 2018."},{"key":"e_1_3_2_1_10_1","volume-title":"ACM SIGPLAN Notices","author":"Advanced","unstructured":"Advanced automata-based algorithms for program termination checking. In ACM SIGPLAN Notices, Vol. 53. ACM, 135\u2013150."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45069-6_39"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45657-0_36"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_14"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2775051.2677001"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177728976"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36742-7_53"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03237-0_7"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39799-8_2"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_53"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-02768-1_11"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3360555"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49498-1_15"},{"key":"e_1_3_2_1_23_1","volume-title":"Pernambuco Summer School on Software Engineering","author":"McIver Annabelle","unstructured":"Annabelle McIver and Carroll Morgan. 2004. Developing and reasoning about probabilistic programs in pGCL. In Pernambuco Summer School on Software Engineering. Springer, 123\u2013155."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158121"},{"key":"e_1_3_2_1_25_1","volume-title":"refinement and proof for probabilistic systems","author":"McIver Annabelle","unstructured":"Annabelle McIver, Carroll Morgan, and Charles Carroll Morgan. 2005. Abstraction, refinement and proof for probabilistic systems. Springer Science & Business Media."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-05156-3"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2935317"}],"event":{"name":"PLDI '20: 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation","location":"London UK","acronym":"PLDI '20","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3385412.3386002","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3385412.3386002","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:49Z","timestamp":1750199929000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3385412.3386002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,11]]},"references-count":27,"alternative-id":["10.1145\/3385412.3386002","10.1145\/3385412"],"URL":"https:\/\/doi.org\/10.1145\/3385412.3386002","relation":{},"subject":[],"published":{"date-parts":[[2020,6,11]]},"assertion":[{"value":"2020-06-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}