{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T07:01:32Z","timestamp":1779087692948,"version":"3.51.4"},"publisher-location":"Cham","reference-count":49,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031331695","type":"print"},{"value":"9783031331701","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33170-1_2","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:55:27Z","timestamp":1685710527000},"page":"16-36","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":34,"title":["Open- and Closed-Loop Neural Network Verification Using Polynomial Zonotopes"],"prefix":"10.1007","author":[{"given":"Niklas","family":"Kochdumper","sequence":"first","affiliation":[]},{"given":"Christian","family":"Schilling","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Althoff","sequence":"additional","affiliation":[]},{"given":"Stanley","family":"Bak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"2_CR1","unstructured":"Althoff, M.: Reachability analysis and its application to the safety assessment of autonomous cars. Ph.D. thesis, Technical University of Munich (2010)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Althoff, M.: Reachability analysis of nonlinear systems using conservative polynomialization and non-convex sets. In: Proceedings of the International Conference on Hybrid Systems: Computation and Control, pp. 173\u2013182 (2013)","DOI":"10.1145\/2461328.2461358"},{"key":"2_CR3","unstructured":"Althoff, M.: An introduction to CORA 2015. In: Proceedings of the International Workshop on Applied Verification for Continuous and Hybrid Systems, pp. 120\u2013151 (2015)"},{"key":"2_CR4","unstructured":"Bak, S., Liu, C., Johnson, T.: The second international verification of neural networks competition (VNN-COMP 2021): Summary and results. arXiv:2109.00498 (2021)"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0893-6080(94)90067-1","volume":"7","author":"F Beaufays","year":"1994","unstructured":"Beaufays, F., Abdel-Magid, Y., Widrow, B.: Application of neural networks to load-frequency control in power systems. Neural Netw. 7(1), 183\u2013194 (1994)","journal-title":"Neural Netw."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Bogomolov, S., et al.: JuliaReach: a toolbox for set-based reachability. In: Proceedings of the International Conference on Hybrid Systems: Computation and Control, pp. 39\u201344 (2019)","DOI":"10.1145\/3302504.3311804"},{"key":"2_CR7","unstructured":"Bunel, R., et al.: Branch and bound for piecewise linear neural network verification. J. Mach. Learn. Res. 21(42) (2020)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Cheng, C.H., N\u00fchrenberg, G., Ruess, H.: Maximum resilience of artificial neural networks. In: Proceedings of the International Symposium on Automated Technology for Verification and Analysis, pp. 251\u2013268 (2017)","DOI":"10.1007\/978-3-319-68167-2_18"},{"issue":"5","key":"2_CR9","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1142\/S0218213007003540","volume":"16","author":"C Christakou","year":"2007","unstructured":"Christakou, C., Vrettos, S., Stafylopatis, A.: A hybrid movie recommender system based on neural networks. Int. J. Artif. Intell. Tools 16(5), 771\u2013792 (2007)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Clavi\u00e8re, A., et al.: Safety verification of neural network controlled systems. In: Proceedings of the International Conference on Dependable Systems and Networks, pp. 47\u201354 (2021)","DOI":"10.1109\/DSN-W52860.2021.00019"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"David, O.E., Netanyahu, N.S., Wolf, L.: DeepChess: end-to-end deep neural network for automatic learning in chess. In: Proceedings of the International Conference on Artificial Neural Networks, pp. 88\u201396 (2016)","DOI":"10.1007\/978-3-319-44781-0_11"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Dutta, S., et al.: Learning and verification of feedback control systems using feedforward neural networks. In: Proceedings of the International Conference on Analysis and Design of Hybrid Systems, pp. 151\u2013156 (2018)","DOI":"10.1016\/j.ifacol.2018.08.026"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Dutta, S., et al.: Sherlock-a tool for verification of neural network feedback systems. In: Proceedings of the International Conference on Hybrid Systems: Computation and Control, pp. 262\u2013263 (2019)","DOI":"10.1145\/3302504.3313351"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Dutta, S., Chen, X., Sankaranarayanan, S.: Reachability analysis for neural feedback systems using regressive polynomial rule inference. In: Proceedings of the International Conference on Hybrid Systems: Computation and Control, pp. 157\u2013168 (2019)","DOI":"10.1145\/3302504.3311807"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Ehlers, R.: Formal verification of piece-wise linear feed-forward neural networks. In: Proceedings of the International Symposium on Automated Technology for Verification and Analysis, pp. 269\u2013286 (2017)","DOI":"10.1007\/978-3-319-68167-2_19"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Fan, J., Huang, et al.: ReachNN*: a tool for reachability analysis of neural-network controlled systems. In: Proceedings of the International Symposium on Automated Technology for Verification and Analysis, pp. 537\u2013542 (2020)","DOI":"10.1007\/978-3-030-59152-6_30"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Goubault, E., Putot, S.: RINO: robust inner and outer approximated reachability of neural networks controlled systems. In: Proceedings of the International Conference on Computer Aided Verification, pp. 511\u2013523 (2022)","DOI":"10.1007\/978-3-031-13185-1_25"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Huang, C., et al.: ReachNN: reachability analysis of neural-network controlled systems. Trans. Embed. Comput. Syst. 18(5s) (2019)","DOI":"10.1145\/3358228"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Huang, C., et al.: POLAR: A polynomial arithmetic framework for verifying neural-network controlled systems. In: Proceedings of the International Symposium on Automated Technology for Verification and Analysis, pp. 414\u2013430 (2022)","DOI":"10.1007\/978-3-031-19992-9_27"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Ivanov, R., et al.: Verisig: verifying safety properties of hybrid systems with neural network controllers. In: Proceedings of the International Conference on Hybrid Systems: Computation and Control, pp. 169\u2013178 (2019)","DOI":"10.1145\/3302504.3311806"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Ivanov, R., et al.: Verisig 2.0: verification of neural network controllers using Taylor model preconditioning. In: Proceedings of the International Conference on Computer Aided Verification, pp. 249\u2013262 (2021)","DOI":"10.1007\/978-3-030-81685-8_11"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Katz, G., et al.: Reluplex: an efficient SMT solver for verifying deep neural networks. In: Proceedings of the International Conference on Computer Aided Verification, pp. 97\u2013117 (2017)","DOI":"10.1007\/978-3-319-63387-9_5"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Khan, S., et al.: Facial recognition using convolutional neural networks and implementation on smart glasses. In: Proceedings of the International Conference on Information Science and Communication Technology (2019). Article 19","DOI":"10.1109\/CISCT.2019.8777442"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Khedr, H., Ferlez, J., Shoukry, Y.: PEREGRiNN: penalized-relaxation greedy neural network verifier. In: Proceedings of the International Conference on Computer Aided Verification, pp. 287\u2013300 (2021)","DOI":"10.1007\/978-3-030-81685-8_13"},{"issue":"9","key":"2_CR25","doi-asserted-by":"publisher","first-page":"4043","DOI":"10.1109\/TAC.2020.3024348","volume":"66","author":"N Kochdumper","year":"2021","unstructured":"Kochdumper, N., Althoff, M.: Sparse polynomial zonotopes: a novel set representation for reachability analysis. Trans. Autom. Control 66(9), 4043\u20134058 (2021)","journal-title":"Trans. Autom. Control"},{"key":"2_CR26","unstructured":"Makino, K., Berz, M.: Taylor models and other validated functional inclusion methods. Int. J. Pure and Appl. Math. 4(4), 379\u2013456 (2003)"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Mukherjee, D., et al.: A survey of robot learning strategies for human-robot collaboration in industrial settings. Robot. Comput.-Integr. Manuf. 73 (2022)","DOI":"10.1016\/j.rcim.2021.102231"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"M\u00fcller, M.N., et al.: PRIMA: precise and general neural network certification via multi-neuron convex relaxations. Proceedings on Programming Languages 1 (2022). Article 43","DOI":"10.1145\/3498704"},{"key":"2_CR29","unstructured":"M\u00fcller, M.N., et al.: The third international verification of neural networks competition (VNN-COMP 2022): summary and results. arXiv preprint arXiv:2212.10376 (2022)"},{"issue":"2","key":"2_CR30","doi-asserted-by":"publisher","first-page":"117","DOI":"10.3233\/AIC-2012-0525","volume":"25","author":"L Pulina","year":"2012","unstructured":"Pulina, L., Tacchella, A.: Challenging SMT solvers to verify neural networks. AI Commun. 25(2), 117\u2013135 (2012)","journal-title":"AI Commun."},{"key":"2_CR31","unstructured":"Raghunathan, A., Steinhardt, J., Liang, P.: Semidefinite relaxations for certifying robustness to adversarial examples. In: Proceedings of the International Conference on Neural Information Processing Systems, pp. 10900\u201310910 (2018)"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Riedmiller, M., Montemerlo, M., Dahlkamp, H.: Learning to drive a real car in 20 minutes. In: Proceedings of the International Conference on Frontiers in the Convergence of Bioscience and Information Technologies, pp. 645\u2013650 (2007)","DOI":"10.1109\/FBIT.2007.37"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Schilling, C., Forets, M., Guadalupe, S.: Verification of neural-network control systems by integrating Taylor models and zonotopes. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp. 8169\u20138177 (2022)","DOI":"10.1609\/aaai.v36i7.20790"},{"key":"2_CR34","unstructured":"Singh, G., et al.: Fast and effective robustness certification. In: Proceedings of the International Conference on Advances in Neural Information Processing Systems (2018)"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Singh, G., et al.: An abstract domain for certifying neural networks. Proce. Prog. Lang. 3 (2019). Article 41","DOI":"10.1145\/3290354"},{"key":"2_CR36","unstructured":"Singh, G., et al.: Beyond the single neuron convex barrier for neural network certification. In: Proceedings of the International Conference on Advances in Neural Information Processing Systems (2019)"},{"key":"2_CR37","unstructured":"Tjeng, V., Xiao, K.Y., Tedrake, R.: Evaluating robustness of neural networks with mixed integer programming. In: Proceedings of the International Conference on Learning Representations (2019)"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Tran, H.D., et al.: Parallelizable reachability analysis algorithms for feed-forward neural networks. In: Proceedings of the International Conference on Formal Methods in Software Engineering, pp. 51\u201360 (2019)","DOI":"10.1109\/FormaliSE.2019.00012"},{"key":"2_CR39","doi-asserted-by":"crossref","unstructured":"Tran, H.D., et al.: Safety verification of cyber-physical systems with reinforcement learning control. Trans. Embedded Comput. Syst. 18(5s) (2019). Article 105","DOI":"10.1145\/3358230"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"Tran, H.D., et al.: Star-based reachability analysis of deep neural networks. In: Proceedings of the International Symposium on Formal Methods, pp. 670\u2013686 (2019)","DOI":"10.1007\/978-3-030-30942-8_39"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Tran, H.D., et al.: NNV: The neural network verification tool for deep neural networks and learning-enabled cyber-physical systems. In: Proc. of the Int. Conf. on Computer Aided Verification. pp. 3\u201317 (2020)","DOI":"10.1007\/978-3-030-53288-8_1"},{"key":"2_CR42","doi-asserted-by":"crossref","unstructured":"Vincent, J.A., Schwager, M.: reachable polyhedral marching (RPM): a safety verification algorithm for robotic systems with deep neural network components. In: Proceedings of the International Conference on Robotics and Automation, pp. 9029\u20139035 (2021)","DOI":"10.1109\/ICRA48506.2021.9561956"},{"key":"2_CR43","unstructured":"Wang, S., et al.: Formal security analysis of neural networks using symbolic intervals. In: Proceedings of the USENIX Security Symposium, pp. 1599\u20131614 (2018)"},{"key":"2_CR44","unstructured":"Wang, S., et al.: Beta-CROWN: efficient bound propagation with per-neuron split constraints for neural network robustness verification. In: Proceedings of the International Conference on Neural Information Processing Systems (2021)"},{"key":"2_CR45","unstructured":"Weng, L., et al.: Towards fast computation of certified robustness for ReLU networks. In: Proceedings of the International Conference on Machine Learning, pp. 5276\u20135285 (2018)"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Xiang, W., et al.: Reachable set estimation and safety verification for piecewise linear systems with neural network controllers. In: Proceedings of the American Control Conference, pp. 1574\u20131579 (2018)","DOI":"10.23919\/ACC.2018.8431048"},{"key":"2_CR47","unstructured":"Xu, K., et al.: Fast and complete: enabling complete neural network verification with rapid and massively parallel incomplete verifiers. In: Proceedings of the International Conference on Learning Representations (2021)"},{"key":"2_CR48","doi-asserted-by":"crossref","unstructured":"Yang, X., et al.: Reachability analysis of deep ReLU neural networks using facet-vertex incidence. In: Proceedings of the International Conference on Hybrid Systems: Computation and Control (2021). Article 18","DOI":"10.1145\/3447928.3456650"},{"key":"2_CR49","unstructured":"Zhang, H., et al.: Efficient neural network robustness certification with general activation functions. In: Proceedings of the International Conference on Neural Information Processing Systems, pp. 4944\u20134953 (2018)"}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33170-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:56:40Z","timestamp":1685710600000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33170-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331695","9783031331701"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33170-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Houston, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/nfm-2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}