{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T16:00:30Z","timestamp":1782316830146,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T00:00:00Z","timestamp":1683590400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,5,9]]},"DOI":"10.1145\/3575870.3587126","type":"proceedings-article","created":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T22:42:27Z","timestamp":1683585747000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["BERN-NN: Tight Bound Propagation For Neural Networks Using Bernstein Polynomial Interval Arithmetic"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4600-0909","authenticated-orcid":false,"given":"Wael","family":"Fatnassi","sequence":"first","affiliation":[{"name":"University of California, Irvine, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3220-1558","authenticated-orcid":false,"given":"Haitham","family":"Khedr","sequence":"additional","affiliation":[{"name":"Univeristy of California, Irvine, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-3386-5582","authenticated-orcid":false,"given":"Valen","family":"Yamamoto","sequence":"additional","affiliation":[{"name":"Univeristy of California, Irvine, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8224-8477","authenticated-orcid":false,"given":"Yasser","family":"Shoukry","sequence":"additional","affiliation":[{"name":"Univeristy of California, Irvine, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,5,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01474-5"},{"key":"e_1_3_2_1_2_1","volume-title":"The Second International Verification of Neural Networks Competition (VNN-COMP 2021): Summary and Results. CoRR abs\/2109.00498","author":"Bak Stanley","year":"2021","unstructured":"Stanley Bak, Changliu Liu, and Taylor\u00a0T. Johnson. 2021. The Second International Verification of Neural Networks Competition (VNN-COMP 2021): Summary and Results. CoRR abs\/2109.00498 (2021), 1\u201315."},{"key":"e_1_3_2_1_3_1","volume-title":"Advances in Neural Information Processing Systems, Vol.\u00a029","author":"Bastani Osbert","unstructured":"Osbert Bastani, Yani Ioannou, Leonidas Lampropoulos, Dimitrios Vytiniotis, Aditya Nori, and Antonio Criminisi. 2016. Measuring Neural Net Robustness with Constraints. In Advances in Neural Information Processing Systems, Vol.\u00a029. Association for Computing Machinery, Barcelona, Spain, 2613\u20132621."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5729"},{"key":"e_1_3_2_1_5_1","first-page":"1","article-title":"Branch and bound for piecewise linear neural network verification","volume":"21","author":"Bunel Rudy","year":"2020","unstructured":"Rudy Bunel, Jingyue Lu, Ilker Turkaslan, P Kohli, P Torr, and P Mudigonda. 2020. Branch and bound for piecewise linear neural network verification. Journal of Machine Learning Research 21, 42 (2020), 1\u201339.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68167-2_18"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1959-0113131-7"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3302504.3313351"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3302504.3311807"},{"key":"e_1_3_2_1_10_1","unstructured":"Krishnamurthy Dvijotham Robert Stanforth Sven Gowal Timothy\u00a0A Mann and Pushmeet Kohli. 2018. A Dual Approach to Scalable Verification of Deep Networks.. In Uncertainty in Artificial Intelligence Amir Globerson and Ricardo Silva (Eds.). Vol.\u00a01. 550\u2013559."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-59152-6_30"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cagd.2012.03.001"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8396(88)90016-7"},{"key":"e_1_3_2_1_14_1","volume-title":"Advances in Neural Information Processing Systems, H.\u00a0Wallach, H.\u00a0Larochelle, A.\u00a0Beygelzimer, F.\u00a0d'Alch\u00e9-Buc, E.\u00a0Fox, and R.\u00a0Garnett (Eds.). Vol.\u00a032. Curran Associates","author":"Fazlyab Mahyar","unstructured":"Mahyar Fazlyab, Alexander Robey, Hamed Hassani, Manfred Morari, and George Pappas. 2019. Efficient and accurate estimation of lipschitz constants for deep neural networks. In Advances in Neural Information Processing Systems, H.\u00a0Wallach, H.\u00a0Larochelle, A.\u00a0Beygelzimer, F.\u00a0d'Alch\u00e9-Buc, E.\u00a0Fox, and R.\u00a0Garnett (Eds.). Vol.\u00a032. Curran Associates, Inc., 11423\u201311434."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-018-9285-6"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-53288-8_6"},{"key":"e_1_3_2_1_17_1","volume-title":"International Symposium on Interval Mathematics. Springer, 37\u201356","author":"Garloff J\u00fcrgen","year":"1985","unstructured":"J\u00fcrgen Garloff. 1985. Convergent bounds for the range of multivariate polynomials. In International Symposium on Interval Mathematics. Springer, 37\u201356."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/pamm.200700501"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00058"},{"key":"e_1_3_2_1_20_1","volume-title":"DEEPSPLIT: An efficient splitting method for neural network verification via indirect effect analysis. In IJCAI. 2549\u20132555.","author":"Henriksen Patrick","year":"2021","unstructured":"Patrick Henriksen and Alessio Lomuscio. 2021. DEEPSPLIT: An efficient splitting method for neural network verification via indirect effect analysis. In IJCAI. 2549\u20132555."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-19992-9_27"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3302504.3311806"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63387-9_5"},{"key":"e_1_3_2_1_24_1","volume-title":"Computer Aided Verification, Alexandra Silva and K.\u00a0Rustan\u00a0M","author":"Khedr Haitham","unstructured":"Haitham Khedr, James Ferlez, and Yasser Shoukry. 2021. PEREGRiNN: Penalized-Relaxation Greedy Neural Network Verifier. In Computer Aided Verification, Alexandra Silva and K.\u00a0Rustan\u00a0M. Leino (Eds.). Springer International Publishing, Cham, 287\u2013300."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781680837872"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.05.306"},{"key":"e_1_3_2_1_27_1","first-page":"40","article-title":"A Matrix Method for Efficient Computation of Bernstein Coefficients","volume":"17","author":"Ray Shashwati","year":"2012","unstructured":"Shashwati Ray and PSV Nataraj. 2012. A Matrix Method for Efficient Computation of Bernstein Coefficients.Reliab. Comput. 17, 1 (2012), 40\u201371.","journal-title":"Reliab. Comput."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0010-4485(03)00021-6"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-007-9195-4"},{"key":"e_1_3_2_1_30_1","volume-title":"Interval methods for bounding the range of polynomials and solving systems of nonlinear equations. Ph.\u00a0D. Dissertation","author":"Stahl Volker","unstructured":"Volker Stahl. 1995. Interval methods for bounding the range of polynomials and solving systems of nonlinear equations. Ph.\u00a0D. Dissertation. Johannes Kepler University Linz."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3302504.3311802"},{"key":"e_1_3_2_1_32_1","volume-title":"Neurosymbolic motion and task planning for linear temporal logic tasks. arXiv preprint arXiv:2210.05180","author":"Sun Xiaowu","year":"2022","unstructured":"Xiaowu Sun and Yasser Shoukry. 2022. Neurosymbolic motion and task planning for linear temporal logic tasks. arXiv preprint arXiv:2210.05180 (2022)."},{"key":"e_1_3_2_1_33_1","volume-title":"Evaluating Robustness of Neural Networks with Mixed Integer Programming. In International Conference on Learning Representations.","author":"Tjeng Vincent","year":"2019","unstructured":"Vincent Tjeng, Kai\u00a0Y. Xiao, and Russ Tedrake. 2019. Evaluating Robustness of Neural Networks with Mixed Integer Programming. In International Conference on Learning Representations."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-53288-8_1"},{"key":"e_1_3_2_1_35_1","unstructured":"Shiqi Wang Kexin Pei Justin Whitehouse Junfeng Yang and Suman Jana. 2018. Efficient formal safety analysis of neural networks. In Advances in Neural Information Processing Systems S.\u00a0Bengio H.\u00a0Wallach H.\u00a0Larochelle K.\u00a0Grauman N.\u00a0Cesa-Bianchi and R.\u00a0Garnett (Eds.). Vol.\u00a031. 6367\u20136377."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/3277203.3277323"},{"key":"e_1_3_2_1_37_1","unstructured":"Shiqi Wang Huan Zhang Kaidi Xu Xue Lin Suman Jana Cho-Jui Hsieh and J\u00a0Zico Kolter. 2021. Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Neural Network Robustness Verification. In Advances in Neural Information Processing Systems."},{"key":"e_1_3_2_1_38_1","volume-title":"International conference on machine learning. 5286\u20135295","author":"Wong Eric","year":"2018","unstructured":"Eric Wong and Zico Kolter. 2018. Provable defenses against adversarial examples via the convex outer adversarial polytope. In International conference on machine learning. 5286\u20135295."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2808470"},{"key":"e_1_3_2_1_40_1","volume-title":"Reachable Set Estimation and Safety Verification for Piecewise Linear Systems with Neural Network Controllers. In 2018 Annual American Control Conference (ACC). 1574\u20131579","author":"Xiang Weiming","year":"2018","unstructured":"Weiming Xiang, Hoang-Dung Tran, Joel\u00a0A. Rosenfeld, and Taylor\u00a0T. Johnson. 2018. Reachable Set Estimation and Safety Verification for Piecewise Linear Systems with Neural Network Controllers. In 2018 Annual American Control Conference (ACC). 1574\u20131579."},{"key":"e_1_3_2_1_41_1","unstructured":"Kaidi Xu Huan Zhang Shiqi Wang Yihan Wang Suman Jana Xue Lin and Cho-Jui Hsieh. 2021. Fast and Complete: Enabling Complete Neural Network Verification with Rapid and Massively Parallel Incomplete Verifiers. In ICLR."}],"event":{"name":"HSCC '23: 26th ACM International Conference on Hybrid Systems: Computation and Control","location":"San Antonio TX USA","acronym":"HSCC '23","sponsor":["SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 26th ACM International Conference on Hybrid Systems: Computation and Control"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3575870.3587126","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3575870.3587126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:46:12Z","timestamp":1750178772000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3575870.3587126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,9]]},"references-count":41,"alternative-id":["10.1145\/3575870.3587126","10.1145\/3575870"],"URL":"https:\/\/doi.org\/10.1145\/3575870.3587126","relation":{},"subject":[],"published":{"date-parts":[[2023,5,9]]},"assertion":[{"value":"2023-05-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}