{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T08:05:36Z","timestamp":1761552336774,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032090072","type":"print"},{"value":"9783032090089","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:00:00Z","timestamp":1761609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:00:00Z","timestamp":1761609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Formal verification aims to prove whether models satisfy specifications, such as showing a program does what its designer intended. Formal verification is a promising approach that can be used to establish safety, security, and trustworthiness specifications of AI systems. However, to realize the potential societal benefits AI promise, we also need transdisciplinary approaches bridging the gamut from computer science and engineering, the broader sciences, as well as the arts, humanities, social sciences, law, business, and beyond to ensure its development involves all perspectives and voices.<\/jats:p>\n                  <jats:p>My personal AI mission: To develop formal verification methods to help establish and assure the safe, secure, and trustworthy development and use of AI, especially in the context of safety-critical systems such as autonomous cyber-physical systems (CPS).<\/jats:p>","DOI":"10.1007\/978-3-032-09008-9_15","type":"book-chapter","created":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T07:56:00Z","timestamp":1761551760000},"page":"130-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Let\u2019s Talk AI with Computer Science Expert Taylor T. Johnson"],"prefix":"10.1007","author":[{"given":"Taylor T.","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"Steffen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,28]]},"reference":[{"key":"15_CR1","unstructured":"Knowles, E.M. (ed.): The Oxford Dictionary of Phrase and Fable, 2nd ed. Oxford University Press (2005)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Stevenson, A., Lindberg, C.A. (eds.): New Oxford American Dictionary, 3rd ed. Oxford University Press (2010)","DOI":"10.1093\/acref\/9780195392883.001.0001"},{"key":"15_CR3","doi-asserted-by":"crossref","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). Int. J. Software Tools Technology Transfer 25(3), 329\u2013339 (2023)","DOI":"10.1007\/s10009-023-00703-4"},{"key":"15_CR4","unstructured":"Lopez, D.M., et al.: ARCH-COMP22 category report: artificial intelligence and neural network control systems (AINNCS) for continuous and hybrid systems plants. In: Frehse, G., Althoff, M., Schoitsch, E., Guiochet, J. (eds.) Proceedings of the 9th International Workshop on Applied Verification of Continuous and Hybrid Systems (ARCH 2022), EPiC Series in Computing, vol. 90, pp. 142\u2013184. EasyChair (2022)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Raji, I.D., Kumar, I.E., Horowitz, A., Selbst, A.: The fallacy of AI functionality. In: Proceedings of the 2022 ACM Conf. on Fairness, Accountability, and Transparency (FAccT 2022), pp. 959\u2013972. ACM (2022)","DOI":"10.1145\/3531146.3533158"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Xiang, W., Tran, H.-D., Johnson, T.T.: Output reachable set estimation and verification for multilayer neural networks. IEEE Trans. Neural Networks Learn. Syst. 29(11), 5777\u20135783 (2018)","DOI":"10.1109\/TNNLS.2018.2808470"},{"key":"15_CR7","doi-asserted-by":"publisher","unstructured":"Tran, H.-D., et al.: Star-based reachability analysis of deep neural networks. In: ter Beek, M.H., McIver, A., Oliveira, J.N. (eds.) Formal Methods: The Next 30 Years. LNCS, vol. 11800, pp. 670\u2013686. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30942-8_39","DOI":"10.1007\/978-3-030-30942-8_39"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Tran, H.-D., Cai, F., Diego, M.L., Musau, P., Johnson, T.T., Koutsoukos, X.: Safety verification of cyber-physical systems with reinforcement learning control. ACM Trans. Embed. Comput. Syst. 18(5) (2019)","DOI":"10.1145\/3358230"},{"key":"15_CR9","doi-asserted-by":"publisher","unstructured":"Tran, H.-D., Bak, S., Xiang, W., Johnson, T.T.: Verification of deep convolutional neural networks using ImageStars. In: Lahiri, S.K., Wang, C. (eds.) Computer Aided Verification (CAV 2020). LNCS, vol. 12224, pp. 18\u201342. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_2","DOI":"10.1007\/978-3-030-53288-8_2"},{"key":"15_CR10","doi-asserted-by":"publisher","unstructured":"Tran, H.-D., et al.: NNV: the neural network verification tool for deep neural networks and learning-enabled cyber-physical systems. In: Lahiri, S.K., Wang, C. (eds.) Computer Aided Verification (CAV 2020). LNCS, vol. 12224, pp. 3\u201317. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_1","DOI":"10.1007\/978-3-030-53288-8_1"},{"key":"15_CR11","doi-asserted-by":"publisher","unstructured":"Bak, S., Tran, H.-D., Hobbs, K., Johnson, T.T.: In: Improved geometric path enumeration for verifying ReLU neural networks. In: Lahiri, S.K., Wang, C. (eds.) Computer Aided Verification (CAV 2020). LNCS, vol. 12224, pp. 66\u201396. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_4","DOI":"10.1007\/978-3-030-53288-8_4"},{"key":"15_CR12","doi-asserted-by":"publisher","unstructured":"Tran, H.-D., et al.: Robustness verification of semantic segmentation neural networks using relaxed reachability. In: Silva, A., Leino, K.R.M. (eds.) Computer Aided Verification (CAV 2021). LNCS, vol. 12759, pp. 263\u2013286. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-81685-8_12","DOI":"10.1007\/978-3-030-81685-8_12"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Yang, X., Johnson, T.T., Tran, H.-D., Yamaguchi, T., Hoxha, B., Prokhorov, D.: Reachability analysis of deep ReLU neural networks using facet-vertex incidence. In: Proceedings of the 24th International Conference on Hybrid Systems: Computation and Control (HSCC 2021). ACM (2021)","DOI":"10.1145\/3447928.3456650"},{"key":"15_CR14","doi-asserted-by":"publisher","unstructured":"Yang, X., Yamaguchi, T., Tran, H.-D., Hoxha, B., Johnson, T.T., Prokhorov, D.: Neural network repair with reachability analysis. In: Bogomolov, S., Parker, D. (eds.) FORMATS 2022. LNCS, vol. 13465, pp. 221\u2013236. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15839-1_13","DOI":"10.1007\/978-3-031-15839-1_13"},{"key":"15_CR15","doi-asserted-by":"publisher","unstructured":"Lopez, D.M., Choi, S.W., Tran, H.-D., Johnson, T.T.: NNV 2.0: the neural network verification tool. In: Enea, C., Lal, A. (eds.) Computer Aided Verification (CAV 2023). LNCS, vol. 13965, pp. 397\u2013412. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37703-7_19","DOI":"10.1007\/978-3-031-37703-7_19"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Bender, E.M., Gebru, T., McMillan-Major, A., Shmitchell, S.: On the dangers of stochastic parrots: can language models be too big? In: Proc. 2021 ACM Conf. on Fairness, Accountability, and Transparency (FAccT 2021), pp. 610\u2013623. ACM (2021)","DOI":"10.1145\/3442188.3445922"},{"key":"15_CR17","unstructured":"Buolamwini, J., Gebru, T.: Gender shades: intersectional accuracy disparities in commercial gender classification. In: Proc. 1st Conf. on Fairness, Accountability and Transparency (FAT 2018) (2018). In: Friedler, S.A., Wilson, C. (eds.). Proc. of Machine Learning Research, vol. 81, pp. 77\u201379"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Mitchell, M., et al.: Model cards for model reporting. In: Proceedings of the Conference on Fairness, Accountability, and Transparency (FAT* 2019), pp. 220\u2013229. ACM (2019)","DOI":"10.1145\/3287560.3287596"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Raji, I.D., et al.: Closing the AI accountability gap: defining an end-to-end framework for internal algorithmic auditing. In: Proceedings of the 2020 Conference on Fairness, Accountability, and Transparency (FAT* 2020), pp. 33\u201344. ACM (2020)","DOI":"10.1145\/3351095.3372873"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Gebru, T.,  et al.: Datasheets for datasets. Commun. ACM 64(12), pp. 86\u201392. ACM (2021)","DOI":"10.1145\/3458723"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Costanza-Chock, S., Raji, I.D., Buolamwini, J.: Who audits the auditors? Recommendations from a field scan of the algorithmic auditing ecosystem. In: Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency (FAccT 2022), pp. 1571\u20131583. ACM (2022)","DOI":"10.1145\/3531146.3533213"}],"container-title":["Lecture Notes in Computer Science","Let\u2019s Talk AI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09008-9_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T07:56:07Z","timestamp":1761551767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09008-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,28]]},"ISBN":["9783032090072","9783032090089"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09008-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,28]]},"assertion":[{"value":"28 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}