{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T02:31:37Z","timestamp":1774578697149,"version":"3.50.1"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100002427","name":"Ford Motor Company","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002427","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"ARL DCIST under Cooperative Agreement","doi-asserted-by":"publisher","award":["W911NF-17-2-0181"],"award-info":[{"award-number":["W911NF-17-2-0181"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007103","name":"Scientific Systems Company, Inc., under Research Agreement","doi-asserted-by":"publisher","award":["SC-1661-04"],"award-info":[{"award-number":["SC-1661-04"]}],"id":[{"id":"10.13039\/100007103","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3133370","type":"journal-article","created":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T20:54:48Z","timestamp":1638824088000},"page":"163938-163953","source":"Crossref","is-referenced-by-count":49,"title":["Reachability Analysis of Neural Feedback Loops"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9377-6745","authenticated-orcid":false,"given":"Michael","family":"Everett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Golnaz","family":"Habibi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuangchuang","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8576-1930","authenticated-orcid":false,"given":"Jonathan P.","family":"How","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1","article-title":"Analyzing inverse problems with invertible neural networks","author":"ardizzone","year":"2018","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.936019"},{"key":"ref33","first-page":"2909","article-title":"CVXPY: A Python-embedded modeling language for convex optimization","volume":"17","author":"diamond","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3387168.3387244"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2638961"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2002.1184414"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/060\/08"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2020.3045323"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2808470"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3056046"},{"key":"ref10","first-page":"4939","article-title":"Efficient neural network robustness certification with general activation functions","author":"zhang","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref40","first-page":"573","article-title":"Invertible residual networks","author":"behrmann","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref11","first-page":"5283","article-title":"Provable defenses against adversarial examples via the convex outer adversarial polytope","volume":"80","author":"wong","year":"2018","journal-title":"Proc ICML"},{"key":"ref12","first-page":"1","article-title":"Certified defenses against adversarial examples","author":"raghunathan","year":"2018","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref13","article-title":"Safety verification and robustness analysis of neural networks via quadratic constraints and semidefinite programming","author":"fazlyab","year":"2019","journal-title":"arXiv 1903 01287"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/5.871303"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2017.8263977"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3302504.3311807"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3358228"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59152-6_30"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3302504.3311806"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_5"},{"key":"ref4","first-page":"1","article-title":"An approach to reachability analysis for feed-forward Relu neural networks","volume":"abs 1706 7351","author":"lomuscio","year":"2017","journal-title":"CoRR"},{"key":"ref27","first-page":"1","article-title":"An introduction to CORA 2015","author":"althoff","year":"2015","journal-title":"Proc Workshop Appl Verification Continuous Hybrid Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63387-9_1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00058"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41528-4_29"},{"key":"ref5","first-page":"1","article-title":"Evaluating robustness of neural networks with mixed integer programming","author":"tjeng","year":"2019","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref8","first-page":"5276","article-title":"Towards fast computation of certified robustness for Relu networks","author":"weng","year":"2018","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref7","article-title":"On the effectiveness of interval bound propagation for training verifiably robust models","author":"gowal","year":"2018","journal-title":"arXiv 1810 12715"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63387-9_5"},{"key":"ref9","first-page":"10802","article-title":"Fast and effective robustness certification","author":"singh","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68167-2_19"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3216-0_8"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2991090"},{"key":"ref45","author":"chollet","year":"2015","journal-title":"Keras"},{"key":"ref48","first-page":"128","article-title":"Reachability analysis for polynomial dynamical systems using the Bernstein expansion","volume":"17","author":"dang","year":"2012","journal-title":"Rel Comput"},{"key":"ref22","volume":"19","author":"evans","year":"1998","journal-title":"Partial Differential Equations"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.29007\/btv1"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9304296"},{"key":"ref42","first-page":"1","article-title":"Fast and complete: Enabling complete neural network verification with rapid and massively parallel incomplete verifiers","author":"xu","year":"2021","journal-title":"Proc Int Conf Learn Represent"},{"key":"ref24","first-page":"1","article-title":"Intriguing properties of neural networks","author":"szegedy","year":"2014","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref41","first-page":"1","article-title":"Automatic perturbation analysis for scalable certified robustness and beyond","volume":"33","author":"xu","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561348"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39799-8_18"},{"key":"ref43","article-title":"Beta-CROWN: Efficient bound propagation with per-neuron split constraints for complete and incomplete neural network robustness verification","author":"wang","year":"2021","journal-title":"arXiv 2103 06624"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_30"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/6287639\/9312710\/9638658-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09638658.pdf?arnumber=9638658","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:53:43Z","timestamp":1649444023000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9638658\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3133370","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}