{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,18]],"date-time":"2026-07-18T05:08:44Z","timestamp":1784351324866,"version":"3.55.0"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030994280","type":"print"},{"value":"9783030994297","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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:00:00Z","timestamp":1648512000000},"content-version":"vor","delay-in-days":87,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Refactoring a program without changing the program\u2019s functional behavior is challenging. To prevent that behavioral changes remain undetected, one may apply approaches that compare the functional behavior of original and refactored programs. Difference detection approaches often use dedicated test generators and may be inefficient (i.e., execute (some of) the non-modified code twice). In contrast, proving functional equivalence often requires expensive verification. Therefore, we propose<jats:sc>PEQtest<\/jats:sc>, which aims at localized functional equivalence testing thereby relying on existing tests or test generators. To this end,<jats:sc>PEQtest<\/jats:sc>derives a test program from the original program by replacing each code segment being refactored with program code that encodes the equivalence of the original and its refactored code segment. The encoding is similar to program encodings used by some verification-based equivalence checkers. Furthermore, we prove that the test program derived by<jats:sc>PEQtest<\/jats:sc>indeed checks functional equivalence. Moreover, we implemented<jats:sc>PEQtest<\/jats:sc>in a prototype and evaluate it on several examples. Our evaluation shows that<jats:sc>PEQtest<\/jats:sc>successfully detects refactored programs that change the program behavior and that it often performs better than the state-of-the-art equivalence checker<jats:sc>PEQcheck<\/jats:sc>.<\/jats:p>","DOI":"10.1007\/978-3-030-99429-7_11","type":"book-chapter","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T20:02:48Z","timestamp":1648497768000},"page":"184-204","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["PEQtest: Testing Functional Equivalence"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5890-4673","authenticated-orcid":false,"given":"Marie-Christine","family":"Jakobs","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7357-2016","authenticated-orcid":false,"given":"Maik","family":"Wiesner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,3,29]]},"reference":[{"key":"11_CR1","unstructured":"Technical \"whitepaper\" for afl-fuzz, http:\/\/lcamtuf.coredump.cx\/afl\/technical_details.txt (last accessed 2022-01-19)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Abadi, M., Keidar-Barner, S., Pidan, D., Veksler, T.: Verifying parallel code after refactoring using equivalence checking. Int. J. Parallel Program. 47(1), 59\u201373 (2019)","DOI":"10.1007\/s10766-017-0548-4"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Abramson, D., Foster, I.T., Michalakes, J., Sosi\u010d, R.: Relative debugging and its application to the development of large numerical models. In: Proc. SC. p.\u00a051. ACM (1995)","DOI":"10.1145\/224170.224350"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Badihi, S., Akinotcho, F., Li, Y., Rubin, J.: ARDiff: scaling program equivalence checking via iterative abstraction and refinement of common code. In: Proc. FSE. pp. 13\u201324. ACM (2020)","DOI":"10.1145\/3368089.3409757"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Barthe, G., Crespo, J.M., Kunz, C.: Relational verification using product programs. In: Proc. FM. pp. 200\u2013214. LNCS\u00a06664, Springer (2011)","DOI":"10.1007\/978-3-642-21437-0_17"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Benton, N.: Simple relational correctness proofs for static analyses and program transformations. In: Proc. POPL. pp. 14\u201325. ACM (2004)","DOI":"10.1145\/982962.964003"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Beyer, D., Keremoglu, M.E.: CPAchecker: A tool for configurable software verification. In: Proc. CAV. pp. 184\u2013190. LNCS\u00a06806, Springer (2011)","DOI":"10.1007\/978-3-642-22110-1_16"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Beyer, D., L\u00f6we, S., Novikov, E., Stahlbauer, A., Wendler, P.: Precision reuse for efficient regression verification. In: Proc. FSE. pp. 389\u2013399. ACM (2013)","DOI":"10.1145\/2491411.2491429"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Blom, S., Darabi, S., Huisman, M.: Verification of loop parallelisations. In: Proc. FASE. pp. 202\u2013217. LNCS\u00a09033, Springer, Berlin (2015)","DOI":"10.1007\/978-3-662-46675-9_14"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Blom, S., Darabi, S., Huisman, M., Safari, M.: Correct program parallelisations. STTT (2021)","DOI":"10.1007\/s10009-020-00601-z"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"B\u00f6hme, M., d.\u00a0S.\u00a0Oliveira, B.C., Roychoudhury, A.: Partition-based regression verification. In: Proc. ICSE. pp. 302\u2013311. IEEE (2013)","DOI":"10.1109\/ICSE.2013.6606576"},{"key":"11_CR12","unstructured":"Cadar, C., Dunbar, D., Engler, D.R.: KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs. In: Proc. OSDI. pp. 209\u2013224. USENIX Association (2008)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Churchill, B.R., Padon, O., Sharma, R., Aiken, A.: Semantic program alignment for equivalence checking. In: Proc. PLDI. pp. 1027\u20131040. ACM (2019)","DOI":"10.1145\/3314221.3314596"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Dahiya, M., Bansal, S.: Black-box equivalence checking across compiler optimizations. In: Proc. APLAS. pp. 127\u2013147. LNCS\u00a010695, Springer (2017)","DOI":"10.1007\/978-3-319-71237-6_7"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Felsing, D., Grebing, S., Klebanov, V., R\u00fcmmer, P., Ulbrich, M.: Automating regression verification. In: Proc. ASE. pp. 349\u2013360. ACM (2014)","DOI":"10.1145\/2642937.2642987"},{"key":"11_CR16","unstructured":"Fowler, M.: Refactoring - Improving the Design of Existing Code. Addison-Wesley (1999)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Godlin, B., Strichman, O.: Regression verification. In: Proc. DAC. pp. 466\u2013471. ACM (2009)","DOI":"10.1145\/1629911.1630034"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Jakobs, M.C.: PatEC: Pattern-based equivalence checking. In: Proc. SPIN. LNCS\u00a012864, Springer, Cham (2021)","DOI":"10.1007\/978-3-030-84629-9_7"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Jakobs, M.C.: PEQcheck: Localized and context-aware checking of functional equivalence. In: Proc. FormaliSE. pp. 130\u2013140. IEEE (2021)","DOI":"10.1109\/FormaliSE52586.2021.00019"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Jin, W., Orso, A., Xie, T.: Automated behavioral regression testing. In: Proc. ICST. pp. 137\u2013146. IEEE (2010)","DOI":"10.1109\/ICST.2010.64"},{"key":"11_CR21","unstructured":"Kawaguchi, M., Lahiri, S., Rebelo, H.: Conditional equivalence. Tech. rep., Microsoft Research (2010)"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Kundu, S., Tatlock, Z., Lerner, S.: Proving optimizations correct using parameterized program equivalence. In: Proc. PLDI. pp. 327\u2013337. ACM (2009)","DOI":"10.1145\/1543135.1542513"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Lahiri, S.K., Hawblitzel, C., Kawaguchi, M., Reb\u00ealo, H.: SYMDIFF: A language-agnostic semantic diff tool for imperative programs. In: Proc. CAV. pp. 712\u2013717. LNCS\u00a07358, Springer (2012)","DOI":"10.1007\/978-3-642-31424-7_54"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Liao, C., Lin, P.H., Asplund, J., Schordan, M., Karlin, I.: DataRaceBench: A benchmark suite for systematic evaluation of data race detection tools. In: Proc. SC. pp. 11:1\u201311:14. ACM (2017)","DOI":"10.1145\/3126908.3126958"},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Mal\u00edk, V., Vojnar, T.: Automatically checking semantic equivalence between versions of large-scale C projects. In: Proc. ICST. pp. 329\u2013339. IEEE (2021)","DOI":"10.1109\/ICST49551.2021.00045"},{"key":"11_CR26","unstructured":"McKeeman, W.M.: Differential testing for software. Digital Technical Journal 10(1), 100\u2013107 (1998)"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"de\u00a0Moura, L.M., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Proc. TACAS. pp. 337\u2013340. LNCS\u00a04963, Springer (2008)","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Muehlboeck, F., Henzinger, T.A.: Differential monitoring. In: Proc. RV. pp. 231\u2013243. LNCS\u00a012974, Springer (2021)","DOI":"10.1007\/978-3-030-88494-9_12"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Noller, Y., Pasareanu, C.S., B\u00f6hme, M., Sun, Y., Nguyen, H.L., Grunske, L.: HyDiff: Hybrid differential software analysis. In: Proc. ICSE. pp. 1273\u20131285. ACM (2020)","DOI":"10.1145\/3377811.3380363"},{"key":"11_CR30","unstructured":"OpenMP: OpenMP application programming interface (version 5.1). Tech. rep., OpenMP Architecture Review Board (2020)"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Palikareva, H., Kuchta, T., Cadar, C.: Shadow of a doubt: Testing for divergences between software versions. In: Proc. ICSE. pp. 1181\u20131192. ACM (2016)","DOI":"10.1145\/2884781.2884845"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Partush, N., Yahav, E.: Abstract semantic differencing for numerical programs. In: Proc. SAS. pp. 238\u2013258. LNCS\u00a07935, Springer (2013)","DOI":"10.1007\/978-3-642-38856-9_14"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Partush, N., Yahav, E.: Abstract semantic differencing via speculative correlation. In: Proc. OOPSLA. pp. 811\u2013828. ACM (2014)","DOI":"10.1145\/2714064.2660245"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Person, S., Dwyer, M.B., Elbaum, S.G., Pasareanu, C.S.: Differential symbolic execution. In: Proc. FSE. pp. 226\u2013237. ACM (2008)","DOI":"10.1145\/1453101.1453131"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Person, S., Yang, G., Rungta, N., Khurshid, S.: Directed incremental symbolic execution. In: Proc. PLDI. pp. 504\u2013515. ACM (2011)","DOI":"10.1145\/1993316.1993558"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Qi, D., Roychoudhury, A., Liang, Z.: Test generation to expose changes in evolving programs. In: Proc. ASE. pp. 397\u2013406. ACM (2010)","DOI":"10.1145\/1858996.1859083"},{"key":"11_CR37","unstructured":"Quinlan, D., Liao, C.: The ROSE source-to-source compiler infrastructure. In: Cetus users and compiler infrastructure workshop, in conjunction with PACT. vol.\u00a02011, pp.\u00a01\u20133. Citeseer (2011)"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Ramos, D.A., Engler, D.R.: Practical, low-effort equivalence verification of real code. In: Proc. CAV. pp. 669\u2013685. LNCS\u00a06806, Springer (2011)","DOI":"10.1007\/978-3-642-22110-1_55"},{"key":"11_CR39","doi-asserted-by":"crossref","unstructured":"Sery, O., Fedyukovich, G., Sharygina, N.: Incremental upgrade checking by means of interpolation-based function summaries. In: Proc. FMCAD. pp. 114\u2013121. IEEE (2012)","DOI":"10.1007\/978-3-642-34188-5_15"},{"key":"11_CR40","doi-asserted-by":"crossref","unstructured":"Sharma, R., Schkufza, E., Churchill, B.R., Aiken, A.: Data-driven equivalence checking. In: Proc. OOPSLA. pp. 391\u2013406. ACM (2013)","DOI":"10.1145\/2544173.2509509"},{"key":"11_CR41","doi-asserted-by":"crossref","unstructured":"Shashidhar, K.C., Bruynooghe, M., Catthoor, F., Janssens, G.: Functional equivalence checking for verification of algebraic transformations on array-intensive source code. In: Proc. DATE. pp. 1310\u20131315. IEEE (2005)","DOI":"10.1109\/DATE.2005.163"},{"key":"11_CR42","doi-asserted-by":"crossref","unstructured":"Siegel, S.F., Zheng, M., Luo, Z., Zirkel, T.K., Marianiello, A.V., Edenhofner, J.G., Dwyer, M.B., Rogers, M.S.: CIVL: the concurrency intermediate verification language. In: Proc. SC. pp. 61:1\u201361:12. ACM (2015)","DOI":"10.1145\/2807591.2807635"},{"key":"11_CR43","doi-asserted-by":"crossref","unstructured":"Siegel, S.F., Zirkel, T.K.: TASS: the toolkit for accurate scientific software. Mathematics in Computer Science 5(4), 395\u2013426 (2011)","DOI":"10.1007\/s11786-011-0100-7"},{"key":"11_CR44","doi-asserted-by":"crossref","unstructured":"Steinh\u00f6fel, D.: REFINITY to model and prove program transformation rules. In: Proc. APLAS. pp. 311\u2013319. LNCS\u00a012470, Springer (2020)","DOI":"10.1007\/978-3-030-64437-6_16"},{"key":"11_CR45","doi-asserted-by":"crossref","unstructured":"Sultana, N., Thompson, S.J.: Mechanical verification of refactorings. In: Proc. PEPM. pp. 51\u201360. ACM (2008)","DOI":"10.1145\/1328408.1328417"},{"key":"11_CR46","doi-asserted-by":"crossref","unstructured":"Taneja, K., Xie, T.: DiffGen: Automated regression unit-test generation. In: Proc. ASE. pp. 407\u2013410. IEEE (2008)","DOI":"10.1109\/ASE.2008.60"},{"key":"11_CR47","doi-asserted-by":"crossref","unstructured":"Taneja, K., Xie, T., Tillmann, N., de\u00a0Halleux, J.: eXpress: Guided path exploration for efficient regression test generation. In: Proc. ISSTA. pp. 1\u201311. ACM (2011)","DOI":"10.1145\/2001420.2001422"},{"key":"11_CR48","doi-asserted-by":"crossref","unstructured":"Trostanetski, A., Grumberg, O., Kroening, D.: Modular demand-driven analysis of semantic difference for program versions. In: Proc. SAS. pp. 405\u2013427. LNCS\u00a010422, Springer (2017)","DOI":"10.1007\/978-3-319-66706-5_20"},{"key":"11_CR49","doi-asserted-by":"crossref","unstructured":"Verdoolaege, S., Janssens, G., Bruynooghe, M.: Equivalence checking of static affine programs using widening to handle recurrences. In: Proc. CAV. pp. 599\u2013613. LNCS\u00a05643, Springer (2009)","DOI":"10.1007\/978-3-642-02658-4_44"},{"key":"11_CR50","doi-asserted-by":"crossref","unstructured":"Verma, G., Shi, Y., Liao, C., Chapman, B.M., Yan, Y.: Enhancing DataRaceBench for evaluating data race detection tools. In: Proc. Correctness@SC. pp. 20\u201330. IEEE (2020)","DOI":"10.1109\/Correctness51934.2020.00008"},{"key":"11_CR51","doi-asserted-by":"crossref","unstructured":"Wood, T., Drossopoulou, S., Lahiri, S.K., Eisenbach, S.: Modular verification of procedure equivalence in the presence of memory allocation. In: Proc. ESOP. pp. 937\u2013963. LNCS\u00a010201, Springer (2017)","DOI":"10.1007\/978-3-662-54434-1_35"},{"key":"11_CR52","doi-asserted-by":"crossref","unstructured":"Xie, T., Taneja, K., Kale, S., Marinov, D.: Towards a framework for differential unit testing of object-oriented programs. In: Proc. AST. pp. 17\u201323. IEEE (2007)","DOI":"10.1109\/AST.2007.15"},{"key":"11_CR53","doi-asserted-by":"crossref","unstructured":"Yang, G., Dwyer, M.B., Rothermel, G.: Regression model checking. In: Proc. ICSM. pp. 115\u2013124. IEEE (2009)","DOI":"10.1109\/ICSM.2009.5306334"},{"key":"11_CR54","doi-asserted-by":"crossref","unstructured":"Yoo, S., Harman, M.: Regression testing minimization, selection and prioritization: a survey. Softw. Test. Verification Reliab. 22(2), 67\u2013120 (2012)","DOI":"10.1002\/stv.430"},{"key":"11_CR55","doi-asserted-by":"crossref","unstructured":"Yu, F., Yang, S., Wang, F., Chen, G., Chan, C.: Symbolic consistency checking of OpenMP parallel programs. In: Proc. LCTES. pp. 139\u2013148. ACM (2012)","DOI":"10.1145\/2345141.2248438"},{"key":"11_CR56","doi-asserted-by":"crossref","unstructured":"Zaks, A., Pnueli, A.: CoVaC: Compiler validation by program analysis of the cross-product. In: Proc. FM. pp. 35\u201351. LNCS\u00a05014, Springer (2008)","DOI":"10.1007\/978-3-540-68237-0_5"}],"container-title":["Lecture Notes in Computer Science","Fundamental Approaches to Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-99429-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T04:23:17Z","timestamp":1726892597000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-99429-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030994280","9783030994297"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-99429-7_11","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":"29 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Fundamental Approaches to Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"4 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fase2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2022\/fase","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"61","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":"17","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":"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":"7","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)"}}]}}