{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T07:32:16Z","timestamp":1770276736688,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,7]],"date-time":"2020-11-07T00:00:00Z","timestamp":1604707200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,11,8]]},"DOI":"10.1145\/3368089.3417930","type":"proceedings-article","created":{"date-parts":[[2020,11,8]],"date-time":"2020-11-08T06:03:47Z","timestamp":1604815427000},"page":"1635-1639","source":"Crossref","is-referenced-by-count":1,"title":["SVMRanker: a general termination analysis framework of loop programs via SVM"],"prefix":"10.1145","author":[{"given":"Xie","family":"Li","sequence":"first","affiliation":[{"name":"Institute of Software at Chinese Academy of Sciences, China \/ University of Chinese Academy of Sciences, China"}]},{"given":"Yi","family":"Li","sequence":"additional","affiliation":[{"name":"Chongqing Institute of Green and Intelligent Technology at Chinese Academy of Sciences, China"}]},{"given":"Yong","family":"Li","sequence":"additional","affiliation":[{"name":"Institute of Software at Chinese Academy of Sciences, China"}]},{"given":"Xuechao","family":"Sun","sequence":"additional","affiliation":[{"name":"Institute of Software at Chinese Academy of Sciences, China \/ University of Chinese Academy of Sciences, China"}]},{"given":"Andrea","family":"Turrini","sequence":"additional","affiliation":[{"name":"Institute of Software at Chinese Academy of Sciences, China"}]},{"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[{"name":"Institute of Software at Chinese Academy of Sciences, China \/ University of Chinese Academy of Sciences, China"}]}],"member":"320","published-online":{"date-parts":[[2020,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505879.2505884"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629488"},{"key":"e_1_3_2_1_3_1","volume-title":"Ben-Amram and Samir Genaim","author":"Amir","year":"2017"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11513988_48"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_109"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1777259.1777262"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646485.694449"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/647771.734281"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Corinna Cortes and Vladimir Vapnik. 1995. Support-Vector Networks. Mach. Learn. 20 3 ( 1995 ) 273-297.  Corinna Cortes and Vladimir Vapnik. 1995. Support-Vector Networks. Mach. Learn. 20 3 ( 1995 ) 273-297.","DOI":"10.1007\/BF00994018"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328897.1328459"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_53"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Jan Leike and Matthias Heizmann. 2015. Ranking Templates for Linear Loops. LMCS 11 1 ( 2015 ).  Jan Leike and Matthias Heizmann. 2015. Ranking Templates for Linear Loops. LMCS 11 1 ( 2015 ).","DOI":"10.2168\/LMCS-11(1:16)2015"},{"key":"e_1_3_2_1_15_1","volume-title":"TACAS (2 ) ( LNCS","author":"Leike Jan"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32409-4_27"},{"key":"e_1_3_2_1_17_1","first-page":"30","article-title":"The L-Depth Eventual Linear Ranking Functions for Single-Path Linear Constraint Loops","author":"Li Yi","year":"2016","journal-title":"TASE."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24622-0_20"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11424-013-1004-1"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s2-42.1.230"},{"key":"e_1_3_2_1_21_1","volume-title":"Proc. London Math. Soc. 2, 42 ( 1937 ), 544-546","author":"Turing Alan Mathison","year":"1937"},{"key":"e_1_3_2_1_22_1","volume-title":"Ranking Function Detection via SVM: A More General Method","author":"Yuan Yue","year":"2019"}],"event":{"name":"ESEC\/FSE '20: 28th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering","location":"Virtual Event USA","acronym":"ESEC\/FSE '20","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"]},"container-title":["Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3368089.3417930","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3368089.3417930","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:58Z","timestamp":1750197718000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3368089.3417930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,7]]},"references-count":22,"alternative-id":["10.1145\/3368089.3417930","10.1145\/3368089"],"URL":"https:\/\/doi.org\/10.1145\/3368089.3417930","relation":{},"subject":[],"published":{"date-parts":[[2020,11,7]]}}}