{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T23:08:04Z","timestamp":1768345684325,"version":"3.49.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031457838","type":"print"},{"value":"9783031457845","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-45784-5_13","type":"book-chapter","created":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T17:01:40Z","timestamp":1697389300000},"page":"198-209","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Towards a\u00a0Certified Proof Checker for\u00a0Deep Neural Network Verification"],"prefix":"10.1007","author":[{"given":"Remi","family":"Desmartin","sequence":"first","affiliation":[]},{"given":"Omri","family":"Isac","sequence":"additional","affiliation":[]},{"given":"Grant","family":"Passmore","sequence":"additional","affiliation":[]},{"given":"Kathrin","family":"Stark","sequence":"additional","affiliation":[]},{"given":"Ekaterina","family":"Komendantskaya","sequence":"additional","affiliation":[]},{"given":"Guy","family":"Katz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,16]]},"reference":[{"key":"13_CR1","unstructured":"The Coq Proof Assistant (1984). https:\/\/coq.inria.fr"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Bak, S.: Nnenum: verification of ReLU neural networks with optimized abstraction refinement. In: Proceedings of 13th International Symposium NASA Formal Methods (NFM), pp. 19\u201336 (2021)","DOI":"10.1007\/978-3-030-76384-8_2"},{"key":"13_CR3","unstructured":"Barrett, C., Katz, G., Guidotti, D., Pulina, L., Narodytska, N., Tacchella, A.: The Verification of Neural Networks Library (VNN-LIB) (2019). https:\/\/www.vnnlib.org\/"},{"key":"13_CR4","unstructured":"Barrett, C., de Moura, L., Fontaine, P.: Proofs in satisfiability modulo theories. In: All About Proofs, Proofs for All, vol. 55, no. 1, pp. 23\u201344 (2015)"},{"key":"13_CR5","unstructured":"Bastani, O., Ioannou, Y., Lampropoulos, L., Vytiniotis, D., Nori, A., Criminisi, A.: Measuring neural net robustness with constraints. In: Proceedings of 30th Conference on Neural Information Processing Systems (NeurIPS) (2016)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Bray, T.: The JavaScript Object Notation (JSON) Data Interchange Format (2014). https:\/\/www.rfc-editor.org\/info\/rfc7159","DOI":"10.17487\/rfc7159"},{"key":"13_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796820000283","volume":"31","author":"J Breitner","year":"2021","unstructured":"Breitner, J., et al.: Ready, set, verify! applying Hs-to-Coq to real-world Haskell code. J. Funct. Program. 31, e5 (2021)","journal-title":"J. Funct. Program."},{"key":"13_CR8","unstructured":"Brix, C., M\u00fcller, M.N., Bak, S., Johnson, T.T., Liu, C.: First Three Years of the International Verification of Neural Networks Competition (VNN-COMP). Technical report (2023). http:\/\/arxiv.org\/abs\/2301.05815"},{"key":"13_CR9","unstructured":"Brix, C., Noll, T.: Debona: Decoupled Boundary Network Analysis for Tighter Bounds and Faster Adversarial Robustness Proofs. Technical report (2020). http:\/\/arxiv.org\/abs\/2006.09040"},{"key":"13_CR10","unstructured":"Daggitt, M.L., Kokke, W., Atkey, R., Arnaboldi, L., Komendantskaya, E.: Vehicle: Interfacing Neural Network Verifiers with Interactive Theorem Provers. Technical report (2022). http:\/\/arxiv.org\/abs\/2202.05207"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Dantzig, G.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)","DOI":"10.7249\/R366"},{"key":"13_CR12","unstructured":"Desmartin, R., Isac, O., Passmore, G., Stark, K., Katz, G., Komendantskaya, E.: Towards a Certified Proof Checker for Deep Neural Network Verification. Technical report (2023). http:\/\/arxiv.org\/abs\/2307.06299"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Desmartin, R., Passmore, G.O., Komendantskaya, E.: Neural networks in imandra: matrix representation as a verification choice. In: Proceedings of 5th International Workshop of Software Verification and Formal Methods for ML-Enabled Autonomous Systems (FoMLAS) and 15th International Workshop on Numerical Software Verification (NSV), pp. 78\u201395 (2022)","DOI":"10.1007\/978-3-031-21222-2_6"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/11817963_11","volume-title":"Computer Aided Verification","author":"B Dutertre","year":"2006","unstructured":"Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81\u201394. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817963_11"},{"key":"13_CR15","unstructured":"Ferrari, C., Mueller, M.N., Jovanovi\u0107, N., Vechev, M.: Complete verification via multi-neuron relaxation guided branch-and-bound. In: Proceedings of 10th International Conference on Learning Representations (ICLR) (2022)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Henriksen, P., Lomuscio, A.: DEEPSPLIT: an efficient splitting method for neural network verification via indirect effect analysis. In: Proceedings of 30th International Joint Conference on Artificial Intelligence (IJCAI), pp. 2549\u20132555 (2021)","DOI":"10.24963\/ijcai.2021\/351"},{"key":"13_CR17","unstructured":"Isac, O., Barrett, C., Zhang, M., Katz, G.: Neural network verification with proof production. In: Proceedings 22nd International Conference on Formal Methods in Computer-Aided Design (FMCAD), pp. 38\u201348 (2022)"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-88806-0_9","volume-title":"Static Analysis","author":"K Jia","year":"2021","unstructured":"Jia, K., Rinard, M.: Exploiting verified neural networks via floating point numerical error. In: Dr\u0103goi, C., Mukherjee, S., Namjoshi, K. (eds.) SAS 2021. LNCS, vol. 12913, pp. 191\u2013205. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88806-0_9"},{"issue":"3","key":"13_CR19","doi-asserted-by":"publisher","first-page":"598","DOI":"10.2514\/1.G003724","volume":"42","author":"K Julian","year":"2019","unstructured":"Julian, K., Kochenderfer, M., Owen, M.: Deep neural network compression for aircraft collision avoidance systems. J. Guid. Control. Dyn. 42(3), 598\u2013608 (2019)","journal-title":"J. Guid. Control. Dyn."},{"issue":"1","key":"13_CR20","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10703-021-00363-7","volume":"60","author":"G Katz","year":"2021","unstructured":"Katz, G., Barrett, C., Dill, D., Julian, K., Kochenderfer, M.: Reluplex: a calculus for reasoning about deep neural networks. Form. Methods Syst. Des. (FMSD) 60(1), 87\u2013116 (2021)","journal-title":"Form. Methods Syst. Des. (FMSD)"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-030-25540-4_26","volume-title":"Computer Aided Verification","author":"G Katz","year":"2019","unstructured":"Katz, G., et al.: The marabou framework for verification and analysis of deep neural networks. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 443\u2013452. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_26"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Kaufmann, M., Moore, J.S.: ACL2: an industrial strength version of Nqthm. In: Proceedings of 11th Conference on Computer Assurance (COMPASS), pp. 23\u201334 (1996)","DOI":"10.1109\/CMPASS.1996.507872"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-030-81685-8_13","volume-title":"Computer Aided Verification","author":"H Khedr","year":"2021","unstructured":"Khedr, H., Ferlez, J., Shoukry, Y.: PEREGRiNN: penalized-relaxation greedy neural network verifier. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021. LNCS, vol. 12759, pp. 287\u2013300. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_13"},{"key":"13_CR24","unstructured":"Min\u00e9, A., Leroy, X., Cuoq, P., Troestler, C.: The Zarith Library (2023). https:\/\/github.com\/ocaml\/Zarith"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-38574-2_12","volume-title":"Automated Deduction \u2013 CADE-24","author":"L de Moura","year":"2013","unstructured":"de Moura, L., Passmore, G.O.: Computation in real closed infinitesimal and transcendental extensions of the rationals. In: Bonacina, M.P. (ed.) CADE 2013. LNCS (LNAI), vol. 7898, pp. 178\u2013192. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38574-2_12"},{"key":"13_CR26","unstructured":"Necula, G.: Compiling with Proofs. Carnegie Mellon University (1998)"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Norell, U.: Dependently typed programming in Agda. In: Proceedings of 4th International Workshop on Types in Language Design and Implementation (TLDI), pp. 1\u20132 (2009)","DOI":"10.1145\/1481861.1481862"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-030-51054-1_30","volume-title":"Automated Reasoning","author":"G Passmore","year":"2020","unstructured":"Passmore, G., et al.: The imandra automated reasoning system (system description). In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12167, pp. 464\u2013471. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51054-1_30"},{"key":"13_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/978-3-030-90870-6_39","volume-title":"Formal Methods","author":"GO Passmore","year":"2021","unstructured":"Passmore, G.O.: Some lessons learned in the industrialization of formal methods for financial algorithms. In: Huisman, M., P\u0103s\u0103reanu, C., Zhan, N. (eds.) FM 2021. LNCS, vol. 13047, pp. 717\u2013721. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90870-6_39"},{"key":"13_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0030541","volume-title":"Isabelle: A Generic Theorem Prover","author":"LC Paulson","year":"1994","unstructured":"Paulson, L.C.: Isabelle: A Generic Theorem Prover. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0030541"},{"key":"13_CR31","unstructured":"Prabhakar, P., Afzal, Z.R.: Abstraction based output range analysis for neural networks. In: Proceedings of 32nd International Conference on Neural Information Processing Systems (NeurIPS), pp. 15762\u201315772 (2019)"},{"key":"13_CR32","unstructured":"Smith, J., Allen, J., Swaminathan, V., Zhang, Z.: Refutation-Based Adversarial Robustness Verification of Deep Neural Networks (2021)"},{"issue":"3","key":"13_CR33","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s12194-017-0406-5","volume":"10","author":"K Suzuki","year":"2017","unstructured":"Suzuki, K.: Overview of deep learning in medical imaging. Radiol. Phys. Technol. 10(3), 257\u2013273 (2017)","journal-title":"Radiol. Phys. Technol."},{"key":"13_CR34","unstructured":"Szegedy, C., et al.: Intriguing Properties of Neural Networks. Technical report (2013). http:\/\/arxiv.org\/abs\/1312.6199"},{"key":"13_CR35","unstructured":"Vanderbei, R.: Linear programming: foundations and extensions. J. Oper. Res. Soc. (1996)"},{"key":"13_CR36","first-page":"29909","volume":"34","author":"S Wang","year":"2021","unstructured":"Wang, S., et al.: Beta-CROWN: efficient bound propagation with per-neuron split constraints for neural network robustness verification. Adv. Neural. Inf. Process. Syst. 34, 29909\u201329921 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45784-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T21:40:59Z","timestamp":1730324459000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45784-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031457838","9783031457845"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45784-5_13","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":"16 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cascais","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"23 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lopstr.github.io\/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":"29","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":"8","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":"4","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":"28% - 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","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":"3","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)"}}]}}