{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:35Z","timestamp":1772163935092,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,6,10]],"date-time":"2007-06-10T00:00:00Z","timestamp":1181433600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,6,10]]},"DOI":"10.1145\/1250734.1250771","type":"proceedings-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T12:07:37Z","timestamp":1189771657000},"page":"320-330","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":38,"title":["Proving thread termination"],"prefix":"10.1145","author":[{"given":"Byron","family":"Cook","sequence":"first","affiliation":[{"name":"Microsoft Research, Cambridge, Great Britain"}]},{"given":"Andreas","family":"Podelski","sequence":"additional","affiliation":[{"name":"University of Freiburg, Freiburg, Germany"}]},{"given":"Andrey","family":"Rybalchenko","sequence":"additional","affiliation":[{"name":"EPFL and MPI, Lausanne, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2007,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Defining liveness. Information processing letters, 21:181--185","author":"Alpern B.","year":"1985","unstructured":"B. Alpern and F. Schneider . Defining liveness. Information processing letters, 21:181--185 , 1985 . B. Alpern and F. Schneider. Defining liveness. Information processing letters, 21:181--185, 1985."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11609773_18"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217935.1217943"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190249"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_35"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)80410-9"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/781131.781153"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_47"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_48"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_109"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11539452_37"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_8"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:FORM.0000040026.56959.91"},{"key":"e_1_3_2_1_14_1","volume-title":"Model Checking","author":"Clarke E.","year":"2000","unstructured":"E. Clarke , O. Grumberg , and D. Peled . Model Checking . MIT Press , 2000 . E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT Press, 2000."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11609773_9"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765871.1765903"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00006-0"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/647771.734281"},{"key":"e_1_3_2_1_19_1","volume-title":"WST'03: International Workshop on Termination","author":"Contejean E.","year":"2003","unstructured":"E. Contejean , C. March\u00e9 , B. Monate , and X. Urbain . Proving Termination of Rewriting with sc CtextitiME . In WST'03: International Workshop on Termination , 2003 . E. Contejean, C. March\u00e9, B. Monate, and X. Urbain. Proving Termination of Rewriting with sc CtextitiME. In WST'03: International Workshop on Termination, 2003."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190257"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134029"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_1"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512770"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.006"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040315"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1767111.1767125"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s100090050043"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081706.1081713"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45069-6_27"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.588521"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/SEFM.2005.39"},{"key":"e_1_3_2_1_33_1","volume-title":"IFIP Congress","author":"Jones C.","year":"1983","unstructured":"C. Jones . Specification and design of (parallel) programs . In IFIP Congress , 1983 . C. Jones. Specification and design of (parallel) programs. In IFIP Congress, 1983."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_28"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/361227.361234"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288637"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-8609-1"},{"key":"e_1_3_2_1_38_1","volume-title":"VMCAI'04: Verification, Model Checking","author":"Podelski A.","year":"2004","unstructured":"A. Podelski and A. Rybalchenko . A complete method for the synthesis of linear ranking functions . In VMCAI'04: Verification, Model Checking , and Abstract Interpretation , 2004 . A. Podelski and A. Rybalchenko. A complete method for the synthesis of linear ranking functions. In VMCAI'04: Verification, Model Checking, and Abstract Interpretation, 2004."},{"key":"e_1_3_2_1_39_1","volume-title":"The Craft of Programming","author":"Reynolds J. C.","year":"1981","unstructured":"J. C. Reynolds . The Craft of Programming . London , 1981 . J. C. Reynolds. The Craft of Programming. London, 1981."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27813-9_6"}],"event":{"name":"PLDI '07: ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"San Diego California USA","acronym":"PLDI '07","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250734.1250771","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1250734.1250771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:52:19Z","timestamp":1750243939000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1250734.1250771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,10]]},"references-count":39,"alternative-id":["10.1145\/1250734.1250771","10.1145\/1250734"],"URL":"https:\/\/doi.org\/10.1145\/1250734.1250771","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1273442.1250771","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2007,6,10]]},"assertion":[{"value":"2007-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}