{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T01:02:13Z","timestamp":1779152533627,"version":"3.51.4"},"publisher-location":"Cham","reference-count":50,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031067723","type":"print"},{"value":"9783031067730","type":"electronic"}],"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_23","type":"book-chapter","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T11:24:44Z","timestamp":1652959484000},"page":"431-450","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["More Programming Than Programming: Teaching Formal Methods in\u00a0a\u00a0Software Engineering Programme"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9036-5692","authenticated-orcid":false,"given":"James","family":"Noble","sequence":"first","affiliation":[]},{"given":"David","family":"Streader","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4881-0999","authenticated-orcid":false,"given":"Isaac Oscar","family":"Gariano","sequence":"additional","affiliation":[]},{"given":"Miniruwani","family":"Samarakoon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-91550-6_1","volume-title":"Formal Methods Teaching","author":"L Aceto","year":"2021","unstructured":"Aceto, L., Ing\u00f3lfsd\u00f3ttir, A.: Introducing formal methods to\u00a0first-year students in three intensive\u00a0weeks. In: Ferreira, J.F., Mendes, A., Menghi, C. (eds.) FMTea 2021. LNCS, vol. 13122, pp. 1\u201317. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91550-6_1"},{"key":"23_CR2","unstructured":"Angelo, T.: A teacher\u2019s dozen-fourteen general research-based principles for improving higher learning. AAHE Bulletin (1993)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-06200-6_27","volume-title":"NASA Formal Methods","author":"S Arlt","year":"2014","unstructured":"Arlt, S., Rubio-Gonz\u00e1lez, C., R\u00fcmmer, P., Sch\u00e4f, M., Shankar, N.: The gradual verifier. In: Badger, J.M., Rozier, K.Y. (eds.) NFM 2014. LNCS, vol. 8430, pp. 313\u2013327. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06200-6_27"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Astrauskas, V., M\u00fcller, P., Poli, F., Summers, A.J.: Leveraging rust types for modular specification and verification. Proc. ACM Program. Lang. 3(OOPSLA), 1\u201330 (2019)","DOI":"10.1145\/3360573"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-319-73721-8_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"J Bader","year":"2018","unstructured":"Bader, J., Aldrich, J., Tanter, \u00c9.: Gradual program verification. In: VMCAI 2018. LNCS, vol. 10747, pp. 25\u201346. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-73721-8_2"},{"key":"23_CR6","unstructured":"Beckert, B., Grebing, S.: Evaluating the usability of interactive verification systems. In: COMPARE, pp. 3\u201317. Citeseer (2012)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-030-32441-4_4","volume-title":"Formal Methods Teaching","author":"S Blazy","year":"2019","unstructured":"Blazy, S.: Teaching deductive verification in Why3 to undergraduate students. In: Dongol, B., Petre, L., Smith, G. (eds.) FMTea 2019. LNCS, vol. 11758, pp. 52\u201366. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32441-4_4"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Bornholt, J., et al.: Using lightweight formal methods to validate a key-value storage node in amazon S3. In: Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles, pp. 836\u2013850 (2021)","DOI":"10.1145\/3477132.3483540"},{"key":"23_CR9","unstructured":"Brooks, F., Kugler, H.: No silver bullet, April 1987"},{"key":"23_CR10","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-71374-4","volume-title":"Formal Methods \u2013 Fun for Everybody","year":"2021","unstructured":"Cerone, A., Roggenbach, M. (eds.): FMFun 2019. CCIS, vol. 1301. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-71374-4"},{"key":"23_CR11","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9153.001.0001","volume-title":"Certified Programming with Dependent Types: A Pragmatic Introduction to the CoQ Proof Assistant","author":"A Chlipala","year":"2013","unstructured":"Chlipala, A.: Certified Programming with Dependent Types: A Pragmatic Introduction to the CoQ Proof Assistant. MIT Press, Cambridge (2013)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-662-49674-9_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Christakis","year":"2016","unstructured":"Christakis, M., Leino, K.R.M., M\u00fcller, P., W\u00fcstholz, V.: Integrated environment for diagnosing verification errors. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 424\u2013441. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_25"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-319-96145-3_3","volume-title":"Computer Aided Verification","author":"B Cook","year":"2018","unstructured":"Cook, B.: Formal reasoning about the security of amazon web services. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 38\u201347. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_3"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Dietl, W., Dietzel, S., Ernst, M.D., Mu\u015flu, K., Schiller, T.W.: Building and using pluggable type-checkers. In: Proceedings of the 33rd International Conference on Software Engineering, pp. 681\u2013690 (2011)","DOI":"10.1145\/1985793.1985889"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-32441-4","volume-title":"Formal Methods Teaching","year":"2019","unstructured":"Dongol, B., Petre, L., Smith, G. (eds.): FMTea 2019. LNCS, vol. 11758. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32441-4"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-030-91550-6_7","volume-title":"Formal Methods Teaching","author":"R Ettinger","year":"2021","unstructured":"Ettinger, R.: Lessons of formal program design in Dafny. In: Ferreira, J.F., Mendes, A., Menghi, C. (eds.) FMTea 2021. LNCS, vol. 13122, pp. 84\u2013100. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91550-6_7"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-91550-6","volume-title":"Formal Methods Teaching","year":"2021","unstructured":"Ferreira, J.F., Mendes, A., Menghi, C. (eds.): FMTea 2021. LNCS, vol. 13122. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91550-6"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Figueroa, I., Garc\u00eda, B., Leger, P.: Towards progressive program verification in Dafny. In: Proceedings of the XXII Brazilian Symposium on Programming Languages, pp. 90\u201397 (2018)","DOI":"10.1145\/3264637.3264649"},{"issue":"2","key":"23_CR19","first-page":"4","volume":"5","author":"F Flannery-Dailey","year":"2001","unstructured":"Flannery-Dailey, F., Wagner, R.L.: Wake up! Gnosticism and Buddhism in the Matrix. J. Religion Film 5(2), 4 (2001)","journal-title":"J. Religion Film"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-58298-2_1","volume-title":"Formal Methods for Industrial Critical Systems","author":"H Garavel","year":"2020","unstructured":"Garavel, H., Beek, M.H., Pol, J.: The 2020 expert survey on formal methods. In: ter Beek, M.H., Ni\u010dkovi\u0107, D. (eds.) FMICS 2020. LNCS, vol. 12327, pp. 3\u201369. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58298-2_1"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-030-64354-6_11","volume-title":"Deductive Software Verification: Future Perspectives","author":"S Grebing","year":"2020","unstructured":"Grebing, S., Ulbrich, M.: Usability recommendations for user guidance in deductive program verification. In: Ahrendt, W., Beckert, B., Bubel, R., H\u00e4hnle, R., Ulbrich, M. (eds.) Deductive Software Verification: Future Perspectives. LNCS, vol. 12345, pp. 261\u2013284. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64354-6_11"},{"issue":"2","key":"23_CR22","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1006\/jvlc.1996.0009","volume":"7","author":"TRG Green","year":"1996","unstructured":"Green, T.R.G., Petre, M.: Usability analysis of visual programming environments: a \u2018cognitive dimensions\u2019 framework. J. Vis. Lang. Comput. 7(2), 131\u2013174 (1996)","journal-title":"J. Vis. Lang. Comput."},{"key":"23_CR23","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/13937.001.0001","volume-title":"The Internet of Things","author":"S Greengard","year":"2021","unstructured":"Greengard, S.: The Internet of Things. MIT Press, Cambridge (2021)"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-030-91550-6_2","volume-title":"Formal Methods Teaching","author":"M G\u00fcdemann","year":"2021","unstructured":"G\u00fcdemann, M.: Online teaching of verification of C programs in applied computer science. In: Ferreira, J.F., Mendes, A., Menghi, C. (eds.) FMTea 2021. LNCS, vol. 13122, pp. 18\u201334. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91550-6_2"},{"issue":"7","key":"23_CR25","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/3068608","volume":"60","author":"C Hawblitzel","year":"2017","unstructured":"Hawblitzel, C., et al.: IronFleet: proving safety and liveness of practical distributed systems. Commun. ACM 60(7), 83\u201392 (2017)","journal-title":"Commun. ACM"},{"key":"23_CR26","volume-title":"The SPIN Model Checker: Primer and Reference Manual","author":"GJ Holzmann","year":"2003","unstructured":"Holzmann, G.J.: The SPIN Model Checker: Primer and Reference Manual. Addison-Wesley, Boston (2003)"},{"key":"23_CR27","volume-title":"Software Abstractions: Logic, Language, and Analysis","author":"D Jackson","year":"2006","unstructured":"Jackson, D.: Software Abstractions: Logic, Language, and Analysis. MIT Press, Cambridge (2006)"},{"key":"23_CR28","doi-asserted-by":"publisher","DOI":"10.1145\/3477355","volume-title":"Theories of Programming: The Life and Works of Tony Hoare","author":"CB Jones","year":"2021","unstructured":"Jones, C.B., Misra, J.: Theories of Programming: The Life and Works of Tony Hoare. Morgan & Claypool, Williston (2021)"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Jung, R., Jourdan, J.H., Krebbers, R., Dreyer, D.: RustBelt: securing the foundations of the rust programming language. Proc. ACM Program. Lang. 2(POPL), 1\u201334 (2017)","DOI":"10.1145\/3158154"},{"key":"23_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-030-91550-6_4","volume-title":"Formal Methods Teaching","author":"E Kamburjan","year":"2021","unstructured":"Kamburjan, E., Gr\u00e4tz, L.: Increasing engagement with interactive visualization: formal methods as serious games. In: Ferreira, J.F., Mendes, A., Menghi, C. (eds.) FMTea 2021. LNCS, vol. 13122, pp. 43\u201359. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91550-6_4"},{"key":"23_CR31","volume-title":"The Rust Programming Language (Covers Rust 2018)","author":"S Klabnik","year":"2019","unstructured":"Klabnik, S., Nichols, C.: The Rust Programming Language (Covers Rust 2018). No Starch Press, San Francisco (2019)"},{"key":"23_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-030-91550-6_5","volume-title":"Formal Methods Teaching","author":"P K\u00f6rner","year":"2021","unstructured":"K\u00f6rner, P., Krings, S.: Increasing student self-reliance and engagement in model-checking courses. In: Ferreira, J.F., Mendes, A., Menghi, C. (eds.) FMTea 2021. LNCS, vol. 13122, pp. 60\u201374. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91550-6_5"},{"key":"23_CR33","volume-title":"Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers","author":"L Lamport","year":"2002","unstructured":"Lamport, L.: Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Pearson, London (2002)"},{"key":"23_CR34","unstructured":"Leino, K.R.M.: Dafny 3.0.0 release. https:\/\/github.com\/dafny-lang\/dafny\/-releases\/tag\/v3.0.0"},{"key":"23_CR35","doi-asserted-by":"crossref","unstructured":"Leino, K.R.M.: Developing verified programs with Dafny. In: 2013 35th International Conference on Software Engineering (ICSE), pp. 1488\u20131490. IEEE (2013)","DOI":"10.1109\/ICSE.2013.6606754"},{"key":"23_CR36","unstructured":"Leino, K.R.M.: Program Proofs. Available from Lulu.com (2020)"},{"key":"23_CR37","unstructured":"Leino, K.R.M., Moskal, M.: Usable auto-active verification. In: Usable Verification Workshop (UV10) (2010)"},{"key":"23_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/BFb0026441","volume-title":"Compiler Construction","author":"K Rustan","year":"1998","unstructured":"Rustan, K., Leino, M., Nelson, G.: An extended static checker for modula-3. In: Koskimies, K. (ed.) CC 1998. LNCS, vol. 1383, pp. 302\u2013305. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0026441"},{"issue":"2","key":"23_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1667048.1667049","volume":"32","author":"S Markstrum","year":"2010","unstructured":"Markstrum, S., Marino, D., Esquivel, M., Millstein, T., Andreae, C., Noble, J.: JavaCOP: declarative pluggable types for java. ACM Trans. Program. Lang. Syst. (TOPLAS) 32(2), 1\u201337 (2010)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"23_CR40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92145-5","volume-title":"Touch of Class","author":"B Meyer","year":"2009","unstructured":"Meyer, B.: Touch of Class. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-92145-5"},{"key":"23_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-21437-0_8","volume-title":"FM 2011: Formal Methods","author":"P M\u00fcller","year":"2011","unstructured":"M\u00fcller, P., Ruskiewicz, J.N.: Using debuggers to understand failed verification attempts. In: Butler, M., Schulte, W. (eds.) FM 2011. LNCS, vol. 6664, pp. 73\u201387. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21437-0_8"},{"key":"23_CR42","unstructured":"Noble, J., Pearce, D.J., Groves, L.: Introducing Alloy in a software modelling course. In: 1st Workshop on Formal Methods in Computer Science Education (FORMED) (2008)"},{"key":"23_CR43","doi-asserted-by":"crossref","unstructured":"Pang, A., Anslow, C., Noble, J.: What programming languages do developers use? A theory of static vs dynamic language choice. In: 2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL\/HCC), pp. 239\u2013247. IEEE (2018)","DOI":"10.1109\/VLHCC.2018.8506534"},{"key":"23_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-35746-6_3","volume-title":"Tools for Practical Software Verification","author":"C Paulin-Mohring","year":"2012","unstructured":"Paulin-Mohring, C.: Introduction to the Coq proof-assistant for practical software verification. In: Meyer, B., Nordio, M. (eds.) LASER 2011. LNCS, vol. 7682, pp. 45\u201395. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35746-6_3"},{"key":"23_CR45","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.scico.2015.09.006","volume":"113","author":"DJ Pearce","year":"2015","unstructured":"Pearce, D.J., Groves, L.: Designing a verifying compiler: lessons learned from developing Whiley. Sci. Comput. Program. 113, 191\u2013220 (2015)","journal-title":"Sci. Comput. Program."},{"key":"23_CR46","unstructured":"Scott, R.: Blade runner. Motion Picture (1982)"},{"key":"23_CR47","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-1-4842-3829-5_6","volume-title":"Practical TLA+","author":"H Wayne","year":"2018","unstructured":"Wayne, H.: Temporal logic. In: Practical TLA+, pp. 97\u2013110. Apress, Berkeley (2018). https:\/\/doi.org\/10.1007\/978-1-4842-3829-5_6"},{"key":"23_CR48","doi-asserted-by":"crossref","unstructured":"Wise, J., Bader, J., Wong, C., Aldrich, J., Tanter, \u00c9., Sunshine, J.: Gradual verification of recursive heap data structures. Proc. ACM Program. Lang. 4(OOPSLA), 1\u201328 (2020)","DOI":"10.1145\/3428296"},{"key":"23_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-030-91550-6_10","volume-title":"Formal Methods Teaching","author":"N Yatapanage","year":"2021","unstructured":"Yatapanage, N.: Introducing formal methods to students who hate maths and struggle with programming. In: Ferreira, J.F., Mendes, A., Menghi, C. (eds.) FMTea 2021. LNCS, vol. 13122, pp. 133\u2013145. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-91550-6_10"},{"key":"23_CR50","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-030-71374-4_12","volume-title":"Formal Methods \u2013 Fun for Everybody","author":"R Zhumagambetov","year":"2021","unstructured":"Zhumagambetov, R.: Teaching formal methods in academia: a systematic literature review. In: Cerone, A., Roggenbach, M. (eds.) FMFun 2019. CCIS, vol. 1301, pp. 218\u2013226. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-71374-4_12"}],"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_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T11:11:47Z","timestamp":1659352307000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06773-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031067723","9783031067730"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06773-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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)"}}]}}