{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T18:23:00Z","timestamp":1778869380978,"version":"3.51.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031661587","type":"print"},{"value":"9783031661594","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-66159-4_19","type":"book-chapter","created":{"date-parts":[[2024,7,26]],"date-time":"2024-07-26T09:01:34Z","timestamp":1721984494000},"page":"266-281","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Verifying and\u00a0Interpreting Neural Networks Using Finite Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8012-5465","authenticated-orcid":false,"given":"Marco","family":"S\u00e4lzer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2603-7827","authenticated-orcid":false,"given":"Eric","family":"Alsmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6800-7135","authenticated-orcid":false,"given":"Florian","family":"Bruse","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1621-0972","authenticated-orcid":false,"given":"Martin","family":"Lange","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,27]]},"reference":[{"key":"19_CR1","unstructured":"Ayache, S., Eyraud, R., Goudian, N.: Explaining black boxes on sequential data using weighted automata. In: Proceedings of the 14th International Conference on Grammatical Inference, ICGI\u201918. Proceedings of Machine Learning Research, vol. 93, pp. 81\u2013103. PMLR (2018). http:\/\/proceedings.mlr.press\/v93\/ayache19a.html"},{"key":"19_CR2","unstructured":"Barcel\u00f3, P., Monet, M., P\u00e9rez, J., Subercaseaux, B.: Model interpretability through the lens of computational complexity. In: Proceedings of the 33rd Annual Conference on Advances in Neural Information Processing Systems, NeurIPS 2020 (2020). https:\/\/proceedings.neurips.cc\/paper\/2020\/hash\/b1adda14824f50ef24ff1c05bb66faf3-Abstract.html"},{"key":"19_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J Berstel","year":"1979","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979)"},{"issue":"3","key":"19_CR4","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1145\/1071596.1071601","volume":"6","author":"B Boigelot","year":"2005","unstructured":"Boigelot, B., Jodogne, S., Wolper, P.: An effective decision procedure for linear arithmetic over the integers and reals. ACM Trans. Comput. Log. 6(3), 614\u2013633 (2005). https:\/\/doi.org\/10.1145\/1071596.1071601","journal-title":"ACM Trans. Comput. Log."},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BFb0055049","volume-title":"Automata, Languages and Programming","author":"B Boigelot","year":"1998","unstructured":"Boigelot, B., Rassart, S., Wolper, P.: On the expressiveness of real and integer arithmetic automata. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 152\u2013163. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055049"},{"issue":"5","key":"19_CR6","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1145\/876638.876643","volume":"50","author":"EM Clarke","year":"2003","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752\u2013794 (2003)","journal-title":"J. ACM"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of the 4th ACM Symposium on Principles of Programming Languages, POPL 1977, pp. 238\u2013252 (1977)","DOI":"10.1145\/512950.512973"},{"issue":"3","key":"19_CR8","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1002\/rob.21918","volume":"37","author":"SM Grigorescu","year":"2020","unstructured":"Grigorescu, S.M., Trasnea, B., Cocias, T.T., Macesanu, G.: A survey of deep learning techniques for autonomous driving. J. Field Robotics 37(3), 362\u2013386 (2020). https:\/\/doi.org\/10.1002\/rob.21918","journal-title":"J. Field Robotics"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"100270","DOI":"10.1016\/j.cosrev.2020.100270","volume":"37","author":"X Huang","year":"2020","unstructured":"Huang, X., et al.: A survey of safety and trustworthiness of deep neural networks: verification, testing, adversarial attack and defence, and interpretability. Comput. Sci. Rev. 37, 100270 (2020). https:\/\/doi.org\/10.1016\/j.cosrev.2020.100270","journal-title":"Comput. Sci. Rev."},{"issue":"6","key":"19_CR10","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1162\/0899766053630350","volume":"17","author":"H Jacobsson","year":"2005","unstructured":"Jacobsson, H.: Rule extraction from recurrent neural networks: a taxonomy and review. Neur. Comp. 17(6), 1223\u20131263 (2005). https:\/\/doi.org\/10.1162\/0899766053630350","journal-title":"Neur. Comp."},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-63387-9_5","volume-title":"Computer Aided Verification","author":"G Katz","year":"2017","unstructured":"Katz, G., Barrett, C., Dill, D.L., Julian, K., Kochenderfer, M.J.: Reluplex: an efficient SMT solver for verifying deep neural networks. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 97\u2013117. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_5"},{"key":"19_CR12","doi-asserted-by":"publisher","unstructured":"Khan, A., Sohail, A., Zahoora, U., Qureshi, A.S.: A survey of the recent architectures of deep convolutional neural networks. Artif. Intell. Rev. 53(8), 5455\u20135516 (2020). https:\/\/doi.org\/10.1007\/s10462-020-09825-6","DOI":"10.1007\/s10462-020-09825-6"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-030-88885-5_24","volume-title":"Automated Technology for Verification and Analysis","author":"I Khmelnitsky","year":"2021","unstructured":"Khmelnitsky, I., et al.: Property-directed verification and\u00a0robustness certification of\u00a0recurrent neural networks. In: Hou, Z., Ganesh, V. (eds.) ATVA 2021. LNCS, vol. 12971, pp. 364\u2013380. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88885-5_24"},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Litjens, G., et al.: A survey on deep learning in medical image analysis. Med. Image Anal. 42, 60\u201388 (2017). https:\/\/doi.org\/10.1016\/j.media.2017.07.005","DOI":"10.1016\/j.media.2017.07.005"},{"issue":"3","key":"19_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/S0020-0190(00)00183-6","volume":"79","author":"C L\u00f6ding","year":"2001","unstructured":"L\u00f6ding, C.: Efficient minimization of deterministic weak $$\\omega $$-automata. Inform. Proc. Lett. 79(3), 105\u2013109 (2001)","journal-title":"Inform. Proc. Lett."},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.3390\/make3010010","volume":"3","author":"F Mayr","year":"2021","unstructured":"Mayr, F., Yovine, S., Visca, R.: Property checking with interpretable error characterization for recurrent neural networks. Mach. Learn. Knowl. Extr. 3(1), 205\u2013227 (2021). https:\/\/doi.org\/10.3390\/make3010010","journal-title":"Mach. Learn. Knowl. Extr."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Miyano, S., Hayashi, T.: Alternating finite automata on omega-words. TCS 32(3), 321\u2013330 (1984)","DOI":"10.1016\/0304-3975(84)90049-5"},{"issue":"2","key":"19_CR18","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1109\/TNNLS.2020.2979670","volume":"32","author":"DW Otter","year":"2021","unstructured":"Otter, D.W., Medina, J.R., Kalita, J.K.: A survey of the usages of deep learning for natural language processing. IEEE Trans. Neural Netw. Learn. Syst. 32(2), 604\u2013624 (2021). https:\/\/doi.org\/10.1109\/TNNLS.2020.2979670","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Ramesh, A., Dhariwal, P., Nichol, A., Chu, C., Chen, M.: Hierarchical text-conditional image generation with CLIP latents. CoRR abs\/2204.06125 (2022). https:\/\/doi.org\/10.48550\/arXiv.2204.06125","DOI":"10.48550\/arXiv.2204.06125"},{"key":"19_CR20","unstructured":"Ramesh, A., et al.: Zero-shot text-to-image generation. In: Proceedings of the 38th International Conference on Machine Learning, ICML 2021. Proceedings of the of Machine Learning Research, vol. 139, pp. 8821\u20138831. PMLR (2021)"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-030-89716-1_10","volume-title":"Reachability Problems","author":"M S\u00e4lzer","year":"2021","unstructured":"S\u00e4lzer, M., Lange, M.: Reachability is NP-complete even for the simplest neural networks. In: Bell, P.C., Totzke, P., Potapov, I. (eds.) RP 2021. LNCS, vol. 13035, pp. 149\u2013164. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89716-1_10"},{"key":"19_CR22","unstructured":"Sundararajan, M., Taly, A., Yan, Q.: Axiomatic attribution for deep networks. In: Proceedings of the 34th International Conference on Machine Learning, ICML 2017. Proceedings of Machine Learning Research, vol. 70, pp. 3319\u20133328. PMLR (2017). http:\/\/proceedings.mlr.press\/v70\/sundararajan17a.html"},{"key":"19_CR23","doi-asserted-by":"publisher","unstructured":"S\u00e4lzer, M., Alsmann, E., Bruse, F., Lange, M.: Verifying and interpreting neural networks using finite automata. CoRR abs\/2211.01022 (2023). https:\/\/doi.org\/10.48550\/arXiv.2211.01022","DOI":"10.48550\/arXiv.2211.01022"},{"key":"19_CR24","unstructured":"Weiss, G., Goldberg, Y., Yahav, E.: Extracting automata from recurrent neural networks using queries and counterexamples. In: Proceedings of the 35th International Conference on Machine Learning, ICML 2018. Proceedings of Machine Learning Research, vol.\u00a080, pp. 5244\u20135253. PMLR (2018). http:\/\/proceedings.mlr.press\/v80\/weiss18a.html"},{"key":"19_CR25","doi-asserted-by":"publisher","first-page":"e436","DOI":"10.7717\/peerj-cs.436","volume":"7","author":"Z Xu","year":"2021","unstructured":"Xu, Z., Wen, C., Qin, S., He, M.: Extracting automata from neural networks using active learning. PeerJ Comput. Sci. 7, e436 (2021). https:\/\/doi.org\/10.7717\/peerj-cs.436","journal-title":"PeerJ Comput. Sci."},{"issue":"5","key":"19_CR26","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TETCI.2021.3100641","volume":"5","author":"Y Zhang","year":"2021","unstructured":"Zhang, Y., Ti\u00f1o, P., Leonardis, A., Tang, K.: A survey on neural network interpretability. IEEE Trans. Emerg. Top. Comput. Intell. 5(5), 726\u2013742 (2021). https:\/\/doi.org\/10.1109\/TETCI.2021.3100641","journal-title":"IEEE Trans. Emerg. Top. Comput. Intell."}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-66159-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T08:04:07Z","timestamp":1729325047000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-66159-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031661587","9783031661594"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-66159-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"27 July 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}