{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T12:01:55Z","timestamp":1742990515768,"version":"3.40.3"},"publisher-location":"Cham","reference-count":57,"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_22","type":"book-chapter","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T11:24:44Z","timestamp":1652959484000},"page":"411-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Termination of\u00a0Borrow Checking in\u00a0Featherweight Rust"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3519-025X","authenticated-orcid":false,"given":"\u00c9tienne","family":"Payet","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4535-9677","authenticated-orcid":false,"given":"David J.","family":"Pearce","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2973-0384","authenticated-orcid":false,"given":"Fausto","family":"Spoto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Anderson, B., et al.: Engineering the servo web browser engine using Rust. In: Proceedings of the ICSE, pp. 81\u201389 (2016)","DOI":"10.1145\/2889160.2889229"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Ashouri, M.: Etherolic: a practical security analyzer for smart contracts. In: Proceedings of the SAC, pp. 353\u2013356. ACM Press (2020)","DOI":"10.1145\/3341105.3374226"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Astrauskas, V., M\u00fcller, P., Poli, F., Summers, A.J.: Leveraging Rust types for modular specification and verification. In: Proceedings of the OOPSLA, page Article 147 (2019)","DOI":"10.1145\/3360573"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Astrauskas, V., Matheja, C., Poli, F., M\u00fcller, P., Summers, A.J.: How do programmers use unsafe Rust? In: Proceedings of the OOPSLA, pp. 136:1\u2013136:27 (2020)","DOI":"10.1145\/3428204"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Bae, Y., Kim, Y., Askar, A., Lim, J., Kim, T.: RUDRA: finding memory safety bugs in Rust at the ecosystem scale. In: Proceedings of the SOSP (2021, to appear)","DOI":"10.1145\/3477132.3483570"},{"issue":"1","key":"22_CR6","first-page":"94","volume":"51","author":"A Balasubramanian","year":"2017","unstructured":"Balasubramanian, A., Baranowski, M.S., Burtsev, A., Panda, A., Rakamari, Z., Ryzhyk, L.: System programming in Rust: beyond safety. OS Rev. 51(1), 94\u201399 (2017)","journal-title":"OS Rev."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Baranowski, M., He, S., Rakamari\u0107, Z.: Verifying Rust programs with SMACK. In: Proceedings of the ATVA, pp. 528\u2013535 (2018)","DOI":"10.1007\/978-3-030-01090-4_32"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11804192_17","volume-title":"Formal Methods for Components and Objects","author":"M Barnett","year":"2006","unstructured":"Barnett, M., Chang, B.-Y.E., DeLine, R., Jacobs, B., Leino, K.R.M.: Boogie: a modular reusable verifier for object-oriented programs. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 364\u2013387. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11804192_17"},{"key":"22_CR9","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 SOSP, pp. 836\u2013850. ACM Press (2021)","DOI":"10.1145\/3477132.3483540"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Dang, H.-H., Jourdan, J.-H., Kaiser, J.-O., Dreyer, D.: RustBelt meets relaxed memory. In: Proceedings of the POPL, page Article 34 (2020)","DOI":"10.1145\/3371102"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Dewey, K., Roesch, J., Hardekopf, B.: Fuzzing the Rust typechecker using CLP (t). In: Proceedings of the ASE, pp. 482\u2013493. IEEE (2015)","DOI":"10.1109\/ASE.2015.65"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Emre, M., Schroeder, R., Dewey, K., Hardekopf, B.: Translating C to safer Rust, pp. 1\u201329 (2021)","DOI":"10.1145\/3485498"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Evans, A.N., Campbell, B., Soffa, M.L.: Is Rust used safely by software developers? In: Proceedings of the ICSE, pp. 246\u2013257. ACM Press (2020)","DOI":"10.1145\/3377811.3380413"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Hj\u00e1lmarsson, F.\u00de., Hrei\u00f0arsson, G.K., Hamdaqa, M., Hj\u00e1lmt\u00fdsson, G.: Blockchain-based e-voting system. In: Proceedings of the CLOUD, pp. 983\u2013986 (2018)","DOI":"10.1109\/CLOUD.2018.00151"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Hua, B., Ouyang, W., Jiang, C., Fan, Q., Pan, Z.: Rupair: towards automatic buffer overflow detection and rectification for Rust. In: Proceedings of the ACSAC, pp. 812\u2013823. ACM Press (2021)","DOI":"10.1145\/3485832.3485841"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Jespersen, T.B.L., Munksgaard, P., Larsen, K.F.: Session types for Rust. In: Proceedings of the Workshop on Generic Programming (WGP), pp. 13\u201322 (2015)","DOI":"10.1145\/2808098.2808100"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Jung, R., Jourdan, J., Krebbers, R., Dreyer, D.: RustBelt: securing the foundations of the Rust programming language. In: Proceedings of the POPL, pp. 1\u201334 (2018)","DOI":"10.1145\/3158154"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Jung, R., Dang, H.-H., Kang, J., Dreyer, D.: Stacked borrows: an aliasing model for Rust. In: Proceedings of the POPL, page Article 41 (2020)","DOI":"10.1145\/3371109"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Jung, R., Krebbers, R., Birkedal, L., Dreyer, D.: Higher-order ghost state. In: Proceedings of the ICFP, pp. 256\u2013269. ACM Press (2016)","DOI":"10.1145\/3022670.2951943"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Jung, R., Krebbers, R., Jourdan, J.-H., Bizjak, A., Birkedal, L., Dreyer, D.: Iris from the ground up: a modular foundation for higher-order concurrent separation logic. JFP 28, e20 (2018)","DOI":"10.1017\/S0956796818000151"},{"key":"22_CR22","unstructured":"Kaiser, J.-O., Dang, H.-H., Dreyer, D., Lahav, O., Vafeiadis, V.: Strong logic for weak memory: reasoning about release-acquire consistency in iris. In: Proceedings of the ECOOP, vol. 74, pp. 17:1\u201317:29. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Kokke, W.: Rusty variation: deadlock-free sessions with failure in Rust. In: Proceedings of the ICE, pp. 48\u201360 (2019)","DOI":"10.4204\/EPTCS.304.4"},{"key":"22_CR24","doi-asserted-by":"publisher","unstructured":"Kroening, D., Tautschnig, M.: CBMC \u2013 C bounded model checker. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 389\u2013391. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_26","DOI":"10.1007\/978-3-642-54862-8_26"},{"key":"22_CR25","doi-asserted-by":"publisher","unstructured":"Rustan, K., Leino, M.: Developing verified programs with Dafny. In: Joshi, R., M\u00fcller, P., Podelski, A. (eds.) VSTTE 2012. LNCS, vol. 7152, p. 82. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27705-4_7","DOI":"10.1007\/978-3-642-27705-4_7"},{"key":"22_CR26","doi-asserted-by":"publisher","unstructured":"Leino, K.R.M.: Dafny: an automatic program verifier for functional correctness. In: Clarke, E.M., Voronkov, A. (eds.) LPAR 2010. LNCS (LNAI), vol. 6355, pp. 348\u2013370. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17511-4_20","DOI":"10.1007\/978-3-642-17511-4_20"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Levy, A., Campbell, B., Ghena, B., Pannuto, P., Dutta, P., Levis, P.: The case for writing a kernel in Rust. In: Proceedings of the APSYS, pp. 1:1\u20131:7 (2017)","DOI":"10.1145\/3124680.3124717"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Levy, A., et al.: Multiprogramming a 64kb computer safely and efficiently. In: Proceedings of the SOSP, pp. 234\u2013251. ACM Press (2017)","DOI":"10.1145\/3132747.3132786"},{"key":"22_CR29","doi-asserted-by":"crossref","unstructured":"Levy, A.A., et al.: Ownership is theft: experiences building an embedded OS in Rust. In: Proceedings of the Workshop on Programming Languages and Operating Systems, pp. 21\u201326 (2015)","DOI":"10.1145\/2818302.2818306"},{"key":"22_CR30","doi-asserted-by":"crossref","unstructured":"Li, Z., Wang, J., Sun, M., Lui, J.C.S.: MirChecker: detecting bugs in Rust programs via static analysis. In: Proceedings of the CCS, pp. 2183\u20132196. ACM Press (2021)","DOI":"10.1145\/3460120.3484541"},{"key":"22_CR31","doi-asserted-by":"crossref","unstructured":"Lindner, M., Aparicius, J., Lindgren, P.: No panic! Verification of Rust programs by symbolic execution. In: Proceedings of the INDIN, pp. 108\u2013114 (2018)","DOI":"10.1109\/INDIN.2018.8471992"},{"key":"22_CR32","doi-asserted-by":"crossref","unstructured":"Lindner, M., Fitinghoff, N., Eriksson, J., Lindgren, P.: Verification of safety functions implemented in Rust - a symbolic execution based approach. In: Proceedings of the INDIN, pp. 432\u2013439 (2019)","DOI":"10.1109\/INDIN41052.2019.8972014"},{"key":"22_CR33","doi-asserted-by":"crossref","unstructured":"Liu, P., Zhao, G., Huang, J.: Securing unsafe Rust programs with XRust. In: Proceedings of the ICSE, pp. 234\u2013245. ACM Press (2020)","DOI":"10.1145\/3377811.3380325"},{"key":"22_CR34","doi-asserted-by":"publisher","unstructured":"Matsushita, Y., Tsukada, T., Kobayashi, N.: RustHorn: CHC-based verification for rust programs. In: ESOP 2020. LNCS, vol. 12075, pp. 484\u2013514. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44914-8_18","DOI":"10.1007\/978-3-030-44914-8_18"},{"key":"22_CR35","doi-asserted-by":"crossref","unstructured":"Memarian, K., et al.: Exploring C semantics and pointer provenance. In: Proceedings of the POPL, pp. 67:1\u201367:32 (2019)","DOI":"10.1145\/3290380"},{"key":"22_CR36","doi-asserted-by":"crossref","unstructured":"Ning, P., Qin, B.: Stuck-me-not: a deadlock detector on blockchain software in Rust. Procedia Comput. Sci. 177, 599\u2013604 (2020)","DOI":"10.1016\/j.procs.2020.10.085"},{"key":"22_CR37","unstructured":"Olson, S.: Miri: an interpreter for Rust\u2019s mid-level intermediate representation. Technical report (2016)"},{"key":"22_CR38","doi-asserted-by":"crossref","unstructured":"Pacheco, C., Ernst, M.D.: Randoop: feedback-directed random testing for Java. In: Proceedings of the OOPSLA (Companion), pp. 815\u2013816 (2007)","DOI":"10.1145\/1297846.1297902"},{"key":"22_CR39","doi-asserted-by":"crossref","unstructured":"Pearce, D.J.: Sound and complete flow typing with unions, intersections and negations. In: Proceedings of the VMCAI, pp. 335\u2013354 (2013)","DOI":"10.1007\/978-3-642-35873-9_21"},{"key":"22_CR40","doi-asserted-by":"crossref","unstructured":"Pearce, D.J.: A lightweight formalism for reference lifetimes and borrowing in Rust. ACM TOPLAS 43(1), Article 3 (2021)","DOI":"10.1145\/3443420"},{"key":"22_CR41","doi-asserted-by":"crossref","unstructured":"Pearce, D.J., Groves, L.: Designing a verifying compiler: lessons learned from developing Whiley. In: SCP, pp. 191\u2013220 (2015)","DOI":"10.1016\/j.scico.2015.09.006"},{"key":"22_CR42","doi-asserted-by":"publisher","unstructured":"Pearce, D.J., Utting, M., Groves, L.: An introduction to software verification with Whiley. In: Bowen, J.P., Liu, Z., Zhang, Z. (eds.) SETSS 2018. LNCS, vol. 11430, pp. 1\u201337. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17601-3_1","DOI":"10.1007\/978-3-030-17601-3_1"},{"key":"22_CR43","unstructured":"Reed, E.: Patina: a formalization of the Rust programming language. Technical report (2015)"},{"key":"22_CR44","doi-asserted-by":"crossref","unstructured":"Rivera, E., Mergendahl, S., Shrobe, H.E., Okhravi, H., Burow, N.: Keeping safe Rust safe with Galeed. In: Proceedings of the ACSAC, pp. 824\u2013836. ACM Press (2021)","DOI":"10.1145\/3485832.3485903"},{"issue":"6","key":"22_CR45","first-page":"397","volume":"79","author":"G Rosu","year":"2010","unstructured":"Rosu, G., Serbanuta, T.: An overview of the K semantic framework. JLAP 79(6), 397\u2013434 (2010)","journal-title":"JLAP"},{"key":"22_CR46","unstructured":"Rust Team: The Rust programming language. doc.rust-lang.org\/book\/. Accessed 05 Jan 2016"},{"key":"22_CR47","unstructured":"Rust Team: The rustonomicon - the dark arts of advanced and unsafe Rust programming. doc.rust-lang.org\/nomicon\/. Accessed 31 Mar 2020"},{"key":"22_CR48","doi-asserted-by":"crossref","unstructured":"Toman, J., Pernsteiner, S., Torlak, E.: Crust: a bounded verifier for Rust. In: Proceedings of the ASE, pp. 75\u201380 (2015)","DOI":"10.1109\/ASE.2015.77"},{"key":"22_CR49","doi-asserted-by":"crossref","unstructured":"Utting, M., Pearce, D.J., Groves, L.: Making Whiley Boogie! In: Proceedings of the IFM, pp. 69\u201384 (2017)","DOI":"10.1007\/978-3-319-66845-1_5"},{"key":"22_CR50","doi-asserted-by":"crossref","unstructured":"VanHattum, A., Schwartz-Narbonne, D., Chong, N., Sampson, A.: Verifying dynamic trait objects in Rust. In: Proceedings of the ICSE-SEIP (2022, to appear)","DOI":"10.1109\/ICSE-SEIP55303.2022.9794041"},{"key":"22_CR51","doi-asserted-by":"crossref","unstructured":"Wang, F., Song, F., Zhang, M., Zhu, X., Zhang, J.: KRust: a formal executable semantics of Rust. In: Proceedings of the TASE, pp. 44\u201351 (2018)","DOI":"10.1109\/TASE.2018.00014"},{"key":"22_CR52","doi-asserted-by":"crossref","unstructured":"Wang, H., et al.: Towards memory safe enclave programming with Rust-SGX. In: Proceedings of the CCS, pp. 2333\u20132350. ACM Press (2019)","DOI":"10.1145\/3319535.3354241"},{"key":"22_CR53","doi-asserted-by":"crossref","unstructured":"Wang, P., et al.: Building and maintaining a third-party library supply chain for productive and secure SGX enclave development. In: Proceedings of the ICSE-SEIP, pp. 100\u2013109. ACM Press (2020)","DOI":"10.1145\/3377813.3381348"},{"key":"22_CR54","unstructured":"Weiss, A., Patterson, D., Matsakis, N.D., Ahmed, A.: Oxide: The essence of Rust (2019)"},{"key":"22_CR55","doi-asserted-by":"crossref","unstructured":"Wolff, F., B\u00edl\u00fd, A., Matheja, C., M\u00fcller, P., Summers, A.J.: Modular specification and verification of closures in Rust. In: Proceedings of the OOPSLA, pp. 1\u201329 (2021)","DOI":"10.1145\/3485522"},{"key":"22_CR56","unstructured":"Xu, H., Chen, Z., Sun, M., Zhou, Y.: Memory-safety challenge considered solved? An empirical study with all Rust CVEs. CoRR, abs\/2003.03296 (2020)"},{"key":"22_CR57","doi-asserted-by":"crossref","unstructured":"Zhang, F., et al.: The Ekiden platform for confidentiality-preserving, trustworthy, and performant smart contracts. IEEE S&P 18(3), 17\u201327 (2020)","DOI":"10.1109\/MSEC.2020.2976984"}],"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_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T11:12:00Z","timestamp":1659352320000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06773-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031067723","9783031067730"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06773-0_22","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)"}}]}}