{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T09:48:05Z","timestamp":1770284885056,"version":"3.49.0"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031300431","type":"print"},{"value":"9783031300448","type":"electronic"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,4,17]],"date-time":"2023-04-17T00:00:00Z","timestamp":1681689600000},"content-version":"vor","delay-in-days":106,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Guarded Kleene Algebra with Tests (GKAT) is a fragment of Kleene Algebra with Tests (KAT) that was recently introduced to reason efficiently about imperative programs. In contrast to KAT, GKAT does not have an algebraic axiomatization, but relies on an analogue of Salomaa\u2019s axiomatization of Kleene Algebra. In this paper, we present an algebraic axiomatization and prove two completeness results for a large fragment of GKAT consisting of <jats:italic>skip-free programs<\/jats:italic>.<\/jats:p>","DOI":"10.1007\/978-3-031-30044-8_12","type":"book-chapter","created":{"date-parts":[[2023,4,16]],"date-time":"2023-04-16T20:28:25Z","timestamp":1681676905000},"page":"309-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Complete Inference System for Skip-free Guarded Kleene Algebra with Tests"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6068-880X","authenticated-orcid":false,"given":"Tobias","family":"Kapp\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9838-2363","authenticated-orcid":false,"given":"Todd","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5014-9784","authenticated-orcid":false,"given":"Alexandra","family":"Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,17]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Aceto, L.: Deriving complete inference systems for a class of GSOS languages generation regular behaviours. In: CONCUR. pp. 449\u2013464 (1994). https:\/\/doi.org\/10.1007\/978-3-540-48654-1_33","DOI":"10.1007\/978-3-540-48654-1_33"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Aceto, L., Caltais, G., Goriac, E., Ing\u00f3lfsd\u00f3ttir, A.: Axiomatizing GSOS with predicates. In: SOS. pp. 1\u201315 (2011). https:\/\/doi.org\/10.4204\/EPTCS.62.1","DOI":"10.4204\/EPTCS.62.1"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Aceto, L., Caltais, G., Goriac, E., Ing\u00f3lfsd\u00f3ttir, A.: PREG axiomatizer - A ground bisimilarity checker for GSOS with predicates. In: CALCO. pp. 378\u2013385 (2011). https:\/\/doi.org\/10.1007\/978-3-642-22944-2_27","DOI":"10.1007\/978-3-642-22944-2_27"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Anderson, C.J., Foster, N., Guha, A., Jeannin, J.B., Kozen, D., Schlesinger, C., Walker, D.: NetKAT: semantic foundations for networks. In: POPL. pp. 113\u2013126 (2014). https:\/\/doi.org\/10.1145\/2535838.2535862","DOI":"10.1145\/2535838.2535862"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Birkhoff, G.: On the structure of abstract algebras. Mathematical Proceedings of the Cambridge Philosophical Society 31(4), 433\u2013454 (1935). https:\/\/doi.org\/10.1017\/S0305004100013463","DOI":"10.1017\/S0305004100013463"},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Bloom, S.L., \u00c9sik, Z.: Iteration Theories - The Equational Logic of Iterative Processes. EATCS Monographs on Theoretical Computer Science, Springer (1993). https:\/\/doi.org\/10.1007\/978-3-642-78034-9","DOI":"10.1007\/978-3-642-78034-9"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964). https:\/\/doi.org\/10.1145\/321239.321249","DOI":"10.1145\/321239.321249"},{"key":"12_CR8","doi-asserted-by":"publisher","unstructured":"Chajed, T., Tassarotti, J., Kaashoek, M.F., Zeldovich, N.: Argosy: verifying layered storage systems with recovery refinement. In: PLDI. pp. 1054\u20131068 (2019). https:\/\/doi.org\/10.1145\/3314221.3314585","DOI":"10.1145\/3314221.3314585"},{"key":"12_CR9","unstructured":"Cohen, E.: Hypotheses in Kleene algebra. Tech. rep., Bellcore (1994)"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Cohen, E.: Weak Kleene algebra is sound and (possibly) complete for simulation (2009). https:\/\/doi.org\/10.48550\/arXiv.0910.1028","DOI":"10.48550\/arXiv.0910.1028"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Doumane, A., Kuperberg, D., Pous, D., Pradic, P.: Kleene algebra with hypotheses. In: FOSSACS. pp. 207\u2013223 (2019). https:\/\/doi.org\/10.1007\/978-3-030-17127-8_12","DOI":"10.1007\/978-3-030-17127-8_12"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Foster, N., Kozen, D., Mamouras, K., Reitblatt, M., Silva, A.: Probabilistic NetKAT. In: ESOP. pp. 282\u2013309 (2016). https:\/\/doi.org\/10.1007\/978-3-662-49498-1_12","DOI":"10.1007\/978-3-662-49498-1_12"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Foster, N., Kozen, D., Milano, M., Silva, A., Thompson, L.: A coalgebraic decision procedure for NetKAT. In: POPL. pp. 343\u2013355 (2015). https:\/\/doi.org\/10.1145\/2676726.2677011","DOI":"10.1145\/2676726.2677011"},{"key":"12_CR14","doi-asserted-by":"publisher","unstructured":"Grabmayer, C.: Milner\u2019s proof system for regular expressions modulo bisimilarity is complete: Crystallization: Near-collapsing process graph interpretations of regular expressions. In: LICS. pp. 34:1\u201334:13 (2022). https:\/\/doi.org\/10.1145\/3531130.3532430","DOI":"10.1145\/3531130.3532430"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Grabmayer, C., Fokkink, W.J.: A complete proof system for 1-free regular expressions modulo bisimilarity. In: LICS. pp. 465\u2013478 (2020). https:\/\/doi.org\/10.1145\/3373718.3394744","DOI":"10.1145\/3373718.3394744"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Greenberg, M., Beckett, R., Campbell, E.H.: Kleene algebra modulo theories: a framework for concrete KATs. In: PLDI. pp. 594\u2013608 (2022). https:\/\/doi.org\/10.1145\/3519939.3523722","DOI":"10.1145\/3519939.3523722"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Gumm, H.P.: Functors for coalgebras. Algebra Universalis 45 (11 1998). https:\/\/doi.org\/10.1007\/s00012-001-8156-x","DOI":"10.1007\/s00012-001-8156-x"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Huntington, E.V.: Sets of independent postulates for the algebra of logic. Transactions of the American Mathematical Society 5(3), 288\u2013309 (1904). https:\/\/doi.org\/10.1090\/S0002-9947-1904-1500675-4","DOI":"10.1090\/S0002-9947-1904-1500675-4"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Kapp\u00e9, T., Brunet, P., Rot, J., Silva, A., Wagemaker, J., Zanasi, F.: Kleene algebra with observations. In: CONCUR. pp. 41:1\u201341:16 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2019.41","DOI":"10.4230\/LIPIcs.CONCUR.2019.41"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Kapp\u00e9, T., Brunet, P., Silva, A., Wagemaker, J., Zanasi, F.: Concurrent Kleene algebra with observations: From hypotheses to completeness. In: FOSSACS. pp. 381\u2013400 (2020). https:\/\/doi.org\/10.1007\/978-3-030-45231-5_20","DOI":"10.1007\/978-3-030-45231-5_20"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Kapp\u00e9, T., Brunet, P., Silva, A., Zanasi, F.: Concurrent Kleene algebra: Free model and completeness. In: ESOP. pp. 856\u2013882 (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_30","DOI":"10.1007\/978-3-319-89884-1_30"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Kapp\u00e9, T., Schmid, T., Silva, A.: A complete inference system for skip-free guarded Kleene algebra with tests (2023). https:\/\/doi.org\/10.48550\/arXiv.2301.11301","DOI":"10.48550\/arXiv.2301.11301"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. Automata studies 34, 3\u201341 (1956)","DOI":"10.1515\/9781400882618-002"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Kot, L., Kozen, D.: Kleene algebra and bytecode verification. Electron. Notes Theor. Comput. Sci. 141(1), 221\u2013236 (2005). https:\/\/doi.org\/10.1016\/j.entcs.2005.02.028","DOI":"10.1016\/j.entcs.2005.02.028"},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Kozen, D.: A completeness theorem for Kleene algebras and the algebra of regular events. Inf. Comput. 110(2), 366\u2013390 (1994). https:\/\/doi.org\/10.1006\/inco.1994.1037","DOI":"10.1006\/inco.1994.1037"},{"key":"12_CR26","doi-asserted-by":"publisher","unstructured":"Kozen, D.: Kleene algebra with tests and commutativity conditions. In: TACAS. pp. 14\u201333 (1996). https:\/\/doi.org\/10.1007\/3-540-61042-1_35","DOI":"10.1007\/3-540-61042-1_35"},{"key":"12_CR27","doi-asserted-by":"publisher","unstructured":"Kozen, D., Mamouras, K.: Kleene algebra with equations. In: ICALP. pp. 280\u2013292 (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_24","DOI":"10.1007\/978-3-662-43951-7_24"},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Kozen, D., Patron, M.: Certification of compiler optimizations using Kleene algebra with tests. In: CL. pp. 568\u2013582 (2000). https:\/\/doi.org\/10.1007\/3-540-44957-4_38","DOI":"10.1007\/3-540-44957-4_38"},{"key":"12_CR29","doi-asserted-by":"publisher","unstructured":"Kozen, D., Smith, F.: Kleene algebra with tests: Completeness and decidability. In: CSL. pp. 244\u2013259 (1996). https:\/\/doi.org\/10.1007\/3-540-63172-0_43","DOI":"10.1007\/3-540-63172-0_43"},{"key":"12_CR30","doi-asserted-by":"publisher","unstructured":"Kozen, D., Tseng, W.D.: The B\u00f6hm-Jacopini theorem is false, propositionally. In: MPC. pp. 177\u2013192 (2008). https:\/\/doi.org\/10.1007\/978-3-540-70594-9_11","DOI":"10.1007\/978-3-540-70594-9_11"},{"key":"12_CR31","doi-asserted-by":"publisher","unstructured":"Laurence, M.R., Struth, G.: Completeness theorems for pomset languages and concurrent Kleene algebras (2017). https:\/\/doi.org\/10.48550\/arXiv.1705.05896","DOI":"10.48550\/arXiv.1705.05896"},{"key":"12_CR32","doi-asserted-by":"publisher","unstructured":"Makowsky, J.A.: Why Horn formulas matter in computer science: Initial structures and generic examples. J. Comput. Syst. Sci. 34(2\/3), 266\u2013292 (1987). https:\/\/doi.org\/10.1016\/0022-0000(87)90027-4","DOI":"10.1016\/0022-0000(87)90027-4"},{"key":"12_CR33","doi-asserted-by":"publisher","unstructured":"Milner, R.: A complete inference system for a class of regular behaviours. J. Comput. Syst. Sci. 28(3), 439\u2013466 (1984). https:\/\/doi.org\/10.1016\/0022-0000(84)90023-0","DOI":"10.1016\/0022-0000(84)90023-0"},{"key":"12_CR34","doi-asserted-by":"publisher","unstructured":"Pous, D., Rot, J., Wagemaker, J.: On tools for completeness of Kleene algebra with hypotheses. In: RAMICS. pp. 378\u2013395 (2021). https:\/\/doi.org\/10.1007\/978-3-030-88701-8_23","DOI":"10.1007\/978-3-030-88701-8_23"},{"key":"12_CR35","doi-asserted-by":"publisher","unstructured":"Pous, D., Wagemaker, J.: Completeness theorems for Kleene algebra with top. In: CONCUR. pp. 26:1\u201326:18 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2022.26","DOI":"10.4230\/LIPIcs.CONCUR.2022.26"},{"key":"12_CR36","unstructured":"Rees, J.: Fizz Buzz: 101 Spoken Numeracy Games. Learning Development Aids (2002)"},{"key":"12_CR37","doi-asserted-by":"publisher","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1), 3\u201380 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(00)00056-6","DOI":"10.1016\/S0304-3975(00)00056-6"},{"key":"12_CR38","doi-asserted-by":"publisher","unstructured":"Salomaa, A.: Two complete axiom systems for the algebra of regular events. J. ACM 13(1), 158\u2013169 (1966). https:\/\/doi.org\/10.1145\/321312.321326","DOI":"10.1145\/321312.321326"},{"key":"12_CR39","doi-asserted-by":"publisher","unstructured":"Schmid, T.: A (co)algebraic framework for ordered processes (2022). https:\/\/doi.org\/10.48550\/arXiv.2209.00634","DOI":"10.48550\/arXiv.2209.00634"},{"key":"12_CR40","doi-asserted-by":"publisher","unstructured":"Schmid, T., Kapp\u00e9, T., Kozen, D., Silva, A.: Guarded Kleene algebra with tests: Coequations, coinduction, and completeness. In: ICALP. pp. 142:1\u2013142:14 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2021.142","DOI":"10.4230\/LIPIcs.ICALP.2021.142"},{"key":"12_CR41","doi-asserted-by":"publisher","unstructured":"Schmid, T., Rozowski, W., Silva, A., Rot, J.: Processes parametrised by an algebraic theory. In: ICALP. pp. 132:1\u2013132:20 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2022.132","DOI":"10.4230\/LIPIcs.ICALP.2022.132"},{"key":"12_CR42","doi-asserted-by":"publisher","unstructured":"Smolka, S., Foster, N., Hsu, J., Kapp\u00e9, T., Kozen, D., Silva, A.: Guarded Kleene algebra with tests: verification of uninterpreted programs in nearly linear time. In: POPL. pp. 61:1\u201361:28 (2020). https:\/\/doi.org\/10.1145\/3371129","DOI":"10.1145\/3371129"},{"key":"12_CR43","doi-asserted-by":"publisher","unstructured":"Smolka, S., Kumar, P., Foster, N., Kozen, D., Silva, A.: Cantor meets Scott: semantic foundations for probabilistic networks. In: POPL. pp. 557\u2013571 (2017). https:\/\/doi.org\/10.1145\/3009837.3009843","DOI":"10.1145\/3009837.3009843"},{"key":"12_CR44","doi-asserted-by":"publisher","unstructured":"Smolka, S., Kumar, P., Kahn, D.M., Foster, N., Hsu, J., Kozen, D., Silva, A.: Scalable verification of probabilistic networks. In: PLDI. pp. 190\u2013203 (2019). https:\/\/doi.org\/10.1145\/3314221.3314639","DOI":"10.1145\/3314221.3314639"},{"key":"12_CR45","doi-asserted-by":"publisher","unstructured":"Takai, T., Furusawa, H.: Monodic tree Kleene algebra. In: RelMICS\/AKA. pp. 402\u2013416 (2006). https:\/\/doi.org\/10.1007\/11828563_27","DOI":"10.1007\/11828563_27"},{"key":"12_CR46","doi-asserted-by":"publisher","unstructured":"Wagemaker, J., Bonsangue, M.M., Kapp\u00e9, T., Rot, J., Silva, A.: Completeness and incompleteness of synchronous Kleene algebra. In: MPC. pp. 385\u2013413 (2019). https:\/\/doi.org\/10.1007\/978-3-030-33636-3_14","DOI":"10.1007\/978-3-030-33636-3_14"},{"key":"12_CR47","doi-asserted-by":"publisher","unstructured":"Wagemaker, J., Brunet, P., Docherty, S., Kapp\u00e9, T., Rot, J., Silva, A.: Partially observable concurrent Kleene algebra. In: CONCUR. pp. 20:1\u201320:22 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2020.20","DOI":"10.4230\/LIPIcs.CONCUR.2020.20"},{"key":"12_CR48","doi-asserted-by":"publisher","unstructured":"Zetzsche, S., Silva, A., Sammartino, M.: Guarded Kleene algebra with tests: Automata learning (2022). https:\/\/doi.org\/10.48550\/arXiv.2204.14153","DOI":"10.48550\/arXiv.2204.14153"}],"updated-by":[{"DOI":"10.1007\/978-3-031-30044-8_21","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,6,8]],"date-time":"2023-06-08T00:00:00Z","timestamp":1686182400000}}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-30044-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T09:04:38Z","timestamp":1686128678000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30044-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031300431","9783031300448"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30044-8_12","relation":{"correction":[{"id-type":"doi","id":"10.1007\/978-3-031-30044-8_21","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 April 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"8 June 2023","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":"A correction has been published.","order":4,"name":"change_details","label":"Change Details","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"22 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2023\/esop","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":"55","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":"20","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":"36% - 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":"5.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)"}}]}}