{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T06:30:00Z","timestamp":1750746600464,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031471148"},{"type":"electronic","value":"9783031471155"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-47115-5_9","type":"book-chapter","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T15:04:38Z","timestamp":1698678278000},"page":"145-164","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Ranged Program Analysis via Instrumentation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5098-0495","authenticated-orcid":false,"given":"Jan","family":"Haltermann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5890-4673","authenticated-orcid":false,"given":"Marie-Christine","family":"Jakobs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2906-6508","authenticated-orcid":false,"given":"Cedric","family":"Richter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2385-7512","authenticated-orcid":false,"given":"Heike","family":"Wehrheim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,31]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Beyer, D., Henzinger, T.A., Keremoglu, M.E., Wendler, P.: Conditional model checking: a technique to pass information between verifiers. In: Proceedings of FSE. ACM (2012)","key":"9_CR1","DOI":"10.1145\/2393596.2393664"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-030-16722-6_23","volume-title":"Fundamental Approaches to Software Engineering","author":"D Beyer","year":"2019","unstructured":"Beyer, D., Jakobs, M.-C.: CoVeriTest: cooperative verifier-based testing. In: H\u00e4hnle, R., van der Aalst, W. (eds.) FASE 2019. LNCS, vol. 11424, pp. 389\u2013408. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16722-6_23"},{"doi-asserted-by":"crossref","unstructured":"Beyer, D., Jakobs, M.-C., Lemberger, T., Wehrheim, H.: Reducer-based construction of conditional verifiers. In: Proceedings of ICSE, pp. 1182\u20131193. ACM (2018)","key":"9_CR3","DOI":"10.1145\/3180155.3180259"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-31784-3_11","volume-title":"Automated Technology for Verification and Analysis","author":"D Beyer","year":"2019","unstructured":"Beyer, D., Lemberger, T.: Conditional testing. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 189\u2013208. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_11"},{"doi-asserted-by":"publisher","unstructured":"Beyer, D.: Progress on software verification: SV-COMP 2022. In: Fisman, D., Rosu, G. (eds.) TACAS 2022. LNCS, vol. 13244, pp. 375\u2013402. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_20","key":"9_CR5","DOI":"10.1007\/978-3-030-99527-0_20"},{"doi-asserted-by":"publisher","unstructured":"Beyer, D.: Competition on software verification and witness validation: SV-COMP 2023. In: Sankaranarayanan, S., Sharygina, N. (eds.) TACAS 2023. LNCS, vol. 13994, pp. 495\u2013522. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_29","key":"9_CR6","DOI":"10.1007\/978-3-031-30820-8_29"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-540-73368-3_51","volume-title":"Computer Aided Verification","author":"D Beyer","year":"2007","unstructured":"Beyer, D., Henzinger, T.A., Th\u00e9oduloz, G.: Configurable software verification: concretizing the convergence of model checking and program analysis. In: Damm, W., Hermanns, H. (eds.) CAV 2007. LNCS, vol. 4590, pp. 504\u2013518. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73368-3_51"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-22110-1_16","volume-title":"Computer Aided Verification","author":"D Beyer","year":"2011","unstructured":"Beyer, D., Keremoglu, M.E.: CPAchecker: a tool for configurable software verification. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 184\u2013190. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_16"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10009-017-0469-y","volume":"21","author":"D Beyer","year":"2019","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Reliable benchmarking: requirements and solutions. STTT 21(1), 1\u201329 (2019)","journal-title":"STTT"},{"doi-asserted-by":"crossref","unstructured":"Bucur, S., Ureche, V., Zamfir, C., Candea, G.: Parallel symbolic execution for automated real-world software testing. In: Proceedings of EuroSys, pp. 183\u2013198. ACM (2011)","key":"9_CR10","DOI":"10.1145\/1966445.1966463"},{"unstructured":"Cadar, C., Dunbar, D., Engler, D.R.: KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs. In: Proceedings of OSDI, pp. 209\u2013224. USENIX Association (2008)","key":"9_CR11"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-030-99527-0_32","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Chalupa","year":"2022","unstructured":"Chalupa, M., Mihalkovi\u010d, V., \u0158echt\u00e1\u010dkov\u00e1, A., Zaoral, L., Strej\u010dek, J.: Symbiotic 9: string analysis and backward symbolic execution with loop folding. In: Fisman, D., Rosu, G. (eds.) TACAS 2022. LNCS, vol. 13244, pp. 462\u2013467. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_32"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-030-88806-0_3","volume-title":"Static Analysis","author":"M Chalupa","year":"2021","unstructured":"Chalupa, M., Strej\u010dek, J.: Backward symbolic execution with loop folding. In: Dr\u0103goi, C., Mukherjee, S., Namjoshi, K. (eds.) SAS 2021. LNCS, vol. 12913, pp. 49\u201376. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88806-0_3"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-32759-9_13","volume-title":"FM 2012: Formal Methods","author":"M Christakis","year":"2012","unstructured":"Christakis, M., M\u00fcller, P., W\u00fcstholz, V.: Collaborative verification and testing with explicit assumptions. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 132\u2013146. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_13"},{"unstructured":"SV-Benchmarks Community: SV-Benchmarks (2023). https:\/\/gitlab.com\/sosy-lab\/benchmarking\/sv-benchmarks\/-\/tree\/svcomp23","key":"9_CR15"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-662-46675-9_7","volume-title":"Fundamental Approaches to Software Engineering","author":"M Czech","year":"2015","unstructured":"Czech, M., Jakobs, M.-C., Wehrheim, H.: Just test what you cannot verify! In: Egyed, A., Schaefer, I. (eds.) FASE 2015. LNCS, vol. 9033, pp. 100\u2013114. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46675-9_7"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/978-3-662-49122-5_16","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P Daca","year":"2016","unstructured":"Daca, P., Gupta, A., Henzinger, T.A.: Abstraction-driven concolic testing. In: Jobstmann, B., Leino, K.R.M. (eds.) VMCAI 2016. LNCS, vol. 9583, pp. 328\u2013347. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49122-5_16"},{"issue":"6","key":"9_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2382756.2382799","volume":"37","author":"D Funes","year":"2012","unstructured":"Funes, D., Siddiqui, J.H., Khurshid, S.: Ranged model checking. ACM SIGSOFT Softw. Eng. Notes 37(6), 1\u20135 (2012)","journal-title":"ACM SIGSOFT Softw. Eng. Notes"},{"doi-asserted-by":"crossref","unstructured":"Gerrard, M.J., Dwyer, M.B.: ALPACA: a large portfolio-based alternating conditional analysis. In: Proceedings of ICSE, pp. 35\u201338. IEEE\/ACM (2019)","key":"9_CR19","DOI":"10.1109\/ICSE-Companion.2019.00032"},{"doi-asserted-by":"publisher","unstructured":"Haltermann, J., Jakobs, M., Richter, C., Wehrheim, H.: Parallel program analysis via range splitting. In: Lambers, L., Uchitel, S. (eds.) FASE 2023. LNCS, vol. 13991, pp. 195\u2013219. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30826-0_11","key":"9_CR20","DOI":"10.1007\/978-3-031-30826-0_11"},{"doi-asserted-by":"publisher","unstructured":"Haltermann, J., Jakobs, M., Richter, C., Wehrheim, H.: Replication package for article \u2018Ranged Program Analysis via Instrumentation\u2019, June 2023. https:\/\/doi.org\/10.5281\/zenodo.8065229","key":"9_CR21","DOI":"10.5281\/zenodo.8065229"},{"doi-asserted-by":"publisher","unstructured":"Heizmann, M., et al.: Ultimate automizer and the CommuHash normal form - (competition contribution). In: Sankaranarayanan, S., Sharygina, N. (eds.) Proceedings of TACAS. LNCS, vol. 13994, pp. 577\u2013581. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_39","key":"9_CR22","DOI":"10.1007\/978-3-031-30820-8_39"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-642-39799-8_2","volume-title":"Computer Aided Verification","author":"M Heizmann","year":"2013","unstructured":"Heizmann, M., Hoenicke, J., Podelski, A.: Software model checking for people who love automata. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 36\u201352. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_2"},{"key":"9_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-319-67549-7_4","volume-title":"Testing Software and Systems","author":"S Huster","year":"2017","unstructured":"Huster, S., Str\u00f6bele, J., Ruf, J., Kropf, T., Rosenstiel, W.: Using robustness testing to handle incomplete verification results when combining verification and testing techniques. In: Yevtushenko, N., Cavalli, A.R., Yenig\u00fcn, H. (eds.) ICTSS 2017. LNCS, vol. 10533, pp. 54\u201370. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67549-7_4"},{"doi-asserted-by":"crossref","unstructured":"Inverso, O., Trubiani, C.: Parallel and distributed bounded model checking of multi-threaded programs. In: Proceedings of PPoPP, pp. 202\u2013216. ACM (2020)","key":"9_CR25","DOI":"10.1145\/3332466.3374529"},{"doi-asserted-by":"crossref","unstructured":"Nguyen, T.L., Schrammel, P., Fischer, B., La Torre, S., Parlato, G.: Parallel bug-finding in concurrent programs via reduced interleaving instances. In: Proceedings of ASE, pp. 753\u2013764. IEEE (2017)","key":"9_CR26","DOI":"10.1109\/ASE.2017.8115686"},{"doi-asserted-by":"crossref","unstructured":"Pauck, F., Wehrheim, H.: Together strong: cooperative android app analysis. In: Proceedings of ESEC\/FSE, pp. 374\u2013384. ACM (2019)","key":"9_CR27","DOI":"10.1145\/3338906.3338915"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-319-77935-5_28","volume-title":"NASA Formal Methods","author":"R Qiu","year":"2018","unstructured":"Qiu, R., Khurshid, S., P\u0103s\u0103reanu, C.S., Wen, J., Yang, G.: Using test ranges to improve symbolic execution. In: Dutle, A., Mu\u00f1oz, C., Narkawicz, A. (eds.) NFM 2018. LNCS, vol. 10811, pp. 416\u2013434. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77935-5_28"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-319-89963-3_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Sherman","year":"2018","unstructured":"Sherman, E., Dwyer, M.B.: Structurally defined conditional data-flow static analysis. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10806, pp. 249\u2013265. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89963-3_15"},{"doi-asserted-by":"crossref","unstructured":"Siddiqui, J.H., Khurshid, S.: Scaling symbolic execution using ranged analysis. In: Proceedings of SPLASH, pp. 523\u2013536. ACM (2012)","key":"9_CR30","DOI":"10.1145\/2398857.2384654"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-030-63406-3_7","volume-title":"Formal Methods and Software Engineering","author":"S Singh","year":"2020","unstructured":"Singh, S., Khurshid, S.: Parallel chopped symbolic execution. In: Lin, S.-W., Hou, Z., Mahony, B. (eds.) ICFEM 2020. LNCS, vol. 12531, pp. 107\u2013125. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63406-3_7"},{"doi-asserted-by":"crossref","unstructured":"Staats, M., Pasareanu, S.S.: Parallel symbolic execution for structural test generation. In: Proceedings of ISSTA, pp. 183\u2013194. ACM (2010)","key":"9_CR32","DOI":"10.1145\/1831708.1831732"},{"doi-asserted-by":"crossref","unstructured":"Wei, G., et al.: Compiling parallel symbolic execution with continuations. In: ICSE, pp. 1316\u20131328. IEEE (2023)","key":"9_CR33","DOI":"10.1109\/ICSE48619.2023.00116"},{"issue":"4","key":"9_CR34","first-page":"352","volume":"10","author":"MD Weiser","year":"1984","unstructured":"Weiser, M.D.: Program slicing. IEEE TSE 10(4), 352\u2013357 (1984)","journal-title":"IEEE TSE"},{"issue":"6","key":"9_CR35","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2830719.2830729","volume":"40","author":"G Yang","year":"2015","unstructured":"Yang, G., Do, Q.C.D., Wen, J.: Distributed assertion checking using symbolic execution. ACM SIGSOFT Softw. Eng. Notes 40(6), 1\u20135 (2015)","journal-title":"ACM SIGSOFT Softw. Eng. Notes"},{"doi-asserted-by":"crossref","unstructured":"Yang, G., Qiu, R., Khurshid, S., Pasareanu, C.S., Wen, J.: A synergistic approach to improving symbolic execution using test ranges. Innov. Syst. Softw. Eng. 15(3-4), 325\u2013342 (2019)","key":"9_CR36","DOI":"10.1007\/s11334-019-00331-9"},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-030-32304-2_13","volume-title":"Static Analysis","author":"B Yin","year":"2019","unstructured":"Yin, B., Chen, L., Liu, J., Wang, J., Cousot, P.: Verifying numerical programs via iterative abstract testing. In: Chang, B.-Y.E. (ed.) SAS 2019. LNCS, vol. 11822, pp. 247\u2013267. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32304-2_13"},{"doi-asserted-by":"crossref","unstructured":"Zhou, L., Gan, S., Qin, X., Han, W.: SECloud: binary analyzing using symbolic execution in the cloud. In: Proceedings of CBD, pp. 58\u201363. IEEE (2013)","key":"9_CR38","DOI":"10.1109\/CBD.2013.31"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47115-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T00:03:10Z","timestamp":1699056190000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47115-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031471148","9783031471155"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47115-5_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software Engineering and Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Eindhoven","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sefm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sefm-conference.github.io\/2023\/","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":"41","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":"19","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":"0","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":"46% - 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":"4,5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}