{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:28:10Z","timestamp":1762291690377,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032095237","type":"print"},{"value":"9783032095244","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-09524-4_14","type":"book-chapter","created":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:00Z","timestamp":1762290840000},"page":"202-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Counterexample-Guided Abstraction Refinement for Star-Based Neural Network Verification"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-4977-0959","authenticated-orcid":false,"given":"L\u00e1szl\u00f3","family":"Antal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8122-8456","authenticated-orcid":false,"given":"Franz","family":"Link","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5647-6134","authenticated-orcid":false,"given":"Erika","family":"\u00c1brah\u00e1m","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,5]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Antal, L., Masara, H., \u00c1brah\u00e1m, E.: Extending neural network verification to a larger family of piece-wise linear activation functions. In: Proceedings of the 5th International Workshop on Formal Methods for Autonomous Systems (FMAS@iFM 2023). EPTCS, vol.\u00a0395, pp. 30\u201368 (2023). https:\/\/doi.org\/10.4204\/EPTCS.395.4","DOI":"10.4204\/EPTCS.395.4"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Antal, L., \u00c1brah\u00e1m, E., Masara, H.: Generalizing neural network verification to the family of piece-wise linear activation functions. Sci. Comput. Program. 243, 103269 (2025)","DOI":"10.1016\/j.scico.2025.103269"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Bak, S.: nnenum: Verification of ReLU neural networks with optimized abstraction refinement. In: Proceedings of the 13th International Symposium on NASA Formal Methods (NFM 2021). LNCS, vol. 12673, pp. 19\u201336. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-76384-8_2","DOI":"10.1007\/978-3-030-76384-8_2"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-030-53288-8_4","volume-title":"Computer Aided Verification","author":"S Bak","year":"2020","unstructured":"Bak, S., Tran, H.-D., Hobbs, K., Johnson, T.T.: Improved geometric path enumeration for verifying ReLU neural networks. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12224, pp. 66\u201396. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_4"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-319-68167-2_19","volume-title":"Automated Technology for Verification and Analysis","author":"R Ehlers","year":"2017","unstructured":"Ehlers, R.: Formal verification of piece-wise linear feed-forward neural networks. In: D\u2019Souza, D., Narayan Kumar, K. (eds.) ATVA 2017. LNCS, vol. 10482, pp. 269\u2013286. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68167-2_19"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Erhan, D., Szegedy, C., Toshev, A., Anguelov, D.: Scalable object detection using deep neural networks. In: Proceedings of the 2014 IEEE Conference on Computer Vision and Pattern Recognition (CVPR 2014), pp. 2155\u20132162. IEEE (2014). https:\/\/doi.org\/10.1109\/CVPR.2014.276","DOI":"10.1109\/CVPR.2014.276"},{"key":"14_CR7","unstructured":"Guidotti, D.: Verification of neural networks for safety and security-critical domains. In: Proceedings of the 10th Italian Workshop on Planning and Scheduling (IPS 2022), RCRA Incontri E Confronti (RiCeRcA 2022), and the Workshop on Strategies, Prediction, Interaction, and Reasoning in Italy (SPIRIT 2022). CEUR Workshop Proceedings, vol.\u00a03345, pp. 1\u201310. CEUR-WS.org (2022). https:\/\/ceur-ws.org\/Vol-3345\/paper10_RiCeRCa3.pdf"},{"key":"14_CR8","unstructured":"Guidotti, D., Demarchi, S., Pulina, L., Tacchella, A.: Evaluating reachability algorithms for neural networks on NeVer2 (2022). https:\/\/www.researchgate.net\/publication\/363845518_Evaluating_Reachability_Algorithms_for_Neural_Networks_on_NeVer2"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"Hinton, G., et al.: Deep neural networks for acoustic modeling in speech recognition: The shared views of four research groups. IEEE Signal Process. Mag. 29(6), 82\u201397 (2012). https:\/\/doi.org\/10.1109\/MSP.2012.2205597","DOI":"10.1109\/MSP.2012.2205597"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TITS.2019.2962338","volume":"22","author":"S Kuutti","year":"2021","unstructured":"Kuutti, S., Bowden, R., Jin, Y., Barber, P., Fallah, S.: A survey of deep learning applications to autonomous vehicle control. IEEE Trans. Intell. Transp. Syst. 22(2), 712\u2013733 (2021). https:\/\/doi.org\/10.1109\/TITS.2019.2962338","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"7553","key":"14_CR11","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521(7553), 436\u2013444 (2015). https:\/\/doi.org\/10.1038\/nature14539","journal-title":"Nature"},{"key":"14_CR12","unstructured":"Lee, A.: Comparing deep neural networks and traditional vision algorithms in mobile robotics. Swarthmore University (2015). https:\/\/api.semanticscholar.org\/CorpusID:10011895"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Schupp, S., \u00c1brah\u00e1m, E., Makhlouf, I., Kowalewski, S.: HyPro: a C++ library of state set representations for hybrid systems reachability analysis. In: Proceedings of the 9th International Symposium NASA Formal Methods (NFM 2017). LNCS, vol. 10227, pp. 288\u2013294. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-57288-8_20","DOI":"10.1007\/978-3-319-57288-8_20"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Svozil, D., Kvasnicka, V., Pospichal, J.: Introduction to multi-layer feed-forward neural networks. Chem. Intell. Lab. Syst. 39(1), 43\u201362 (1997). https:\/\/doi.org\/10.1016\/S0169-7439(97)00061-0","DOI":"10.1016\/S0169-7439(97)00061-0"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Tran, H.D., et al.: Star-based reachability analysis of deep neural networks. In: Formal Methods \u2013 The Next 30 Years, pp. 670\u2013686. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-30942-8-39","DOI":"10.1007\/978-3-030-30942-8-39"},{"issue":"4","key":"14_CR16","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s00165-021-00553-4","volume":"33","author":"HD Tran","year":"2021","unstructured":"Tran, H.D., et al.: Verification of piecewise deep neural networks: a star set approach with zonotope pre-filter. Formal Aspects Comput. 33(4), 519\u2013545 (2021). https:\/\/doi.org\/10.1007\/s00165-021-00553-4","journal-title":"Formal Aspects Comput."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09524-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:02Z","timestamp":1762290842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09524-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,5]]},"ISBN":["9783032095237","9783032095244"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09524-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,5]]},"assertion":[{"value":"5 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp25.software.imdea.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}