{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T02:09:42Z","timestamp":1771466982661,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031331695","type":"print"},{"value":"9783031331701","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-33170-1_1","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:55:27Z","timestamp":1685710527000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Verification of\u00a0LSTM Neural Networks with\u00a0Non-linear Activation Functions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1356-0042","authenticated-orcid":false,"given":"Farzaneh","family":"Moradkhani","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2912-2429","authenticated-orcid":false,"given":"Connor","family":"Fibich","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9138-8340","authenticated-orcid":false,"given":"Martin","family":"Fr\u00e4nzle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"1_CR1","unstructured":"Economic commission for Europe, inland transport committee, \u201cvienna convention on road traffic\u201d. http:\/\/www.unece.org\/fileadmin\/DAM\/trans\/conventn\/crt1968e.pdf"},{"key":"1_CR2","unstructured":"European space agency, \u201ccollision detection dataset\u201d. https:\/\/www.kelvins.esa.int"},{"key":"1_CR3","unstructured":"Federal highway administration research and technology, \u201cUS highway 101 dataset\u201d. https:\/\/www.fhwa.dot.gov\/publications\/research\/operations\/07030"},{"key":"1_CR4","unstructured":"space track. www.space-track.org"},{"key":"1_CR5","unstructured":"iSAT Quick Start Guide. AVACS H1\/2 iSAT Developer Team (2010)"},{"key":"1_CR6","unstructured":"Agency, E.S.: Space debris by the numbers. https:\/\/www.esa.int"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Akintunde, M.E., Kevorchian, A., Lomuscio, A., Pirovano, E.: Verification of RNN-based neural agent-environment systems. In: The Thirty-Third AAAI Conference on Artificial Intelligence, AAAI 2019, The Thirty-First Innovative Applications of Artificial Intelligence Conference, IAAI 2019, The Ninth AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019, Honolulu, Hawaii, USA, 27 January - 1 February 2019, pp. 6006\u20136013. AAAI Press (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.33016006","DOI":"10.1609\/aaai.v33i01.33016006"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193\u2013207. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49059-0_14"},{"key":"1_CR9","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"},{"issue":"3\u20134","key":"1_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.3233\/sat190012","volume":"1","author":"M Fr\u00e4nzle","year":"2007","unstructured":"Fr\u00e4nzle, M., Herde, C., Teige, T., Ratschan, S., Schubert, T.: Efficient solving of large non-linear arithmetic constraint systems with complex Boolean structure. J. Satisf. Boolean Model. Comput. 1(3\u20134), 209\u2013236 (2007). https:\/\/doi.org\/10.3233\/sat190012","journal-title":"J. Satisf. Boolean Model. Comput."},{"issue":"8","key":"1_CR11","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter, S., Schmidhuber, J.: Long short-term memory. Neural Comput. 9(8), 1735\u20131780 (1997). https:\/\/doi.org\/10.1162\/neco.1997.9.8.1735","journal-title":"Neural Comput."},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-030-59152-6_3","volume-title":"Automated Technology for Verification and Analysis","author":"Y Jacoby","year":"2020","unstructured":"Jacoby, Y., Barrett, C., Katz, G.: Verifying recurrent neural networks using invariant inference. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 57\u201374. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59152-6_3"},{"key":"1_CR13","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":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-030-85037-1_8","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"S Mohammadinejad","year":"2021","unstructured":"Mohammadinejad, S., Paulsen, B., Deshmukh, J.V., Wang, C.: DiffRNN: differential verification of recurrent neural networks. In: Dima, C., Shirmohammadi, M. (eds.) FORMATS 2021. LNCS, vol. 12860, pp. 117\u2013134. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85037-1_8"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10472-011-9243-0","volume":"62","author":"L Pulina","year":"2011","unstructured":"Pulina, L., Tacchella, A.: Never: a tool for artificial neural networks verification. Ann. Math. Artif. Intell. 62, 403\u2013425 (2011)","journal-title":"Ann. Math. Artif. Intell."},{"key":"1_CR16","unstructured":"Rizaldi, A., Immler, F.: A formally verified checker of the safe distance traffic rules for autonomous vehicles. Arch. Formal Proofs 2020 (2020). https:\/\/www.isa-afp.org\/entries\/Safe_Distance.html"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Scheibler, K.: isat3 manual. isat3 0.04-20170301 (2017)","DOI":"10.1145\/201703.3058795"},{"issue":"22","key":"1_CR18","doi-asserted-by":"publisher","first-page":"7543","DOI":"10.3390\/s21227543","volume":"21","author":"BI Sighencea","year":"2021","unstructured":"Sighencea, B.I., Stanciu, R.I., Caleanu, C.: A review of deep learning-based methods for pedestrian trajectory prediction. Sensors 21(22), 7543 (2021). https:\/\/doi.org\/10.3390\/s21227543","journal-title":"Sensors"},{"issue":"2","key":"1_CR19","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s42064-021-0101-5","volume":"6","author":"T Uriot","year":"2022","unstructured":"Uriot, T., et al.: Spacecraft collision avoidance challenge: design and results of a machine learning competition. Astrodynamics 6(2), 121\u2013140 (2022)","journal-title":"Astrodynamics"},{"issue":"7","key":"1_CR20","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1162\/neco\\_a_01199","volume":"31","author":"Y Yu","year":"2019","unstructured":"Yu, Y., Si, X., Hu, C., Zhang, J.: A review of recurrent neural networks: LSTM cells and network architectures. Neural Comput. 31(7), 1235\u20131270 (2019). https:\/\/doi.org\/10.1162\/neco_a_01199","journal-title":"Neural Comput."}],"container-title":["Lecture Notes in Computer Science","NASA Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33170-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T12:55:54Z","timestamp":1685710554000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33170-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031331695","9783031331701"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33170-1_1","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":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"NASA Formal Methods Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Houston, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"16 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/nfm-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":"75","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":"26","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":"3","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":"35% - 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.9","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":"6","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)"}}]}}