{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T06:26:12Z","timestamp":1784183172682,"version":"3.55.0"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031572487","type":"print"},{"value":"9783031572494","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T00:00:00Z","timestamp":1712275200000},"content-version":"vor","delay-in-days":95,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p><jats:sc>GenMC<\/jats:sc> is a state-of-the-art stateless model checker that can verify safety properties of concurrent C\/C++ programs under a wide range of memory consistency models, such as SC, TSO, RC11, and IMM.<\/jats:p><jats:p>In this paper, we improve the performance and usability of <jats:sc>GenMC<\/jats:sc>: we provide a probabilistic estimate of the expected verification cost, we automate the porting of new memory models, and employ caching and other data structure optimizations to improve the tool\u2019s performance.<\/jats:p>","DOI":"10.1007\/978-3-031-57249-4_4","type":"book-chapter","created":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T07:02:35Z","timestamp":1712214155000},"page":"66-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Enhancing GenMC\u2019s Usability and Performance"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7905-9739","authenticated-orcid":false,"given":"Michalis","family":"Kokologiannakis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2136-0542","authenticated-orcid":false,"given":"Rupak","family":"Majumdar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8436-0334","authenticated-orcid":false,"given":"Viktor","family":"Vafeiadis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,4,5]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Aronis, S., Atig, M.F., Jonsson, B., Leonardsson, C., Sagonas, K.: Stateless model checking for TSO and PSO. In: TACAS 2015, LNCS, vol. 9035, pp. 353\u2013367. Springer, Heidelberg (2015). doi: https:\/\/doi.org\/10.1007\/978-3-662-46681-0_28","DOI":"10.1007\/978-3-662-46681-0_28"},{"key":"4_CR2","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Aronis, S., Jonsson, B., Sagonas, K.: Optimal dynamic partial order reduction. In: POPL 2014, pp. 373\u2013384. ACM, New York, NY, USA (2014). doi: https:\/\/doi.org\/10.1145\/2535838.2535845","DOI":"10.1145\/2535838.2535845"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Jonsson, B., Leonardsson, C.: Stateless model checking for POWER. In: CAV 2016, LNCS, vol. 9780, pp. 134\u2013156. Springer, Heidelberg (2016). doi: https:\/\/doi.org\/10.1007\/978-3-319-41540-6_8","DOI":"10.1007\/978-3-319-41540-6_8"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Atig, M.F., Jonsson, B., Ngo, T.P.: Optimal stateless model checking under the release-acquire semantics. Proc. ACM Program. Lang. 2(OOPSLA), 135:1\u2013135:29 (2018) doi: https:\/\/doi.org\/10.1145\/3276505","DOI":"10.1145\/3276505"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Agarwal, P., Chatterjee, K., Pathak, S., Pavlogiannis, A., Toman, V.: Stateless Model Checking Under a Reads-Value-From Equivalence. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021, pp. 341\u2013366. Springer International Publishing, Cham (2021). doi: https:\/\/doi.org\/10.1007\/978-3-030-81685-8_16","DOI":"10.1007\/978-3-030-81685-8_16"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Albert, E., Arenas, P., de la Banda, M.G., G\u00f3mez-Zamalloa, M., Stuckey, P.J.: Context-sensitive dynamic partial order reduction. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017, pp. 526\u2013543. Springer International Publishing, Cham (2017). doi: https:\/\/doi.org\/10.1007\/978-3-319-63387-9_26","DOI":"10.1007\/978-3-319-63387-9_26"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Albert, E., G\u00f3mez-Zamalloa, M., Isabel, M., Rubio, A.: Constrained dynamic partial order reduction. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018, pp. 392\u2013410. Springer International Publishing, Cham (2018). doi: https:\/\/doi.org\/10.1007\/978-3-319-96142-2_24","DOI":"10.1007\/978-3-319-96142-2_24"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Alglave, J., Kroening, D., Tautschnig, M.: Partial orders for efficient bounded model checking of concurrent software. In: CAV 2013, LNCS, vol. 8044, pp. 141\u2013157. Springer, Heidelberg (2013). doi: https:\/\/doi.org\/10.1007\/978-3-642-39799-8_9","DOI":"10.1007\/978-3-642-39799-8_9"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Alglave, J., Maranget, L., Tautschnig, M.: Herding cats: Modelling, simulation, testing, and data mining for weak memory. ACM Trans. Program. Lang. Syst. 36(2), 7:1\u20137:74 (2014) doi: https:\/\/doi.org\/10.1145\/2627752","DOI":"10.1145\/2627752"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Aronis, S., Jonsson, B., L\u00e5ng, M., Sagonas, K.: Optimal dynamic partial order reduction with observers. In: TACAS 2018, LNCS, vol. 10806, pp. 229\u2013248. Springer, Heidelberg (2018). doi: https:\/\/doi.org\/10.1007\/978-3-319-89963-3_14","DOI":"10.1007\/978-3-319-89963-3_14"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Bui, T.L., Chatterjee, K., Gautam, T., Pavlogiannis, A., Toman, V.: The Readsfrom Equivalence for the TSO and PSO Memory Models. Proc. ACM Program. Lang. 5(OOPSLA) (2021) doi: https:\/\/doi.org\/10.1145\/3485541","DOI":"10.1145\/3485541"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Chalupa, M., Chatterjee, K., Pavlogiannis, A., Sinha, N., Vaidya, K.: Datacentric dynamic partial order reduction. Proc. ACM Program. Lang. 2(POPL), 31:1\u201331:30 (2017) doi: https:\/\/doi.org\/10.1145\/3158119","DOI":"10.1145\/3158119"},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Chase, D., Lev, Y.: Dynamic circular work-stealing deque. In: SPAA 2005, pp. 21\u201328. ACM (2005). doi: https:\/\/doi.org\/10.1145\/1073970.1073974","DOI":"10.1145\/1073970.1073974"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Pavlogiannis, A., Toman, V.: Value-Centric Dynamic Partial Order Reduction. Proc. ACM Program. Lang. 3(OOPSLA) (2019) doi: https:\/\/doi.org\/10.1145\/3360550","DOI":"10.1145\/3360550"},{"key":"4_CR15","doi-asserted-by":"publisher","unstructured":"Clarke, E.M., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: TACAS 2004, LNCS, vol. 2988, pp. 168\u2013176. Springer, Heidelberg (2004). doi: https:\/\/doi.org\/10.1007\/978-3-540-24730-2_15","DOI":"10.1007\/978-3-540-24730-2_15"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Coons, K.E., Musuvathi, M., McKinley, K.S.: Bounded Partial-Order Reduction. In: OOPSLA 2013, pp. 833\u2013848. ACM, Indianapolis, Indiana, USA (2013). doi: https:\/\/doi.org\/10.1145\/2509136.2509556","DOI":"10.1145\/2509136.2509556"},{"key":"4_CR17","doi-asserted-by":"publisher","unstructured":"Flanagan, C., Godefroid, P.: Dynamic partial-order reduction for model checking software. In: POPL 2005, pp. 110\u2013121. ACM, New York, NY, USA (2005). doi: https:\/\/doi.org\/10.1145\/1040305.1040315","DOI":"10.1145\/1040305.1040315"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Gavrilenko, N., Ponce-de-Le\u00f3n, H., Furbach, F., Heljanko, K., Meyer, R.: BMC for weak memory models: Relation analysis for compact SMT encodings. In: Dillig, I., Tasiran, S. (eds.) CAV 2019, pp. 355\u2013365. Springer International Publishing, Cham (2019). doi: https:\/\/doi.org\/10.1007\/978-3-030-25540-4_19","DOI":"10.1007\/978-3-030-25540-4_19"},{"key":"4_CR19","unstructured":"Kokologiannakis, M.: GenMC: Generic model checking for C programs. url: https:\/\/github.com\/MPI-SWS\/genmc"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Godefroid, P.: Software Model Checking: The VeriSoft Approach. Form. Meth. Syst. Des. 26(2), 77\u2013101 (2005) doi: https:\/\/doi.org\/10.1007\/s10703-005-1489-x","DOI":"10.1007\/s10703-005-1489-x"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Gotovos, A., Christakis, M., Sagonas, K.: Test-driven development of concurrent programs using concuerror. In: Rikitake, K., Stenman, E. (eds.) Erlang 2022 2011, pp. 51\u201361. ACM (2011). doi: https:\/\/doi.org\/10.1145\/2034654.2034664","DOI":"10.1145\/2034654.2034664"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Haas, T., Meyer, R., Ponce de Le\u00f3n, H.: CAAT: Consistency as a Theory. Proc. ACM Program. Lang. 6(OOPSLA2) (2022) doi: https:\/\/doi.org\/10.1145\/3563292","DOI":"10.1145\/3563292"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Knuth, D.E.: Estimating the Efficiency of Backtrack Programs. Math. Comput. 29(129), 121\u2013136 (1975) doi: https:\/\/doi.org\/10.2307\/2005469","DOI":"10.2307\/2005469"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Kokologiannakis, M., Lahav, O., Sagonas, K., Vafeiadis, V.: Effective stateless model checking for C\/C++ concurrency. Proc. ACM Program. Lang. 2(POPL), 17:1\u201317:32 (2017) doi: https:\/\/doi.org\/10.1145\/3158105","DOI":"10.1145\/3158105"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Kokologiannakis, M., Lahav, O., Vafeiadis, V.: Kater: Automating Weak Memory Model Metatheory and Consistency Checking. Proc. ACM Program. Lang. 7(POPL) (2023) doi: https:\/\/doi.org\/10.1145\/3571212","DOI":"10.1145\/3571212"},{"key":"4_CR26","unstructured":"Kokologiannakis, M., Majumdar, R., Vafeiadis, V.: Enhancing GenMC\u2019s Usability and Performance (Replication Package)(2024). url: https:\/\/zenodo.org\/doi\/10.5281\/zenodo.10018135"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Kokologiannakis, M., Marmanis, I., Gladstein, V., Vafeiadis, V.: Truly stateless, optimal dynamic partial order reduction. Proc. ACM Program. Lang. 6(POPL) (2022) doi: https:\/\/doi.org\/10.1145\/3498711","DOI":"10.1145\/3498711"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Kokologiannakis, M., Marmanis, I., Vafeiadis, V.: Unblocking Dynamic Partial Order Reduction. In: CAV 2023, pp. 230\u2013250. Springer (2023). doi: https:\/\/doi.org\/10.1007\/978-3-031-37706-8_12","DOI":"10.1007\/978-3-031-37706-8_12"},{"key":"4_CR29","doi-asserted-by":"publisher","unstructured":"Kokologiannakis, M., Raad, A., Vafeiadis, V.: Model checking for weakly consistent libraries. In: PLDI 2019, ACM, New York, NY, USA (2019). doi: https:\/\/doi.org\/10.1145\/3314221.3314609","DOI":"10.1145\/3314221.3314609"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Kokologiannakis, M., Ren, X., Vafeiadis, V.: Dynamic Partial Order Reductions for Spinloops. In: FMCAD 2021, pp. 163\u2013172. IEEE (2021). doi: https:\/\/doi.org\/10.34727\/2021\/isbn.978-3-85448-046-4_25","DOI":"10.34727\/2021\/isbn.978-3-85448-046-4_25"},{"key":"4_CR31","doi-asserted-by":"publisher","unstructured":"Kokologiannakis, M., Vafeiadis, V.: BAM: Efficient Model Checking for Barriers. In: NETYS 2021, LNCS, Springer, Heidelberg (2021). doi: https:\/\/doi.org\/10.1007\/978-3-030-91014-3_16","DOI":"10.1007\/978-3-030-91014-3_16"},{"key":"4_CR32","doi-asserted-by":"publisher","unstructured":"Kokologiannakis, M., Vafeiadis, V.: GenMC: A model checker for weak memory models. In: Silva, A., Leino, K.R.M. (eds.) CAV 2021, LNCS, vol. 12759, pp. 427\u2013440. Springer, Heidelberg (2021). doi: https:\/\/doi.org\/10.1007\/978-3-030-81685-8_20","DOI":"10.1007\/978-3-030-81685-8_20"},{"key":"4_CR33","doi-asserted-by":"publisher","unstructured":"Kozen, D.: Kleene Algebra with Tests. ACM Trans. Program. Lang. Syst. 19(3) (1997) doi: https:\/\/doi.org\/10.1145\/256167.256195","DOI":"10.1145\/256167.256195"},{"key":"4_CR34","doi-asserted-by":"publisher","unstructured":"Lahav, O., Giannarakis, N., Vafeiadis, V.: Taming Release-acquire Consistency. In: POPL 2016, pp. 649\u2013662. ACM, St. Petersburg, FL, USA (2016). doi: https:\/\/doi.org\/10.1145\/2837614.2837643","DOI":"10.1145\/2837614.2837643"},{"key":"4_CR35","doi-asserted-by":"publisher","unstructured":"Lahav, O., Vafeiadis, V., Kang, J., Hur, C.-K., Dreyer, D.: Repairing sequential consistency in C\/C++11. In: PLDI 2017, pp. 618\u2013632. ACM, Barcelona, Spain (2017). doi: https:\/\/doi.org\/10.1145\/3062341.3062352","DOI":"10.1145\/3062341.3062352"},{"key":"4_CR36","doi-asserted-by":"publisher","unstructured":"Lamport, L.: How to Make a Multiprocessor Computer that Correctly Executes Multiprocess Programs. IEEE Trans. Computers 28(9), 690\u2013691 (1979) doi: https:\/\/doi.org\/10.1109\/TC.1979.1675439","DOI":"10.1109\/TC.1979.1675439"},{"key":"4_CR37","unstructured":"Musuvathi, M., Qadeer, S., Ball, T., Basler, G., Nainar, P.A., Neamtiu, I.: Finding and reproducing Heisenbugs in concurrent programs. In: OSDI 2008, pp. 267\u2013280. USENIX Association (2008). url: https:\/\/www.usenix.org\/legacy\/events\/osdi08\/tech\/full_papers\/musuvathi\/musuvathi.pdf"},{"key":"4_CR38","doi-asserted-by":"publisher","unstructured":"Nguyen, H.T.T., Rodr\u00edguez, C., Sousa, M., Coti, C., Petrucci, L.: Quasi-optimal partial order reduction. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018, LNCS, vol. 10982, pp. 354\u2013371. Springer, Heidelberg (2018). doi: https:\/\/doi.org\/10.1007\/978-3-319-96142-2_22","DOI":"10.1007\/978-3-319-96142-2_22"},{"key":"4_CR39","doi-asserted-by":"publisher","unstructured":"Norris, B., Demsky, B.: CDSChecker: Checking concurrent data structures written with C\/C++ atomics. In: OOPSLA 2013, pp. 131\u2013150. ACM (2013). doi: https:\/\/doi.org\/10.1145\/2509136.2509514","DOI":"10.1145\/2509136.2509514"},{"key":"4_CR40","doi-asserted-by":"publisher","unstructured":"Podkopaev, A., Lahav, O., Vafeiadis, V.: Bridging the gap between programming languages and hardware weak memory models. Proc. ACM Program. Lang. 3(POPL), 69:1\u201369:31 (2019) doi: https:\/\/doi.org\/10.1145\/3290382","DOI":"10.1145\/3290382"},{"key":"4_CR41","doi-asserted-by":"publisher","unstructured":"Rodr\u00edguez, C., Sousa, M., Sharma, S., Kroening, D.: Unfolding-based Partial Order Reduction. In: CONCUR 2015, LIPIcs, pp. 456\u2013469. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015). doi: https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2015.456","DOI":"10.4230\/LIPIcs.CONCUR.2015.456"},{"key":"4_CR42","doi-asserted-by":"publisher","unstructured":"Wang, K., Converse, H., Gligoric, M., Misailovic, S., Khurshid, S.: A Progress Bar for the JPF Search Using Program Executions. ACM SIGSOFT Softw. Eng. Notes 43(4), 55 (2018) doi: https:\/\/doi.org\/10.1145\/3282517.3282525","DOI":"10.1145\/3282517.3282525"},{"key":"4_CR43","doi-asserted-by":"publisher","unstructured":"Zhang, N., Kusano, M., Wang, C.: Dynamic partial order reduction for relaxed memory models. In: PLDI 2015, pp. 250\u2013259. ACM, New York, NY, USA (2015). doi: https:\/\/doi.org\/10.1145\/2737924.2737956","DOI":"10.1145\/2737924.2737956"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-57249-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T07:06:06Z","timestamp":1712214366000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57249-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031572487","9783031572494"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57249-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"5 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2024\/conferences\/tacas\/","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":"159","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":"53","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":"16","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":"33% - 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":"10","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)"}}]}}