{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T12:42:19Z","timestamp":1780317739145,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T00:00:00Z","timestamp":1621382400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,5,19]]},"DOI":"10.1145\/3447928.3456650","type":"proceedings-article","created":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T23:54:48Z","timestamp":1620086088000},"page":"1-7","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Reachability analysis of deep ReLU neural networks using facet-vertex incidence"],"prefix":"10.1145","author":[{"given":"Xiaodong","family":"Yang","sequence":"first","affiliation":[{"name":"Vanderbilt University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Taylor T","family":"Johnson","sequence":"additional","affiliation":[{"name":"Vanderbilt University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hoang-Dung","family":"Tran","sequence":"additional","affiliation":[{"name":"University of Nebraska"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tomoya","family":"Yamaguchi","sequence":"additional","affiliation":[{"name":"Toyota Research Institute"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bardh","family":"Hoxha","sequence":"additional","affiliation":[{"name":"Toyota Research Institute"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danil","family":"Prokhorov","sequence":"additional","affiliation":[{"name":"Toyota Research Institute"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,5,19]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Robust neural networks using randomized adversarial training. arXiv preprint arXiv:1903.10219","author":"Araujo Alexandre","year":"2019","unstructured":"Alexandre Araujo, Laurent Meunier, Rafael Pinot, and Benjamin Negrevergne. 2019. Robust neural networks using randomized adversarial training. arXiv preprint arXiv:1903.10219 (2019)."},{"key":"e_1_3_2_1_2_1","volume-title":"Johnson","author":"Bak Stanley","year":"2020","unstructured":"Stanley Bak, Hoang-Dung Tran, Kerianne Hobbs, and Taylor T. Johnson. 2020. Improved Geometric Path Enumeration for Verifying ReLU Neural Networks. In Proceedings of the 32nd International Conference on Computer Aided Verification. Springer."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Elena Botoeva Panagiotis Kouvaros Jan Kronqvist Alessio Lomuscio and Ruth Misener. 2020. Efficient Verification of ReLU-Based Neural Networks via Dependency Analysis.. In AAAI. 3291--3299.","DOI":"10.1609\/aaai.v34i04.5729"},{"key":"e_1_3_2_1_4_1","unstructured":"Rudy R Bunel Ilker Turkaslan Philip Torr Pushmeet Kohli and Pawan K Mudigonda. 2018. A unified view of piecewise linear neural network verification. In Advances in Neural Information Processing Systems. 4790--4799."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3302504.3311807"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77935-5_9"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-53288-8_3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00058"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0019-9"},{"key":"e_1_3_2_1_10_1","volume-title":"Complexity of linear regions in deep networks. arXiv preprint arXiv:1901.09021","author":"Hanin Boris","year":"2019","unstructured":"Boris Hanin and David Rolnick. 2019. Complexity of linear regions in deep networks. arXiv preprint arXiv:1901.09021 (2019)."},{"key":"e_1_3_2_1_11_1","volume-title":"16 basic properties of convex polytopes. Handbook of discrete and computational geometry","author":"Henk Martin","year":"2004","unstructured":"Martin Henk, J\u00fcrgen Richter-Gebert, and G\u00fcnter M Ziegler. 2004. 16 basic properties of convex polytopes. Handbook of discrete and computational geometry (2004), 255--382."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Patrick Henriksen and A Lomuscio. 2019. Efficient Neural Network Verification via Adaptive Refinement and Adversarial Search. Ph.D. Dissertation. Imperial College London.","DOI":"10.3233\/FAIA200385"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63387-9_1"},{"key":"e_1_3_2_1_14_1","volume-title":"Dimension Theory (PMS-4)","author":"Hurewicz Witold","unstructured":"Witold Hurewicz and Henry Wallman. 2015. Dimension Theory (PMS-4). Vol. 4. Princeton university press."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3302504.3311806"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/DASC.2016.7778091"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63387-9_5"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-25540-4_26"},{"key":"e_1_3_2_1_19_1","volume-title":"Formal verification of cnn-based perception systems. arXiv preprint arXiv:1811.11373","author":"Kouvaros Panagiotis","year":"2018","unstructured":"Panagiotis Kouvaros and Alessio Lomuscio. 2018. Formal verification of cnn-based perception systems. arXiv preprint arXiv:1811.11373 (2018)."},{"key":"e_1_3_2_1_20_1","volume":"201","author":"Liu Changliu","unstructured":"Changliu Liu, Tomer Arnon, Christopher Lazarus, Clark Barrett, and Mykel J Kochenderfer. 2019. Algorithms for verifying deep neural networks. arXiv preprint arXiv:1903.06758 (2019).","journal-title":"Mykel J Kochenderfer."},{"key":"e_1_3_2_1_21_1","volume-title":"An approach to reachability analysis for feed-forward relu neural networks. arXiv preprint arXiv:1706.07351","author":"Lomuscio Alessio","year":"2017","unstructured":"Alessio Lomuscio and Lalit Maganti. 2017. An approach to reachability analysis for feed-forward relu neural networks. arXiv preprint arXiv:1706.07351 (2017)."},{"key":"e_1_3_2_1_22_1","volume-title":"International Conference on Machine Learning. 3578--3586","author":"Mirman Matthew","year":"2018","unstructured":"Matthew Mirman, Timon Gehr, and Martin Vechev. 2018. Differentiable abstract interpretation for provably robust neural networks. In International Conference on Machine Learning. 3578--3586."},{"key":"e_1_3_2_1_23_1","unstructured":"Guido F Montufar Razvan Pascanu Kyunghyun Cho and Yoshua Bengio. 2014. On the number of linear regions of deep neural networks. In Advances in neural information processing systems. 2924--2932."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_24"},{"key":"e_1_3_2_1_25_1","volume-title":"Reachability analysis of deep neural networks with provable guarantees. arXiv preprint arXiv:1805.02242","author":"Ruan Wenjie","year":"2018","unstructured":"Wenjie Ruan, Xiaowei Huang, and Marta Kwiatkowska. 2018. Reachability analysis of deep neural networks with provable guarantees. arXiv preprint arXiv:1805.02242 (2018)."},{"key":"e_1_3_2_1_26_1","volume-title":"Bounding and counting linear regions of deep neural networks. arXiv preprint arXiv:1711.02114","author":"Serra Thiago","year":"2017","unstructured":"Thiago Serra, Christian Tjandraatmadja, and Srikumar Ramalingam. 2017. Bounding and counting linear regions of deep neural networks. arXiv preprint arXiv:1711.02114 (2017)."},{"key":"e_1_3_2_1_27_1","unstructured":"Gagandeep Singh Timon Gehr Matthew Mirman Markus P\u00fcschel and Martin Vechev. 2018. Fast and effective robustness certification. In Advances in Neural Information Processing Systems. 10825--10836."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290354"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/FormaliSE.2019.00012"},{"key":"e_1_3_2_1_30_1","volume-title":"Xiaodong Yang, Luan Viet Nguyen, Weiming Xiang, and Taylor T. Johnson.","author":"Tran Hoang-Dung","year":"2019","unstructured":"Hoang-Dung Tran, Patrick Musau, Diego Manzanas Lopez, Xiaodong Yang, Luan Viet Nguyen, Weiming Xiang, and Taylor T. Johnson. 2019. Star-Based Reachability Analsysis for Deep Neural Networks. In 23rd International Symposisum on Formal Methods (FM'19). Springer International Publishing."},{"key":"e_1_3_2_1_31_1","volume-title":"Patrick Musau, Luan Viet Nguyen, Weiming Xiang, Stanley Bak, and Taylor T Johnson.","author":"Tran Hoang-Dung","year":"2020","unstructured":"Hoang-Dung Tran, Xiaodong Yang, Diego Manzanas Lopez, Patrick Musau, Luan Viet Nguyen, Weiming Xiang, Stanley Bak, and Taylor T Johnson. 2020. NNV: The Neural Network Verification Tool for Deep Neural Networks and Learning-Enabled Cyber-Physical Systems. arXiv preprint arXiv:2004.05519 (2020)."},{"key":"e_1_3_2_1_32_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. 6369--6379."},{"key":"e_1_3_2_1_33_1","volume-title":"27th {USENLX} Security Symposium ({USENIX} Security 18). 1599--1614.","author":"Wang Shiqi","unstructured":"Shiqi Wang, Kexin Pei, Justin Whitehouse, Junfeng Yang, and Suman Jana. 2018. Formal security analysis of neural networks using symbolic intervals. In 27th {USENLX} Security Symposium ({USENIX} Security 18). 1599--1614."},{"key":"e_1_3_2_1_34_1","volume-title":"Towards fast computation of certified robustness for relu networks. arXiv preprint arXiv:1804.09699","author":"Weng Tsui-Wei","year":"2018","unstructured":"Tsui-Wei Weng, Huan Zhang, Hongge Chen, Zhao Song, Cho-Jui Hsieh, Duane Boning, Inderjit S Dhillon, and Luca Daniel. 2018. Towards fast computation of certified robustness for relu networks. arXiv preprint arXiv:1804.09699 (2018)."},{"key":"e_1_3_2_1_35_1","volume-title":"International Conference on Machine Learning. PMLR, 5286--5295","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. PMLR, 5286--5295."},{"key":"e_1_3_2_1_36_1","volume-title":"Reachable set computation and safety verification for neural networks with ReLU activations. arXiv preprint arXiv:1712.08163","author":"Xiang Weiming","year":"2017","unstructured":"Weiming Xiang, Hoang Tran, and Taylor Johnson. 2017. Reachable set computation and safety verification for neural networks with ReLU activations. arXiv preprint arXiv:1712.08163 (2017)."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2018.2808470"},{"key":"e_1_3_2_1_38_1","unstructured":"Huan Zhang Tsui-Wei Weng Pin-Yu Chen Cho-Jui Hsieh and Luca Daniel. 2018. Efficient neural network robustness certification with general activation functions. In Advances in Neural Infarmation Processing Systems. 4944--4953."}],"event":{"name":"HSCC '21: 24th ACM International Conference on Hybrid Systems: Computation and Control","location":"Nashville Tennessee","acronym":"HSCC '21","sponsor":["SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447928.3456650","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447928.3456650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T16:11:47Z","timestamp":1769011907000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447928.3456650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,19]]},"references-count":38,"alternative-id":["10.1145\/3447928.3456650","10.1145\/3447928"],"URL":"https:\/\/doi.org\/10.1145\/3447928.3456650","relation":{},"subject":[],"published":{"date-parts":[[2021,5,19]]},"assertion":[{"value":"2021-05-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}