{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:14:15Z","timestamp":1742980455849,"version":"3.40.3"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031067723"},{"type":"electronic","value":"9783031067730"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06773-0_13","type":"book-chapter","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T11:24:44Z","timestamp":1652959484000},"page":"251-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Case Studies for\u00a0Computing Density of\u00a0Reachable States for\u00a0Safe Autonomous Motion Planning"],"prefix":"10.1007","author":[{"given":"Yue","family":"Meng","sequence":"first","affiliation":[]},{"given":"Zeng","family":"Qiu","sequence":"additional","affiliation":[]},{"given":"Md Tawhid Bin","family":"Waez","sequence":"additional","affiliation":[]},{"given":"Chuchu","family":"Fan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"key":"13_CR1","unstructured":"Abate, A.: Probabilistic Reachability for Stochastic Hybrid Systems: Theory, Computations, and Applications. University of California, Berkeley (2007)"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3158668","volume":"28","author":"G Agha","year":"2018","unstructured":"Agha, G., Palmskog, K.: A survey of statistical model checking. ACM Trans. Model. Comput. Simul. (TOMACS) 28(1), 1\u201339 (2018)","journal-title":"ACM Trans. Model. Comput. Simul. (TOMACS)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Allen, R.E., Clark, A.A., Starek, J.A., Pavone, M.: A machine learning approach for real-time reachability analysis. In: 2014 IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 2202\u20132208. IEEE (2014)","DOI":"10.1109\/IROS.2014.6942859"},{"issue":"4\u20135","key":"13_CR4","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0925-2312(93)90006-O","volume":"5","author":"S Amari","year":"1993","unstructured":"Amari, S.: Backpropagation and stochastic gradient descent method. Neurocomputing 5(4\u20135), 185\u2013196 (1993)","journal-title":"Neurocomputing"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Andersson, J.A.E., Gillis, J., Horn, G., Rawlings, J.B., Diehl, M.: Casadi: a software framework for nonlinear optimization and optimal control. Math. Program. Comput. 11(1), 1\u201336, 2019","DOI":"10.1007\/s12532-018-0139-4"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Bansal, S., Tomlin, C.: Deepreach: A deep learning approach to high-dimensional reachability. arXiv preprint arXiv:2011.02082 (2020)","DOI":"10.1109\/ICRA48506.2021.9561949"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Berndt, A., Alanwar, A., Johansson, K.H., Sandberg, H.: Data-driven set-based estimation using matrix zonotopes with set containment guarantees. arXiv preprint arXiv:2101.10784 (2021)","DOI":"10.23919\/ECC55457.2022.9838494"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Chen, J., Liu, C., Tomizuka, M.: Foad: fast optimization-based autonomous driving motion planner. In: 2018 Annual American Control Conference (ACC), pp. 4725\u20134732. IEEE (2018)","DOI":"10.23919\/ACC.2018.8431104"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1109\/JAS.2018.7511186","volume":"6","author":"L Chen","year":"2018","unstructured":"Chen, L., Xuemin, H., Tian, W., Wang, H., Cao, D., Wang, F.-Y.: Parallel planning: a new motion planning framework for autonomous driving. IEEE\/CAA J. Autom. Sin. 6(1), 236\u2013246 (2018)","journal-title":"IEEE\/CAA J. Autom. Sin."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Chen, M., Tomlin, C.J.: Hamilton-jacobi reachability: some recent theoretical advances and applications in unmanned airspace management. Ann. Rev. Control Robot. Autonom. Syst. 1, 333\u2013358 (2018)","DOI":"10.1146\/annurev-control-060117-104941"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Chen, Y., Ahmadi, M., Ames, A.D.: Optimal safe controller synthesis: a density function approach. In: 2020 American Control Conference (ACC), pp. 5407\u20135412. IEEE (2020)","DOI":"10.23919\/ACC45564.2020.9147721"},{"key":"13_CR12","unstructured":"International competition on verifying continuous and hybrid systems. https:\/\/cps-vo.org\/group\/ARCH\/FriendlyCompetition. Accessed 18 June 2021"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Devonport, A., Arcak, M.: Data-driven reachable set computation using adaptive gaussian process classification and Monte Carlo methods. In: 2020 American Control Conference (ACC), pp. 2629\u20132634. IEEE (2020)","DOI":"10.23919\/ACC45564.2020.9147918"},{"key":"13_CR14","unstructured":"Devonport, A., Arcak, M.: Estimating reachable sets with scenario optimization. In: Learning for Dynamics and Control, pp. 75\u201384. PMLR (2020)"},{"key":"13_CR15","doi-asserted-by":"publisher","unstructured":"Donner, C., Opper, M.: Efficient bayesian inference of sigmoidal gaussian cox processes. https:\/\/doi.org\/10.14279\/depositonce-8398 (2018)","DOI":"10.14279\/depositonce-8398"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Ehrendorfer, M.: The liouville equation and prediction of forecast skill. In: Predictability and Nonlinear Modelling in Natural Sciences and Economics, pp. 29\u201344. Springer (1994)","DOI":"10.1007\/978-94-011-0962-8_4"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Everett, M., Habibi, G., Jonathan, P.: How Efficient reachability analysis of closed-loop systems with neural network controllers. arXiv preprint arXiv:2101.01815 (2021)","DOI":"10.1109\/ICRA48506.2021.9561348"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/978-3-030-53288-8_31","volume-title":"Computer Aided Verification","author":"C Fan","year":"2020","unstructured":"Fan, C., Miller, K., Mitra, S.: Fast and guaranteed safe controller synthesis for nonlinear vehicle models. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. LNCS, vol. 12224, pp. 629\u2013652. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_31"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-030-59152-6_30","volume-title":"Automated Technology for Verification and Analysis","author":"J Fan","year":"2020","unstructured":"Fan, J., Huang, C., Chen, X., Li, W., Zhu, Q.: ReachNN*: a tool for reachability analysis of neural-network controlled systems. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 537\u2013542. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59152-6_30"},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Fridovich-Keil, D., et al.: Confidence-aware motion prediction for real-time collision avoidance1. Int. J. Robot. Res. 39(2\u20133), 250\u2013265 (2020)","DOI":"10.1177\/0278364919859436"},{"key":"13_CR21","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-642-36062-6_49","volume-title":"System Modeling and Optimization","author":"M Gerdts","year":"2013","unstructured":"Gerdts, M., Xausa, I.: Avoidance trajectories using reachable sets and parametric sensitivity analysis. In: H\u00f6mberg, D., Tr\u00f6ltzsch, F. (eds.) CSMO 2011. IAICT, vol. 391, pp. 491\u2013500. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36062-6_49"},{"issue":"1","key":"13_CR22","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10846-009-9383-1","volume":"57","author":"C Goerzen","year":"2010","unstructured":"Goerzen, C., Kong, Z., Mettler, B.: A survey of motion planning algorithms from the perspective of autonomous uav guidance. J. Intell. Robot. Syst. 57(1), 65\u2013100 (2010)","journal-title":"J. Intell. Robot. Syst."},{"issue":"4","key":"13_CR23","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1109\/TITS.2015.2498841","volume":"17","author":"D Gonz\u00e1lez","year":"2015","unstructured":"Gonz\u00e1lez, D., P\u00e9rez, J., Milan\u00e9s, V., Nashashibi, F.: A review of motion planning techniques for automated vehicles. IEEE Trans. Intell. Transp. Syst. 17(4), 1135\u20131145 (2015)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"13_CR24","unstructured":"Hainry, E.: Decidability and undecidability in dynamical systems. In: Research Report (2009)"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Hormann, K.: Barycentric interpolation. In: Approximation Theory XIV: San Antonio 2013, pp. 197\u2013218. Springer (2014)","DOI":"10.1007\/978-3-319-06404-8_11"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Hu, H., Fazlyab, M., Morari, M., Pappas, G.J.: Reach-sdp: Reachability analysis of closed-loop systems with neural network controllers via semidefinite programming. In: 2020 59th IEEE Conference on Decision and Control (CDC), pp. 5929\u20135934. IEEE (2020)","DOI":"10.1109\/CDC42340.2020.9304296"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Ivanov, R., Weimer, J., Alur, R., Pappas, G.J., Lee, I.: Verisig: verifying safety properties of hybrid systems with neural network controllers. In: Proceedings of the 22nd ACM International Conference on Hybrid Systems: Computation and Control, pp. 169\u2013178 (2019)","DOI":"10.1145\/3302504.3311806"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Julian, K.D., Kochenderfer, M.D.: Reachability analysis for neural network aircraft collision avoidance systems. J. Guidance Control Dyn. 44(6), 1132\u20131142 (2021)","DOI":"10.2514\/1.G005233"},{"issue":"7","key":"13_CR29","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1177\/0278364911406761","volume":"30","author":"S Karaman","year":"2011","unstructured":"Karaman, S., Frazzoli, E.: Sampling-based algorithms for optimal motion planning. Int. J. Robot. Res. 30(7), 846\u2013894 (2011)","journal-title":"Int. J. Robot. Res."},{"key":"13_CR30","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":"13_CR31","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_CR32","doi-asserted-by":"crossref","unstructured":"Kornfeld, R.P., Prakash, R., Devereaux, A.S., Greco, M.E., Harmon, C.C., Kipp, D.M.: Verification and validation of the mars science laboratory\/curiosity rover entry, descent, and landing system. J. Spacecraft Rockets 51(4), 1251\u20131269 (2014)","DOI":"10.2514\/1.A32680"},{"issue":"12","key":"13_CR33","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1177\/0278364920943266","volume":"39","author":"S Kousik","year":"2020","unstructured":"Kousik, S., Vaskov, S., Fan, B., Johnson-Roberson, M., Vasudevan, R.: Bridging the gap between safety and real-time performance in receding-horizon trajectory design for mobile robots. Int. J. Robot. Res. 39(12), 1419\u20131469 (2020)","journal-title":"Int. J. Robot. Res."},{"key":"13_CR34","doi-asserted-by":"crossref","unstructured":"Lee, D.T., Schachter, B.J.: Two algorithms for constructing a delaunay triangulation. Int. J. Comput. Inf. Sci. 9(3), 219\u2013242 (1980)","DOI":"10.1007\/BF00977785"},{"key":"13_CR35","unstructured":"Lew, T., Pavone, M.: Sampling-based reachability analysis: A random set theory approach with adversarial sampling. arXiv preprint arXiv:2008.10180 (2020)"},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Liebenwein, L., Baykal, C., Gilitschenski, I., Karaman, S., Rus, D.: Sampling-based approximation algorithms for reachability analysis with provable guarantees. RSS (2018)","DOI":"10.15607\/RSS.2018.XIV.014"},{"key":"13_CR37","unstructured":"Liu, C., Arnon, T., Lazarus, C., Strong, C., Barrett, C., Kochenderfer, M.J.: Algorithms for verifying deep neural networks. arXiv preprint arXiv:1903.06758 (2019)"},{"key":"13_CR38","series-title":"Springer Proceedings in Advanced Robotics","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-030-28619-4_10","volume-title":"Robotics Research","author":"A Majumdar","year":"2020","unstructured":"Majumdar, A., Pavone, M.: How should a robot assess risk? towards an axiomatic theory of risk in robotics. In: Amato, N.M., Hager, G., Thomas, S., Torres-Torriti, M. (eds.) Robotics Research. SPAR, vol. 10, pp. 75\u201384. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-28619-4_10"},{"key":"13_CR39","doi-asserted-by":"crossref","unstructured":"Majumdar, A., Vasudevan, R., Tobenkin, M.M., Tedrake, R.: Convex optimization of nonlinear feedback controllers via occupation measures. Int. J. Robot. Res. 33(9), 1209\u20131230 (2014)","DOI":"10.1177\/0278364914528059"},{"issue":"2","key":"13_CR40","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/TIV.2020.3017342","volume":"6","author":"S Manzinger","year":"2020","unstructured":"Manzinger, S., Pek, C., Althoff, M.: Using reachable sets for trajectory planning of automated vehicles. IEEE Trans. Intell. Veh. 6(2), 232\u2013248 (2020)","journal-title":"IEEE Trans. Intell. Veh."},{"key":"13_CR41","doi-asserted-by":"crossref","unstructured":"McNaughton, M., Urmson, C., Dolan, J.M., Lee, J.W.: Motion planning for autonomous driving with a conformal spatiotemporal lattice. In: 2011 IEEE International Conference on Robotics and Automation, pp. 4889\u20134895. IEEE (2011)","DOI":"10.1109\/ICRA.2011.5980223"},{"key":"13_CR42","unstructured":"Meng, Y., Sun, D., Qiu, Z., Waez, M.T.B., Fan, C.: Learning density distribution of reachable states for autonomous systems. arXiv preprint arXiv:2109.06728 (2021)"},{"key":"13_CR43","doi-asserted-by":"crossref","unstructured":"Mitchell, I.M., Bayen, A.M., Tomlin, C.J.: A time-dependent hamilton-jacobi formulation of reachable sets for continuous dynamic games. IEEE Trans. Autom. Control 50(7), 947\u2013957 (2005)","DOI":"10.1109\/TAC.2005.851439"},{"key":"13_CR44","doi-asserted-by":"crossref","unstructured":"Paden, B \u010c\u00e1p, M., Yong, S.Z., Yershov, D., Frazzoli, E.: A survey of motion planning and control techniques for self-driving urban vehicles. IEEE Trans. Intell. Veh. 1(1), 33\u201355 (2016)","DOI":"10.1109\/TIV.2016.2578706"},{"key":"13_CR45","first-page":"8026","volume":"32","author":"A Paszke","year":"2019","unstructured":"Paszke, A., et al.: Pytorch: an imperative style, high-performance deep learning library. Adv. Neural Inf. Process. Syst. 32, 8026\u20138037 (2019)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"13_CR46","doi-asserted-by":"crossref","unstructured":"Pivtoraiko, M., Knepper, R.A., Kelly, A.: Differentially constrained mobile robot motion planning in state lattices. J. Field Robot. 26(3), 308\u2013333 (2009)","DOI":"10.1002\/rob.20285"},{"key":"13_CR47","doi-asserted-by":"crossref","unstructured":"Qian, X., Altch\u00e9, F., Bender, P., Stiller, C., de La Fortelle, A.: Optimal trajectory planning for autonomous driving integrating logical constraints: an miqp perspective. In: 2016 IEEE 19th International Conference on Intelligent Transportation Systems (ITSC), pp. 205\u2013210. IEEE (2016)","DOI":"10.1109\/ITSC.2016.7795555"},{"key":"13_CR48","doi-asserted-by":"crossref","unstructured":"Rasmussen, M., Rieger, J., Webster, K.N.: Approximation of reachable sets using optimal control and support vector machines. J. Comput. Appl. Math. 311, 68\u201383 (2017)","DOI":"10.1016\/j.cam.2016.06.015"},{"key":"13_CR49","doi-asserted-by":"crossref","unstructured":"Robbins, H., Siegmund, D.: A convergence theorem for non negative almost supermartingales and some applications. In: Optimizing Methods in Statistics, pp. 233\u2013257. Elsevier (1971)","DOI":"10.1016\/B978-0-12-604550-5.50015-8"},{"key":"13_CR50","doi-asserted-by":"crossref","unstructured":"Shkolnik, A., Walter, M., Tedrake, R.: Reachability-guided sampling for planning under differential constraints. In 2009 IEEE International Conference on Robotics and Automation, pp. 2859\u20132865. IEEE (2009)","DOI":"10.1109\/ROBOT.2009.5152874"},{"key":"13_CR51","doi-asserted-by":"crossref","unstructured":"Thorpe, A.J., Ortiz, K.R., Oishi, M.M.K.: Data-driven stochastic reachability using hilbert space embeddings. arXiv preprint arXiv:2010.08036 (2020)","DOI":"10.1109\/CDC45484.2021.9683169"},{"key":"13_CR52","unstructured":"Toth, C.D., O\u2019Rourke, J., Goodman, J.E.: Handbook of Discrete and Computational Geometry. CRC Press (2017)"},{"key":"13_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-53288-8_1","volume-title":"Computer Aided Verification","author":"HD Tran","year":"2020","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.) CAV 2020. LNCS, vol. 12224, pp. 3\u201317. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53288-8_1"},{"key":"13_CR54","doi-asserted-by":"crossref","unstructured":"Vincent, J.A., Schwager, M.: Reachable polyhedral marching (rpm): A safety verification algorithm for robotic systems with deep neural network components. arXiv preprint arXiv:2011.11609 (2020)","DOI":"10.1109\/ICRA48506.2021.9561956"},{"key":"13_CR55","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 Netw. Learn. Syst. 29(11), 5777\u20135783 (2018)","DOI":"10.1109\/TNNLS.2018.2808470"},{"issue":"11","key":"13_CR56","doi-asserted-by":"publisher","first-page":"3944","DOI":"10.1109\/TCAD.2020.3012251","volume":"39","author":"B Xue","year":"2020","unstructured":"Xue, B., Zhang, M., Easwaran, A., Li, Q.: PAC model checking of black-box continuous-time dynamical systems. IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst. 39(11), 3944\u20133955 (2020)","journal-title":"IEEE Trans. Comput.-Aid. Des. Integr. Circ. Syst."},{"key":"13_CR57","unstructured":"Yang, X., Tran, H.-D., Xiang, W., Johnson, T.: Reachability analysis for feed-forward neural networks using face lattices. arXiv preprint arXiv:2003.01226 (2020)"},{"key":"13_CR58","doi-asserted-by":"crossref","unstructured":"Zeng, W.: End-to-end interpretable neural motion planner. In: Proceedings of the IEEE\/CVF Conference on Computer Vision and Pattern Recognition, pp. 8660\u20138669 (2019)","DOI":"10.1109\/CVPR.2019.00886"}],"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-06773-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,5]],"date-time":"2023-02-05T16:34:20Z","timestamp":1675614860000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06773-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031067723","9783031067730"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06773-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"20 May 2022","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":"Pasadena, CA","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nfm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/shemesh.larc.nasa.gov\/nfm2022\/","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":"118","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":"33","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":"6","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":"6.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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}