{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:44:28Z","timestamp":1770284668973,"version":"3.49.0"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"5","license":[{"start":{"date-parts":[[2011,5,1]],"date-time":"2011-05-01T00:00:00Z","timestamp":1304208000000},"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":["Commun. ACM"],"published-print":{"date-parts":[[2011,5]]},"abstract":"<jats:p>In contrast to popular belief, proving termination is not always impossible.<\/jats:p>","DOI":"10.1145\/1941487.1941509","type":"journal-article","created":{"date-parts":[[2011,4,26]],"date-time":"2011-04-26T12:01:31Z","timestamp":1303819291000},"page":"88-98","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":97,"title":["Proving program termination"],"prefix":"10.1145","volume":"54","author":[{"given":"Byron","family":"Cook","sequence":"first","affiliation":[{"name":"University of London, England"}]},{"given":"Andreas","family":"Podelski","sequence":"additional","affiliation":[{"name":"University of Freiburg, Germany"}]},{"given":"Andrey","family":"Rybalchenko","sequence":"additional","affiliation":[{"name":"Universit\u00e4t M\u00fcnchen, Germany"}]}],"member":"320","published-online":{"date-parts":[[2011,5]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/SEFM.2007.32"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217935.1217943"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190249"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_35"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_47"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_8"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_48"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_109"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792878.1792896"},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of WST","author":"Codish M.","year":"2003","unstructured":"Codish , M. , Genaim , S. , Bruynooghe , M. , Gallagher , J. and Vanhoof , W . One loop at a time . In Proceedings of WST , 2003 . Codish, M., Genaim, S., Bruynooghe, M., Gallagher, J. and Vanhoof, W. One loop at a time. In Proceedings of WST, 2003."},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of TACAS","author":"Col","year":"2001","unstructured":"Col &amp;#243;n, M. and Sipma , H . Synthesis of linear ranking functions . In Proceedings of TACAS , 2001 . Col&amp;#243;n, M. and Sipma, H. Synthesis of linear ranking functions. In Proceedings of TACAS, 2001."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1190216.1190257"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_32"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1133981.1134029"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002000100065"},{"key":"e_1_2_1_16_1","volume-title":"Journal f&amp;#252;r die reine und angewandte Mathematik","author":"Farkas J.","year":"1902","unstructured":"Farkas , J. &amp;#220;ber die Theorie der einfachen Ungleichungen. Journal f&amp;#252;r die reine und angewandte Mathematik , 1902 . Farkas, J. &amp;#220;ber die Theorie der einfachen Ungleichungen. Journal f&amp;#252;r die reine und angewandte Mathematik, 1902."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11805618_23"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25979-4_15"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480886"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328459"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/69575.69577"},{"key":"e_1_2_1_23_1","volume-title":"Proceedings of OSDI","author":"Jula H.","year":"2008","unstructured":"Jula , H. , Tralamazza , D. , Zamfir , C. and Candea , G . Deadlock immunity: Enabling systems to defend against deadlocks . In Proceedings of OSDI , 2008 . Jula, H., Tralamazza, D., Zamfir, C. and Candea, G. Deadlock immunity: Enabling systems to defend against deadlocks. In Proceedings of OSDI, 2008."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360210"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2391451.2391479"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_36"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/646704.701881"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1981.230844"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_9"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24622-0_20"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018438.1021840"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1040305.1040317"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_31"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s2-30.1.264"},{"key":"e_1_2_1_35_1","volume-title":"Send in the Terminator. Scientific American (Nov","author":"Stix G.","year":"2006","unstructured":"Stix , G. Send in the Terminator. Scientific American (Nov . 2006 ). Stix, G. Send in the Terminator. Scientific American (Nov. 2006)."},{"key":"e_1_2_1_36_1","volume":"196","author":"Strachey C.","unstructured":"Strachey , C. An impossible program. Computer Journal , 196 5. Strachey, C. An impossible program. Computer Journal, 1965.","journal-title":"Computer Journal"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27813-9_6"},{"key":"e_1_2_1_38_1","volume-title":"On computable numbers, with an application to the Entscheidungsproblem","author":"Turing A.","year":"1936","unstructured":"Turing , A. On computable numbers, with an application to the Entscheidungsproblem . London Mathematical Society , 1936 . Turing, A. On computable numbers, with an application to the Entscheidungsproblem. London Mathematical Society, 1936."},{"key":"e_1_2_1_39_1","volume-title":"Report of a Conference on High Speed Automatic Calculating Machines","author":"Turing A.","year":"1949","unstructured":"Turing , A. Checking a large routine . In Report of a Conference on High Speed Automatic Calculating Machines , 1949 . Turing, A. Checking a large routine. In Report of a Conference on High Speed Automatic Calculating Machines, 1949."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_36"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1941487.1941509","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1941487.1941509","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:35Z","timestamp":1750244375000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1941487.1941509"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":39,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["10.1145\/1941487.1941509"],"URL":"https:\/\/doi.org\/10.1145\/1941487.1941509","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5]]},"assertion":[{"value":"2011-05-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}