{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:25Z","timestamp":1772164045059,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,1,11]],"date-time":"2016-01-11T00:00:00Z","timestamp":1452470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61229201, 61379039, 91318301, 61502442"],"award-info":[{"award-number":["61229201, 61379039, 91318301, 61502442"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,1,11]]},"DOI":"10.1145\/2837614.2837635","type":"proceedings-article","created":{"date-parts":[[2016,1,7]],"date-time":"2016-01-07T09:05:00Z","timestamp":1452157500000},"page":"385-399","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["A program logic for concurrent objects under fair scheduling"],"prefix":"10.1145","author":[{"given":"Hongjin","family":"Liang","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, China"}]},{"given":"Xinyu","family":"Feng","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, China"}]}],"member":"320","published-online":{"date-parts":[[2016,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/203095.201069"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360050116"},{"key":"e_1_3_2_1_3_1","first-page":"663","volume-title":"ECOOP","author":"Bostr\u00f6m P.","year":"2015","unstructured":"P. Bostr\u00f6m and P. M\u00fcller . Modular verification of finite blocking in non-terminating programs . In ECOOP , pages 639\u2013 663 , 2015 . P. Bostr\u00f6m and P. M\u00fcller. Modular verification of finite blocking in non-terminating programs. In ECOOP, pages 639\u2013663, 2015."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/582419.582440"},{"key":"e_1_3_2_1_5_1","volume-title":"Modular termination verification for non-blocking concurrency","author":"da Rocha Pinto P.","year":"2015","unstructured":"P. da Rocha Pinto , T. Dinsdale-Young , P. Gardner , and J. Sutherland . Modular termination verification for non-blocking concurrency , 2015 . P. da Rocha Pinto, T. Dinsdale-Young, P. Gardner, and J. Sutherland. Modular termination verification for non-blocking concurrency, 2015."},{"key":"e_1_3_2_1_6_1","unstructured":"Manuscript.  Manuscript."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1889997.1890001"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480922"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.09.021"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2027223.2027269"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480886"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11795490_3"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2001.3085"},{"key":"e_1_3_2_1_14_1","volume-title":"Morgan Kaufmann","author":"Herlihy M.","year":"2008","unstructured":"M. Herlihy and N. Shavit . The Art of Multiprocessor Programming . Morgan Kaufmann , 2008 . M. Herlihy and N. Shavit. The Art of Multiprocessor Programming. Morgan Kaufmann, 2008."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25873-2_22"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2013.18"},{"key":"e_1_3_2_1_18_1","first-page":"688","volume-title":"ECOOP","author":"Jacobs B.","year":"2015","unstructured":"B. Jacobs , D. Bosnacki , and R. Kuiper . Modular termination verification . In ECOOP , pages 664\u2013 688 , 2015 . B. Jacobs, D. Bosnacki, and R. Kuiper. Modular termination verification. In ECOOP, pages 664\u2013688, 2015."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/69575.69577"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00590-9_27"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11957-6_22"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462189"},{"key":"e_1_3_2_1_23_1","volume-title":"A program logic for concurrent objects under fair scheduling (technical report)","author":"Liang H.","year":"2015","unstructured":"H. Liang and X. Feng . A program logic for concurrent objects under fair scheduling (technical report) , 2015 . http:\/\/kyhcs.ustcsz.edu. cn\/relconcur\/lili. H. Liang and X. Feng. A program logic for concurrent objects under fair scheduling (technical report), 2015. http:\/\/kyhcs.ustcsz.edu. cn\/relconcur\/lili."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40184-8_17"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603123"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/103727.103729"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248106"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2006.52"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/646823.706907"},{"key":"e_1_3_2_1_30_1","first-page":"498","volume-title":"FORTE","author":"St\u00f8len K.","year":"1992","unstructured":"K. St\u00f8len . Shared-state design modulo weak and strong process fairness . In FORTE , pages 479\u2013 498 , 1992 . K. St\u00f8len. Shared-state design modulo weak and strong process fairness. In FORTE, pages 479\u2013498, 1992."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2500365.2500600"},{"key":"e_1_3_2_1_32_1","volume-title":"Modular fine-grained concurrency verification","author":"Vafeiadis V.","year":"2008","unstructured":"V. Vafeiadis . Modular fine-grained concurrency verification , 2008 . PhD Thesis . V. Vafeiadis. Modular fine-grained concurrency verification, 2008. PhD Thesis."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/11531142_26"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211617"}],"event":{"name":"POPL '16: The 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"St. Petersburg FL USA","acronym":"POPL '16","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837635","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2837614.2837635","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:43:37Z","timestamp":1750211017000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2837614.2837635"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,11]]},"references-count":34,"alternative-id":["10.1145\/2837614.2837635","10.1145\/2837614"],"URL":"https:\/\/doi.org\/10.1145\/2837614.2837635","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2914770.2837635","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016,1,11]]},"assertion":[{"value":"2016-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}