{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:07Z","timestamp":1759638007033,"version":"3.37.3"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472429","61572024","61103110"],"award-info":[{"award-number":["61472429","61572024","61103110"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2018.2890692","type":"journal-article","created":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T19:48:17Z","timestamp":1546372097000},"page":"9971-9979","source":"Crossref","is-referenced-by-count":5,"title":["Ranking Function Detection via SVM: A More General Method"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5142-970X","authenticated-orcid":false,"given":"Yue","family":"Yuan","sequence":"first","affiliation":[]},{"given":"Yi","family":"Li","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45410-1_4"},{"key":"ref30","first-page":"40","article-title":"An inequality-proving program applied to global optimization","author":"yang","year":"2000","journal-title":"Proc 3rd Asian Technol Conf Mathematics (ATCM)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45657-0_36"},{"key":"ref11","first-page":"1","article-title":"Proving program invariance and termination by parametric abstraction, Lagrangian relaxation and semidefinite programming","author":"cousot","year":"2005","journal-title":"Proc of Conference on Verification Model Checking and Abstract Interpretation (VMCAI)"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103687"},{"key":"ref13","first-page":"337","article-title":"Z3: An efficient SMT solver","author":"moura","year":"2008","journal-title":"Proc Theory Pract Softw 14th Int Conf Tools Algorithms Construction Anal Syst (TACAS\/ETAPS)"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/978-3-319-96145-3_7","article-title":"Syntax-guided termination analysis","author":"fedyukovich","year":"2018","journal-title":"Proc Int Conf Comput Aided Verification"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39799-8_27"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360210"},{"key":"ref17","first-page":"172","article-title":"Ranking templates for linear loops","author":"leike","year":"2014","journal-title":"Tools and Algorithms for the Construction and Analysis of Systems"},{"key":"ref18","first-page":"266","article-title":"Geometric nontermination arguments","author":"leike","year":"2018","journal-title":"Proc Int Conf Tools Algorithms Construction Anal Syst"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-69483-2_8"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38856-9_5"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/11513988_48","article-title":"Linear ranking with reachability","author":"bradley","year":"2005","journal-title":"Computer Aided Verification"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","article-title":"On computable numbers, with an application to the entscheidungs problem","volume":"42","author":"turing","year":"1937","journal-title":"Proc London Math Soc"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63390-9_32"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_34"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1142\/9951"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_109"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192405"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75292-9_3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2629488"},{"key":"ref9","first-page":"67","article-title":"Synthesis of linear ranking functions","author":"col\u00f3n","year":"2001","journal-title":"Proc Int Conf Tools Algorithms Construction Anal Syst"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2505879.2505884"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.03.036"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24622-0_20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2016.8"},{"journal-title":"Scikit-learn Machine Learning in Python","year":"2007","key":"ref24"},{"journal-title":"The Regularchains Library","year":"2017","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27813-9_6"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s11424-013-1004-1"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08598652.pdf?arnumber=8598652","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T22:18:17Z","timestamp":1643235497000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8598652\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2890692","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}