{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:28:42Z","timestamp":1767137322111,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":37,"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_21","type":"book-chapter","created":{"date-parts":[[2022,5,19]],"date-time":"2022-05-19T07:24:44Z","timestamp":1652945084000},"page":"393-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["From Verified Scala to\u00a0STIX File System Embedded Code Using Stainless"],"prefix":"10.1007","author":[{"given":"Jad","family":"Hamza","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3979-128X","authenticated-orcid":false,"given":"Simon","family":"Felix","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7044-9522","authenticated-orcid":false,"given":"Viktor","family":"Kun\u010dak","sequence":"additional","affiliation":[]},{"given":"Ivo","family":"Nussbaumer","sequence":"additional","affiliation":[]},{"given":"Filip","family":"Schramka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","unstructured":"Amani, S., et al.: Cogent: verifying high-assurance file system implementations. In: Conte, T., Zhou, Y. (eds.) Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2016, Atlanta, GA, USA, 2\u20136 April 2016, pp. 175\u2013188. ACM (2016). https:\/\/doi.org\/10.1145\/2872362.2872404","DOI":"10.1145\/2872362.2872404"},{"key":"21_CR2","unstructured":"Antognini, M.: Extending Safe C Support In Leon. Master\u2019s thesis, EPFL (2017). http:\/\/infoscience.epfl.ch\/record\/227942"},{"key":"21_CR3","doi-asserted-by":"publisher","unstructured":"Barrett, C., et al.: CVC4. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 171\u2013177. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_14","DOI":"10.1007\/978-3-642-22110-1_14"},{"issue":"1","key":"21_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s13218-010-0005-7","volume":"24","author":"B Beckert","year":"2010","unstructured":"Beckert, B., Moskal, M.: Deductive verification of system software in the verisoft XT project. K\u00fcnstliche Intell. 24(1), 57\u201361 (2010). https:\/\/doi.org\/10.1007\/s13218-010-0005-7","journal-title":"K\u00fcnstliche Intell."},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Blanc, R.W., Kneuss, E., Kuncak, V., Suter, P.: An overview of the Leon verification system: verification by translation to recursive functions. In: Scala Workshop (2013)","DOI":"10.1145\/2489837.2489838"},{"key":"21_CR6","doi-asserted-by":"publisher","unstructured":"Blanc, R.W.: Verification by Reduction to Functional Programs. Ph.D. thesis, EPFL, Lausanne (2017). https:\/\/doi.org\/10.5075\/epfl-thesis-7636, http:\/\/infoscience.epfl.ch\/record\/230242","DOI":"10.5075\/epfl-thesis-7636"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/2597457.2597459","volume":"11","author":"G Bloom","year":"2014","unstructured":"Bloom, G., Sherrill, J.: Scheduling and thread management with RTEMS. ACM Sigbed Rev. 11(1), 20\u201325 (2014)","journal-title":"ACM Sigbed Rev."},{"key":"21_CR8","doi-asserted-by":"publisher","unstructured":"Bornholt, J., Kaufmann, A., Li, J., Krishnamurthy, A., Torlak, E., Wang, X.: Specifying and checking file system crash-consistency models. In: Conte, T., Zhou, Y. (eds.) Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2016, Atlanta, GA, USA, 2\u20136 April 2016, pp. 83\u201398. ACM (2016). https:\/\/doi.org\/10.1145\/2872362.2872406","DOI":"10.1145\/2872362.2872406"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Bornholt, J., Kaufmann, A., Li, J., Krishnamurthy, A., Torlak, E., Wang, X.: Specifying and checking file system crash-consistency models. In: Proceedings of the Twenty-First International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 83\u201398 (2016)","DOI":"10.1145\/2954680.2872406"},{"key":"21_CR10","doi-asserted-by":"publisher","unstructured":"Buyse, M., Delmas, R., Hamadi, Y.: ALPACAS: a language for parametric assessment of critical architecture safety. In: M\u00f8ller, A., Sridharan, M. (eds.) 35th European Conference on Object-Oriented Programming (ECOOP 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 194, pp. 5:1\u20135:29. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2021.5","DOI":"10.4230\/LIPIcs.ECOOP.2021.5"},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Chajed, T., Chen, H., Chlipala, A., Kaashoek, M.F., Zeldovich, N., Ziegler, D.: Certifying a file system using crash Hoare logic: correctness in the presence of crashes. Commun. ACM 60(4), 75\u201384 (2017). https:\/\/doi.org\/10.1145\/3051092","DOI":"10.1145\/3051092"},{"key":"21_CR12","unstructured":"Chajed, T., Tassarotti, J., Theng, M., Jung, R., Kaashoek, M.F., Zeldovich, N.: GoJournal: a verified, concurrent, crash-safe journaling system. In: Brown, A.D., Lorch, J.R. (eds.) 15th USENIX Symposium on Operating Systems Design and Implementation, OSDI 2021, 14\u201316 July 2021, pp. 423\u2013439. USENIX Association (2021). https:\/\/www.usenix.org\/conference\/osdi21\/presentation\/chajed"},{"key":"21_CR13","doi-asserted-by":"publisher","unstructured":"Cohen, E., et al.: VCC: a practical system for verifying concurrent C. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) Theorem Proving in Higher Order Logics, 22nd International Conference, TPHOLs 2009, Munich, Germany, 17\u201320 August 2009. Proceedings. Lecture Notes in Computer Science, vol. 5674, pp. 23\u201342. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-03359-9_2","DOI":"10.1007\/978-3-642-03359-9_2"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-33826-7_16","volume-title":"Software Engineering and Formal Methods","author":"P Cuoq","year":"2012","unstructured":"Cuoq, P., Kirchner, F., Kosmatov, N., Prevosto, V., Signoles, J., Yakobowski, B.: Frama-C. In: Eleftherakis, G., Hinchey, M., Holcombe, M. (eds.) SEFM 2012. LNCS, vol. 7504, pp. 233\u2013247. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33826-7_16"},{"key":"21_CR15","doi-asserted-by":"publisher","unstructured":"Dan\u011bk, M., Kafka, L., Kohout, L., S\u1ef3kora, J., Bartosi\u0144ski, R.: The LEON3 processor. In: UTLEON3: Exploring Fine-Grain Multi-Threading in FPGAs, pp. 9\u201314. Springer (2013). https:\/\/doi.org\/10.1007\/978-1-4614-2410-9","DOI":"10.1007\/978-1-4614-2410-9"},{"key":"21_CR16","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":"21_CR17","doi-asserted-by":"publisher","unstructured":"Haller, P., Loiko, A.: LaCasa: lightweight affinity and object capabilities in Scala. In: Proceedings of the 2016 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications, pp. 272\u2013291. Association for Computing Machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2983990.2984042","DOI":"10.1145\/2983990.2984042"},{"key":"21_CR18","doi-asserted-by":"publisher","unstructured":"Hamza, J., Voirol, N., Kun\u010dak, V.: System FR: formalized foundations for the Stainless verifier. Proc. ACM Program. Lang. 3(OOPSLA) (2019). https:\/\/doi.org\/10.1145\/3360592","DOI":"10.1145\/3360592"},{"key":"21_CR19","doi-asserted-by":"publisher","unstructured":"Havelund, K., Bocchino, R.: Integrated modeling and development of component-based embedded software in Scala. In: Margaria, T., Steffen, B. (eds.) Leveraging Applications of Formal Methods, Verification and Validation - 10th International Symposium on Leveraging Applications of Formal Methods, ISoLA 2021, 17\u201329 October 2021, Rhodes, Greece, Proceedings. Lecture Notes in Computer Science, vol. 13036, pp. 233\u2013252. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-89159-6_16","DOI":"10.1007\/978-3-030-89159-6_16"},{"key":"21_CR20","unstructured":"Hawblitzel, C., et al.: Ironclad apps: end-to-end security via automated Full-System verification. In: 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14), pp. 165\u2013181. USENIX Association, Broomfield, CO, October 2014. https:\/\/www.usenix.org\/conference\/osdi14\/technical-sessions\/presentation\/hawblitzel"},{"key":"21_CR21","unstructured":"Inria, C., contributors: Early history of coq. https:\/\/coq.inria.fr\/refman\/history.html (2021)"},{"key":"21_CR22","doi-asserted-by":"publisher","unstructured":"Jouvelot, P., Gifford, D.K.: Algebraic reconstruction of types and effects. In: Wise, D.S. (ed.) Conference Record of the Eighteenth Annual ACM Symposium on Principles of Programming Languages, Orlando, Florida, USA, 21\u201323 January 1991, pp. 303\u2013310. ACM Press (1991). https:\/\/doi.org\/10.1145\/99583.99623","DOI":"10.1145\/99583.99623"},{"key":"21_CR23","doi-asserted-by":"publisher","unstructured":"Kim, S., Xu, M., Kashyap, S., Yoon, J., Xu, W., Kim, T.: Finding bugs in file systems with an extensible fuzzing framework. ACM Trans. Storage 16(2), 10:1\u201310:35 (2020). https:\/\/doi.org\/10.1145\/3391202","DOI":"10.1145\/3391202"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-54862-8_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Kroening","year":"2014","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"},{"key":"21_CR25","unstructured":"Krucker, S., et al.: The spectrometer\/telescope for imaging X-rays (STIX). Astronom. Astrophys. 642, A15 (2020)"},{"key":"21_CR26","doi-asserted-by":"publisher","unstructured":"Kumar, R., Myreen, M.O., Norrish, M., Owens, S.: CakeML: a verified implementation of ML. In: Jagannathan, S., Sewell, P. (eds.) The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, 20\u201321 January 2014, San Diego, CA, USA, pp. 179\u2013192. ACM (2014). https:\/\/doi.org\/10.1145\/2535838.2535841","DOI":"10.1145\/2535838.2535841"},{"key":"21_CR27","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-642-17511-4_20","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"KRM Leino","year":"2010","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"},{"issue":"7","key":"21_CR28","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1538788.1538814","volume":"52","author":"X Leroy","year":"2009","unstructured":"Leroy, X.: Formal verification of a realistic compiler. Commun. ACM 52(7), 107\u2013115 (2009). https:\/\/doi.org\/10.1145\/1538788.1538814","journal-title":"Commun. ACM"},{"key":"21_CR29","doi-asserted-by":"publisher","unstructured":"Mehlitz, P., Shafiei, N., Tkachuk, O., Davies, M.: RACE: building airspace simulations faster and better with actors. In: 2016 IEEE\/AIAA 35th Digital Avionics Systems Conference (DASC), pp. 1\u20139 (2016). https:\/\/doi.org\/10.1109\/DASC.2016.7777991","DOI":"10.1109\/DASC.2016.7777991"},{"key":"21_CR30","doi-asserted-by":"publisher","unstructured":"Moore, J.S.: Milestones from the Pure Lisp theorem prover to ACL2. Formal Aspects Comput. 31(6), 699\u2013732 (2019). https:\/\/doi.org\/10.1007\/s00165-019-00490-3","DOI":"10.1007\/s00165-019-00490-3"},{"key":"21_CR31","doi-asserted-by":"publisher","unstructured":"Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle\/HOL: a proof assistant for higher-order logic, vol.\u00a02283. Springer Science & Business Media (2002). https:\/\/doi.org\/10.1007\/3-540-45949-9_5","DOI":"10.1007\/3-540-45949-9_5"},{"key":"21_CR32","doi-asserted-by":"publisher","unstructured":"Paulson, L.C., Nipkow, T., Wenzel, M.: From LCF to Isabelle\/HOL. Formal Aspects Comput. 31(6), 675\u2013698 (2019). https:\/\/doi.org\/10.1007\/s00165-019-00492-1","DOI":"10.1007\/s00165-019-00492-1"},{"key":"21_CR33","doi-asserted-by":"publisher","unstructured":"Robby, Hatcliff, J.: Slang: the Sireum programming language. In: Margaria, T., Steffen, B. (eds.) Leveraging Applications of Formal Methods, Verification and Validation (ISoLA), pp. 253\u2013273. Springer International Publishing, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89159-6_17","DOI":"10.1007\/978-3-030-89159-6_17"},{"key":"21_CR34","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-540-89439-1_20","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"P R\u00fcmmer","year":"2008","unstructured":"R\u00fcmmer, P.: A constraint sequent calculus for first-order logic with linear integer arithmetic. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 274\u2013289. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89439-1_20"},{"key":"21_CR35","doi-asserted-by":"publisher","unstructured":"Shafiei, N., Havelund, K., Mehlitz, P.C.: Actor-based runtime verification with MESA. In: Deshmukh, J., Nickovic, D. (eds.) Runtime Verification - 20th International Conference, RV 2020, 6\u20139 October 2020, Los Angeles, CA, USA, Proceedings. Lecture Notes in Computer Science, vol. 12399, pp. 221\u2013240. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-60508-7_12","DOI":"10.1007\/978-3-030-60508-7_12"},{"key":"21_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-23702-7_23","volume-title":"Static Analysis","author":"P Suter","year":"2011","unstructured":"Suter, P., K\u00f6ksal, A.S., Kuncak, V.: Satisfiability modulo recursive programs. In: Yahav, E. (ed.) SAS 2011. LNCS, vol. 6887, pp. 298\u2013315. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23702-7_23"},{"key":"21_CR37","doi-asserted-by":"crossref","unstructured":"Voirol, N., Kneuss, E., Kuncak, V.: Counter-example complete verification for higher-order functions. In: Scala Symposium (2015)","DOI":"10.1145\/2774975.2774978"}],"updated-by":[{"DOI":"10.1007\/978-3-031-06773-0_46","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2022,8,2]],"date-time":"2022-08-02T00:00:00Z","timestamp":1659398400000}}],"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_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,1]],"date-time":"2022-08-01T07:12:09Z","timestamp":1659337929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06773-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031067723","9783031067730"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06773-0_21","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":"2 August 2022","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"In the original version of this paper, Fig. 3 was not displayed as it should have been. It is now included in this erratum.","order":4,"name":"change_details","label":"Change Details","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)"}}]}}