{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:28:49Z","timestamp":1743110929979,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030846282"},{"type":"electronic","value":"9783030846299"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-84629-9_7","type":"book-chapter","created":{"date-parts":[[2021,8,2]],"date-time":"2021-08-02T11:06:30Z","timestamp":1627902390000},"page":"120-139","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["PatEC: Pattern-Based Equivalence Checking"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5890-4673","authenticated-orcid":false,"given":"Marie-Christine","family":"Jakobs","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,3]]},"reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10766-017-0548-4","volume":"47","author":"M Abadi","year":"2019","unstructured":"Abadi, M., Keidar-Barner, S., Pidan, D., Veksler, T.: Verifying parallel code after refactoring using equivalence checking. International Journal Parallel Programming 47(1), 59\u201373 (2019). https:\/\/doi.org\/10.1007\/s10766-017-0548-4","journal-title":"Int. J. Parallel Program."},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Arab, M.N., Wolf, F., Jannesari, A.: Automatic construct selection and variable classification in OpenMP. In: Proceedings of ICS, pp. 330\u2013341. ACM, New York (2019). https:\/\/doi.org\/10.1145\/3330345.3330375","DOI":"10.1145\/3330345.3330375"},{"key":"7_CR3","doi-asserted-by":"publisher","unstructured":"Atzeni, S., Gopalakrishnan, G.: An operational semantic basis for building an OpenMP data race checker. In: Proceedings of IPDPSW, pp. 395\u2013404. IEEE (2018). https:\/\/doi.org\/10.1109\/IPDPSW.2018.00074","DOI":"10.1109\/IPDPSW.2018.00074"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Atzeni, S., et al.: ARCHER: effectively spotting data races in large OpenMP applications. In: Proceedings of IPDPS, pp. 53\u201362. IEEE (2016). https:\/\/doi.org\/10.1109\/IPDPS.2016.68","DOI":"10.1109\/IPDPS.2016.68"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Badihi, S., Akinotcho, F., Li, Y., Rubin, J.: ARDiff: scaling program equivalence checking via iterative abstraction and refinement of common code. In: Proceedings of FSE, pp. 13\u201324. ACM, New York (2020). https:\/\/doi.org\/10.1145\/3368089.3409757","DOI":"10.1145\/3368089.3409757"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-642-21437-0_17","volume-title":"FM 2011: Formal Methods","author":"G Barthe","year":"2011","unstructured":"Barthe, G., Crespo, J.M., Kunz, C.: Relational verification using product programs. In: Proc. FM. pp. 200\u2013214. LNCS 6664, Springer, Berlin (2011), https:\/\/doi.org\/10.1007\/978-3-642-21437-0_17"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-21487-5_4","volume-title":"OpenMP in the Petascale Era","author":"V Basupalli","year":"2011","unstructured":"Basupalli, V., Yuki, T., Rajopadhye, S.V., Morvan, A., Derrien, S., Quinton, P., Wonnacott, D.: ompVerify: Polyhedral analysis for the OpenMP programmer. In: Proc. IWOMP. pp. 37\u201353. LNCS 6665, Springer, Berlin (2011), https:\/\/doi.org\/10.1007\/978-3-642-21487-5_4"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-030-03592-1_14","volume-title":"Verified Software. Theories, Tools, and Experiments","author":"B Beckert","year":"2018","unstructured":"Beckert, B., Bingmann, T., Kiefer, M., Sanders, P., Ulbrich, M., Weigl, A.: Relational equivalence proofs between imperative and MapReduce algorithms. In: Proc. VSTTE. pp. 248\u2013266. LNCS 11294, Springer, Cham (2018), https:\/\/doi.org\/10.1007\/978-3-030-03592-1_14"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-662-46675-9_14","volume-title":"Fundamental Approaches to Software Engineering","author":"S Blom","year":"2015","unstructured":"Blom, S., Darabi, S., Huisman, M.: Verification of loop parallelisations. In: Proc. FASE. pp. 202\u2013217. LNCS 9033, Springer, Berlin (2015), https:\/\/doi.org\/10.1007\/978-3-662-46675-9_14"},{"key":"7_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-020-00601-z","author":"S Blom","year":"2021","unstructured":"Blom, S., Darabi, S., Huisman, M., Safari, M.: Correct program parallelisations. STTT (2021). https:\/\/doi.org\/10.1007\/s10009-020-00601-z","journal-title":"STTT"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Bora, U., Das, S., Kukreja, P., Joshi, S., Upadrasta, R., Rajopadhye, S.: LLOV: a fast static data-race checker for OpenMP programs. TACO 17(4), 1\u201326 (2020) https:\/\/doi.org\/10.1145\/3418597","DOI":"10.1145\/3418597"},{"issue":"4","key":"7_CR12","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/s10766-007-0051-4","volume":"35","author":"G Bronevetsky","year":"2007","unstructured":"Bronevetsky, G., de Supinski, B.R.: Complete formal specification of the OpenMP memory model. International Journal of Parallel Programming 35(4), 335\u2013392 (2007). https:\/\/doi.org\/10.1007\/s10766-007-0051-4","journal-title":"Int. J. Parallel Program."},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Felsing, D., Grebing, S., Klebanov, V., R\u00fcmmer, P., Ulbrich, M.: Automating regression verification. In: Proceedings of ASE, pp. 349\u2013360. ACM, New York (2014). https:\/\/doi.org\/10.1145\/2642937.2642987","DOI":"10.1145\/2642937.2642987"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Godlin, B., Strichman, O.: Regression verification. In: Proceedings of DAC, pp. 466\u2013471. ACM, New York (2009). https:\/\/doi.org\/10.1145\/1629911.1630034","DOI":"10.1145\/1629911.1630034"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Goncalves, R., Amaris, M., Okada, T.K., Bruel, P., Goldman, A.: OpenMP is not as easy as it appears. In: Proceedings of HICSS, pp. 5742\u20135751. IEEE (2016). https:\/\/doi.org\/10.1109\/HICSS.2016.710","DOI":"10.1109\/HICSS.2016.710"},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Jakobs, M.C.: Replication package for article \u2018PatEC: pattern-based equivalence checking\u2019. In: SPIN 2021, Zenodo (2021). https:\/\/doi.org\/10.5281\/zenodo.4841071","DOI":"10.5281\/zenodo.4841071"},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Jakobs, M.C.: PEQcheck: localized and context-aware checking of functional equivalence. In: Proceedings of FormaliSE, pp. 130\u2013140. IEEE (2021). https:\/\/doi.org\/10.1109\/FormaliSE52586.2021.00019","DOI":"10.1109\/FormaliSE52586.2021.00019"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/978-3-642-31424-7_54","volume-title":"Computer Aided Verification","author":"SK Lahiri","year":"2012","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 7358, Springer, Berlin (2012), https:\/\/doi.org\/10.1007\/978-3-642-31424-7_54"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.jss.2016.03.045","volume":"117","author":"Z Li","year":"2016","unstructured":"Li, Z., Atre, R., Huda, Z.U., Jannesari, A., Wolf, F.: Unveiling parallelization opportunities in sequential programs. Journal of Systems and Software 117, 282\u2013295 (2016). https:\/\/doi.org\/10.1016\/j.jss.2016.03.045","journal-title":"J. Syst. Softw."},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Liao, C., Lin, P., Asplund, J., Schordan, M., Karlin, I.: DataRaceBench: a benchmark suite for systematic evaluation of data race detection tools. In: Proceedings of SC, pp. 11:1\u201311:14. ACM, New York (2017) https:\/\/doi.org\/10.1145\/3126908.3126958","DOI":"10.1145\/3126908.3126958"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/978-3-642-02303-3_3","volume-title":"Evolving OpenMP in an Age of Extreme Parallelism","author":"C Liao","year":"2009","unstructured":"Liao, C., Quinlan, D.J., Willcock, J., Panas, T.: Extending automatic parallelization to optimize high-level abstractions for multicore. In: Proc. IWOMP. pp. 28\u201341. LNCS 5568, Springer, Berlin (2009), https:\/\/doi.org\/10.1007\/978-3-642-02303-3_3"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-540-68555-5_4","volume-title":"OpenMP Shared Memory Parallel Programming","author":"Y Lin","year":"2008","unstructured":"Lin, Y.: Static nonconcurrency analysis of OpenMP programs. In: Mueller, M.S., Chapman, B.M., de Supinski, B.R., Malony, A.D., Voss, M. (eds.) IWOMP -2005. LNCS, vol. 4315, pp. 36\u201350. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68555-5_4"},{"key":"7_CR23","doi-asserted-by":"publisher","unstructured":"Ma, H., Diersen, S., Wang, L., Liao, C., Quinlan, D.J., Yang, Z.: Symbolic analysis of concurrency errors in OpenMP programs. In: Proceedings of ICPP, pp. 510\u2013516. IEEE (2013). https:\/\/doi.org\/10.1109\/ICPP.2013.63","DOI":"10.1109\/ICPP.2013.63"},{"key":"7_CR24","unstructured":"Mattson, T.G., Sanders, B.A., Massingill, B.L.: Patterns for Parallel Programming (4th print). Addison-Wesley, Boston (2008)"},{"key":"7_CR25","volume-title":"Structured Parallel Programming: Patterns for Efficient Computation","author":"M McCool","year":"2012","unstructured":"McCool, M., Robison, A., Reinders, J.: Structured Parallel Programming: Patterns for Efficient Computation. Elsevier, Morgan Kaufman, Amsterdam (2012)"},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"Mendonca, G.S.D., Liao, C., Pereira, F.M.Q.: AutoParBench: a unified test framework for OpenMP-based parallelizers. In: Proceedings of ICS, pp. 28:1\u201328:10. ACM, New York (2020). https:\/\/doi.org\/10.1145\/3392717.3392744","DOI":"10.1145\/3392717.3392744"},{"key":"7_CR27","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.M., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Proc. TACAS. pp. 337\u2013340. LNCS 4963, Springer, Berlin (2008), https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Nielson, F., Nielson, H.R., Hankin, C.: Principles of Program Analysis. Springer, Berlin (1999). https:\/\/doi.org\/10.1007\/978-3-662-03811-6","DOI":"10.1007\/978-3-662-03811-6"},{"key":"7_CR29","unstructured":"OpenMP: OpenMP application programming interface (version 5.1). Technical report, OpenMP Architecture Review Board (2020). https:\/\/www.openmp.org\/specifications\/"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Person, S., Dwyer, M.B., Elbaum, S.G., Pasareanu, C.S.: Differential symbolic execution. In: Proceedings of FSE, pp. 226\u2013237. ACM, New York (2008). https:\/\/doi.org\/10.1145\/1453101.1453131","DOI":"10.1145\/1453101.1453131"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Pugh, W.: A practical algorithm for exact array dependence analysis. Commun. ACM 35(8), 102\u2013114 (1992) https:\/\/doi.org\/10.1145\/135226.135233","DOI":"10.1145\/135226.135233"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Pugh, W., Wonnacott, D.: Going beyond integer programming with the Omega test to eliminate false data dependences. IEEE Trans. Parallel Distrib. Syst. 6(2), 204\u2013211 (1995) https:\/\/doi.org\/10.1109\/71.342135","DOI":"10.1109\/71.342135"},{"key":"7_CR33","unstructured":"Quinlan, D., Liao, C.: The ROSE source-to-source compiler infrastructure. In: Cetus Users and Compiler Infrastructure Workshop, vol. 2011, pp. 1\u20133. Citeseer (2011)"},{"key":"7_CR34","unstructured":"Ramos, D.A., Engler, D.R.: Under-constrained symbolic execution: correctness checking for real code. In: USENIX Security Symposium, pp. 49\u201364. USENIX (2015). https:\/\/www.usenix.org\/conference\/usenixsecurity15\/technical-sessions\/presentation\/ramos"},{"key":"7_CR35","doi-asserted-by":"publisher","unstructured":"Royuela, S., Ferrer, R., Caballero, D., Martorell, X.: Compiler analysis for OpenMP tasks correctness. In: Proceedings of CF, pp. 7:1\u20137:8. ACM, New York (2015). https:\/\/doi.org\/10.1145\/2742854.2742882","DOI":"10.1145\/2742854.2742882"},{"key":"7_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-11454-5_6","volume-title":"Using and Improving OpenMP for Devices, Tasks, and More","author":"E Saillard","year":"2014","unstructured":"Saillard, E., Carribault, P., Barthou, D.: Static validation of barriers and worksharing constructs in OpenMP applications. In: Proc. IWOMP. pp. 73\u201386. LNCS 8766, Springer, Cham (2014), https:\/\/doi.org\/10.1007\/978-3-319-11454-5_6"},{"key":"7_CR37","doi-asserted-by":"publisher","unstructured":"Siegel, S.F., et al.: CIVL: the concurrency intermediate verification language. In: Proceedings of SC, pp. 61:1\u201361:12. ACM, New York (2015). https:\/\/doi.org\/10.1145\/2807591.2807635","DOI":"10.1145\/2807591.2807635"},{"issue":"4","key":"7_CR38","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s11786-011-0101-6","volume":"5","author":"SF Siegel","year":"2011","unstructured":"Siegel, S.F., Zirkel, T.K.: FEVS: A functional equivalence verification suite for high-performance scientific computing. Mathematics in Computer Science 5(4), 427\u2013435 (2011). https:\/\/doi.org\/10.1007\/s11786-011-0101-6","journal-title":"Math. Comput. Sci."},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Swain, B., Li, Y., Liu, P., Laguna, I., Georgakoudis, G., Huang, J.: OMPRacer: a scalable and precise static race detector for OpenMP programs. In: Proceedings of SC. IEEE (2020)","DOI":"10.1109\/SC41405.2020.00058"},{"key":"7_CR40","doi-asserted-by":"publisher","unstructured":"Verma, G., Shi, Y., Liao, C., Chapman, B.M., Yan, Y.: Enhancing DataRaceBench for evaluating data race detection tools. In: Proceedings of Correctness@SC, pp. 20\u201330. IEEE (2020). https:\/\/doi.org\/10.1109\/Correctness51934.2020.00008","DOI":"10.1109\/Correctness51934.2020.00008"},{"key":"7_CR41","doi-asserted-by":"publisher","unstructured":"Wiesner, M., Jakobs, M.C.: Verifying pipeline implementations in OpenMP. In: Laarman, A., Sokolova, A. (eds.) SPIN 2021. LNCS, vol. 12864, pp. 81\u201398. Springer, Charm (2021). https:\/\/doi.org\/10.1007\/978-3-030-84629-9_5","DOI":"10.1007\/978-3-030-84629-9_5"},{"key":"7_CR42","doi-asserted-by":"publisher","unstructured":"Yu, F., Yang, S., Wang, F., Chen, G., Chan, C.: Symbolic consistency checking of OpenMP parallel programs. In: Proceedings of LCTES, pp. 139\u2013148. ACM, New York (2012). https:\/\/doi.org\/10.1145\/2248418.2248438","DOI":"10.1145\/2248418.2248438"},{"key":"7_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-540-68237-0_5","volume-title":"FM 2008: Formal Methods","author":"A Zaks","year":"2008","unstructured":"Zaks, A., Pnueli, A.: CoVaC: Compiler validation by program analysis of the cross-product. In: Proc. FM. pp. 35\u201351. LNCS 5014, Springer, Berlin (2008), https:\/\/doi.org\/10.1007\/978-3-540-68237-0_5"},{"key":"7_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-540-85261-2_7","volume-title":"Languages and Compilers for Parallel Computing","author":"Y Zhang","year":"2008","unstructured":"Zhang, Y., Duesterwald, E., Gao, G.R.: Concurrency analysis for shared memory programs with textually unaligned barriers. In: Proc. LCPC. pp. 95\u2013109. LNCS 5234, Springer, Berlin (2007), https:\/\/doi.org\/10.1007\/978-3-540-85261-2_7"}],"container-title":["Lecture Notes in Computer Science","Model Checking Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-84629-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T23:07:05Z","timestamp":1629328025000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84629-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030846282","9783030846299"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84629-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"3 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SPIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Model Checking Software","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"spin2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/ecoop-issta-2021\/spin-2021","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":"20","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":"8","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":"40% - 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":"2","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)"}},{"value":"2 invited papers are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}