{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:01:39Z","timestamp":1740132099372,"version":"3.37.3"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,3,1]],"date-time":"2020-03-01T00:00:00Z","timestamp":1583020800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100013290","name":"National Key Research and Development Program of China Stem Cell and Translational Research","doi-asserted-by":"publisher","award":["2017YFB1001802"],"award-info":[{"award-number":["2017YFB1001802"]}],"id":[{"id":"10.13039\/501100013290","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61872445","61532007"],"award-info":[{"award-number":["61872445","61532007"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Rel."],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1109\/tr.2019.2925037","type":"journal-article","created":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T19:55:12Z","timestamp":1565812512000},"page":"203-215","source":"Crossref","is-referenced-by-count":4,"title":["Hierarchical Analysis of Loops With Relaxed Abstract Transformers"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8711-6126","authenticated-orcid":false,"given":"Banghu","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liqian","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2349-3667","authenticated-orcid":false,"given":"Jiangchao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0637-8744","authenticated-orcid":false,"given":"Ji","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75221-9_4"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1145\/3093333.3009864","article-title":"Complexity verification using guided theorem enumeration","volume":"52","author":"sahin","year":"2017","journal-title":"ACM SIGPLAN Notices"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3106237.3106281"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2007.01.002"},{"key":"ref31","first-page":"31","article-title":"Fast inference of polynomial invariants for imperative programs","author":"cachera","year":"0"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73721-8_11"},{"key":"ref37","first-page":"280","article-title":"An abstract interpretation approach for automatic generation of polynomial invariants","author":"kapur","year":"0","journal-title":"Proc Int Static Anal Symp"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0039704"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2015.12.005"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_41"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45848-4_2"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68167-2_26"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010248"},{"journal-title":"Introduction to interval analysis","year":"0","author":"moore","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1023\/B:NUMA.0000049462.70970.b6"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/11609773_23"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03237-0_21"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_17"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49122-5_1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55844-6_142"},{"journal-title":"Interproc Analyzer for Recursive Programs with Numerical Variables","year":"0","author":"jeannet","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3158142"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_47"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_31"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512770"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27940-9_16"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2568225.2568275"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1080\/00207168908803778"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2185632.2185651"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24725-8_4"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-006-8609-1"},{"key":"ref9","first-page":"272","article-title":"Combination of abstractions in the Astrée static analyzer","author":"cousot","year":"0","journal-title":"Proc Annu Asian Comput Sci Conf"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3158143"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2509136.2509511"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2590811"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2017.8115689"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2535838.2535843"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70545-1_35"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2556782"},{"key":"ref41","first-page":"675","article-title":"Verification for non-polynomial hybrid systems using rational invariants","volume":"60","author":"lin","year":"2017","journal-title":"Comput J"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_52"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66706-5_10"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/982962.964028"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30579-8_3"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2006.03.003"}],"container-title":["IEEE Transactions on Reliability"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/24\/9023405\/08799013.pdf?arnumber=8799013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T13:42:38Z","timestamp":1651066958000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8799013\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3]]},"references-count":46,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tr.2019.2925037","relation":{},"ISSN":["0018-9529","1558-1721"],"issn-type":[{"type":"print","value":"0018-9529"},{"type":"electronic","value":"1558-1721"}],"subject":[],"published":{"date-parts":[[2020,3]]}}}