{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:59:52Z","timestamp":1742918392184,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030720186"},{"type":"electronic","value":"9783030720193"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:00:00Z","timestamp":1616457600000},"content-version":"vor","delay-in-days":81,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Compositional methods are central to the development and verification of software systems. They allow breaking down large systems into smaller components, while enabling reasoning about the behaviour of the composed system. For concurrent and communicating systems, compositional techniques based on <jats:italic>behavioural type systems<\/jats:italic> have received much attention. By abstracting communication protocols as types, these type systems can statically check that programs interact with channels according to a certain protocol, whether the intended messages are exchanged in a certain order. In this paper, we put on our coalgebraic spectacles to investigate <jats:italic>session types<\/jats:italic>, a widely studied class of behavioural type systems. We provide a syntax-free description of session-based concurrency as states of coalgebras. As a result, we rediscover type equivalence, duality, and subtyping relations in terms of canonical coinductive presentations. In turn, this coinductive presentation makes it possible to elegantly derive a decidable type system with subtyping for <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\pi $$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>\u03c0<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-calculus processes, in which the states of a coalgebra will serve as channel protocols. Going full circle, we exhibit a coalgebra structure on an existing session type system, and show that the relations and type system resulting from our coalgebraic perspective agree with the existing ones.<\/jats:p>","DOI":"10.1007\/978-3-030-72019-3_14","type":"book-chapter","created":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T14:03:10Z","timestamp":1616421790000},"page":"375-403","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Session Coalgebras: A Coalgebraic View on Session Types and Communication Protocols"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8826-9607","authenticated-orcid":false,"given":"Alex C.","family":"Keizer","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7610-8331","authenticated-orcid":false,"given":"Henning","family":"Basold","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1452-6180","authenticated-orcid":false,"given":"Jorge A.","family":"P\u00e9rez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,23]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Balzer, S., Pfenning, F.: Manifest sharing with session types. Proc. ACM Program. Lang. 1(ICFP), 37:1\u201337:29 (2017). https:\/\/doi.org\/10.1145\/3110281","DOI":"10.1145\/3110281"},{"key":"14_CR2","doi-asserted-by":"publisher","unstructured":"Balzer, S., Toninho, B., Pfenning, F.: Manifest Deadlock-Freedom for Shared Session Types. In: Proc. 28th European Symposium on Programming, ESOP 2019. pp. 611\u2013639 (2019). https:\/\/doi.org\/10.1007\/978-3-030-17184-1_22","DOI":"10.1007\/978-3-030-17184-1_22"},{"key":"14_CR3","doi-asserted-by":"publisher","unstructured":"Bernardi, G., Hennessy, M.: Using higher-order contracts to model session types. Log. Methods Comput. Sci. 12(2) (2016). https:\/\/doi.org\/10.2168\/LMCS-12(2:10)2016","DOI":"10.2168\/LMCS-12(2:10)2016"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Bravetti, M., Zavattaro, G.: Towards a unifying theory for choreography conformance and contract compliance. In: Lumpe, M., Vanderperren, W. (eds.) Software Composition - 6th International Symposium, SC@ETAPS 2007, Braga, Portugal, March 24-25, 2007, Revised Selected Papers. Lecture Notes in Computer Science, vol.\u00a04829, pp. 34\u201350. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-77351-1_4","DOI":"10.1007\/978-3-540-77351-1_4"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Caires, L., P\u00e9rez, J.A., Pfenning, F., Toninho, B.: Behavioral polymorphism and parametricity in session-based communication. In: Felleisen, M., Gardner, P. (eds.) Programming Languages and Systems - 22nd European Symposium on Programming, ESOP 2013, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2013, Rome, Italy, March 16-24, 2013. Proceedings. Lecture Notes in Computer Science, vol.\u00a07792, pp. 330\u2013349. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-37036-6_19","DOI":"10.1007\/978-3-642-37036-6_19"},{"key":"14_CR6","doi-asserted-by":"publisher","unstructured":"Carpineti, S., Castagna, G., Laneve, C., Padovani, L.: A formal account of contracts for web services. In: Bravetti, M., N\u00fa\u00f1ez, M., Zavattaro, G. (eds.) Web Services and Formal Methods, Third International Workshop, WS-FM 2006 Vienna, Austria, September 8-9, 2006, Proceedings. Lecture Notes in Computer Science, vol.\u00a04184, pp. 148\u2013162. Springer (2006). https:\/\/doi.org\/10.1007\/11841197_10","DOI":"10.1007\/11841197_10"},{"key":"14_CR7","doi-asserted-by":"publisher","unstructured":"Castagna, G., Gesbert, N., Padovani, L.: A theory of contracts for web services. ACM Trans. Program. Lang. Syst. 31(5), 19:1\u201319:61 (2009). https:\/\/doi.org\/10.1145\/1538917.1538920","DOI":"10.1145\/1538917.1538920"},{"key":"14_CR8","doi-asserted-by":"publisher","unstructured":"Coppo, M., Dezani-Ciancaglini, M., Yoshida, N., Padovani, L.: Global progress for dynamically interleaved multiparty sessions. Math. Struct. Comput. Sci. 26(2), 238\u2013302 (2016). https:\/\/doi.org\/10.1017\/S0960129514000188","DOI":"10.1017\/S0960129514000188"},{"key":"14_CR9","doi-asserted-by":"publisher","unstructured":"de Alfaro, L., Henzinger, T.A.: Interface automata. In: Tjoa, A.M., Gruhn, V. (eds.) FSE\u201901. pp. 109\u2013120. ACM (2001). https:\/\/doi.org\/10.1145\/503209.503226","DOI":"10.1145\/503209.503226"},{"key":"14_CR10","doi-asserted-by":"publisher","unstructured":"Deni\u00e9lou, P., Yoshida, N.: Multiparty session types meet communicating automata. In: Seidl, H. (ed.) Programming Languages and Systems - 21st European Symposium on Programming, ESOP 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn,Estonia, March 24 - April 1, 2012. Proceedings. Lecture Notes in Computer Science, vol.\u00a07211, pp. 194\u2013213. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-28869-2_10","DOI":"10.1007\/978-3-642-28869-2_10"},{"key":"14_CR11","doi-asserted-by":"publisher","unstructured":"Deni\u00e9lou, P., Yoshida, N.: Multiparty compatibility in communicating automata: Characterisation and synthesis of global session types. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M.Z., Peleg, D. (eds.) Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part II. Lecture Notes in Computer Science, vol.\u00a07966, pp. 174\u2013186. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-39212-2_18","DOI":"10.1007\/978-3-642-39212-2_18"},{"key":"14_CR12","doi-asserted-by":"publisher","unstructured":"Eberhart, C., Hirschowitz, T., Seiller, T.: An Intensionally Fully-abstract Sheaf Model for pi. In: CALCO\u201915. pp. 86\u2013100 (2015). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2015.86","DOI":"10.4230\/LIPIcs.CALCO.2015.86"},{"key":"14_CR13","doi-asserted-by":"publisher","unstructured":"Fournet, C., Hoare, C.A.R., Rajamani, S.K., Rehof, J.: Stuck-free conformance. In: Alur, R., Peled, D.A. (eds.) Computer Aided Verification, 16th International Conference, CAV 2004, Boston, MA, USA, July 13-17, 2004, Proceedings. Lecture Notes in Computer Science, vol.\u00a03114, pp. 242\u2013254. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-27813-9_19","DOI":"10.1007\/978-3-540-27813-9_19"},{"key":"14_CR14","doi-asserted-by":"publisher","unstructured":"Gambino, N., Kock, J.: Polynomial functors and polynomial monads. Mathematical Proceedings of the Cambridge Philosophical Society 154 (06 2009). https:\/\/doi.org\/10.1017\/S0305004112000394","DOI":"10.1017\/S0305004112000394"},{"key":"14_CR15","doi-asserted-by":"publisher","unstructured":"Garcia, R., Tanter, \u00c9., Wolff, R., Aldrich, J.: Foundations of typestate-oriented programming. ACM Trans. Program. Lang. Syst. 36(4), 12:1\u201312:44 (2014). https:\/\/doi.org\/10.1145\/2629609","DOI":"10.1145\/2629609"},{"key":"14_CR16","doi-asserted-by":"publisher","unstructured":"Gay, S.J.: Subtyping supports safe session substitution. In: Lindley, S., McBride, C., Trinder, P.W., Sannella, D. (eds.) A List of Successes That Can Change the World - Essays Dedicated to Philip Wadler on the Occasion of His 60th Birthday. Lecture Notes in Computer Science, vol.\u00a09600, pp. 95\u2013108. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-30936-1_5","DOI":"10.1007\/978-3-319-30936-1_5"},{"key":"14_CR17","doi-asserted-by":"publisher","unstructured":"Gay, S.J., Hole, M.: Subtyping for session types in the pi calculus. Acta Informatica 42(2-3), 191\u2013225 (2005). https:\/\/doi.org\/10.1007\/s00236-005-0177-z","DOI":"10.1007\/s00236-005-0177-z"},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Gay, S.J., Thiemann, P., Vasconcelos, V.T.: Duality of session types: The final cut. Electronic Proceedings in Theoretical Computer Science 314, 23\u201333 (Apr 2020). https:\/\/doi.org\/10.4204\/eptcs.314.3","DOI":"10.4204\/eptcs.314.3"},{"key":"14_CR19","doi-asserted-by":"publisher","unstructured":"Honda, K.: Types for dyadic interaction. In: Best, E. (ed.) CONCUR \u201993, 4th International Conference on Concurrency Theory, Hildesheim, Germany, August 23-26, 1993, Proceedings. Lecture Notes in Computer Science, vol.\u00a0715, pp.509\u2013523. Springer (1993). https:\/\/doi.org\/10.1007\/3-540-57208-2_35","DOI":"10.1007\/3-540-57208-2_35"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Honda, K., Vasconcelos, V.T., Kubo, M.: Language Primitives and Type Discipline for Structured Communication-Based Programming. In: Hankin, C. (ed.) ESOP\u201998. LNCS, vol.\u00a01381, pp. 122\u2013138. Springer (1998). https:\/\/doi.org\/10.1007\/BFb0053567","DOI":"10.1007\/BFb0053567"},{"key":"14_CR21","doi-asserted-by":"publisher","unstructured":"Honda, K., Yoshida, N., Carbone, M.: Multiparty asynchronous session types. In: Necula, G.C., Wadler, P. (eds.) Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2008, San Francisco, California, USA, January 7-12, 2008. pp. 273\u2013284. ACM (2008). https:\/\/doi.org\/10.1145\/1328438.1328472","DOI":"10.1145\/1328438.1328472"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Keizer, A.C., Basold, H., P\u00e9rez, J.A.: Session coalgebras: A coalgebraic view on session types and communication protocols. CoRR abs\/2011.05712 (2020), https:\/\/arxiv.org\/abs\/2011.05712","DOI":"10.26226\/morressier.604907f41a80aac83ca25d1c"},{"key":"14_CR23","doi-asserted-by":"publisher","unstructured":"Kobayashi, N.: A new type system for deadlock-free processes. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006 - Concurrency Theory, 17th International Conference, CONCUR 2006, Bonn, Germany, August 27-30, 2006, Proceedings. Lecture Notes in Computer Science, vol.\u00a04137, pp. 233\u2013247. Springer (2006). https:\/\/doi.org\/10.1007\/11817949_16","DOI":"10.1007\/11817949_16"},{"key":"14_CR24","doi-asserted-by":"publisher","unstructured":"Lindley, S., Morris, J.G.: Talking bananas: structural recursion for session types. In: Garrigue, J., Keller, G., Sumii, E. (eds.) Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP 2016, Nara, Japan, September 18-22, 2016. pp. 434\u2013447. ACM (2016). https:\/\/doi.org\/10.1145\/2951913.2951921","DOI":"10.1145\/2951913.2951921"},{"key":"14_CR25","doi-asserted-by":"publisher","unstructured":"Lozes, \u00c9., Villard, J.: Reliable contracts for unreliable half-duplex communications. In: Carbone, M., Petit, J. (eds.) Web Services and Formal Methods - 8th International Workshop, WS-FM 2011, Clermont-Ferrand, France, September 1-2, 2011, Revised Selected Papers. Lecture Notes in Computer Science, vol.\u00a07176, pp. 2\u201316. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-29834-9_2","DOI":"10.1007\/978-3-642-29834-9_2"},{"key":"14_CR26","doi-asserted-by":"publisher","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I. Inf. Comput. 100(1), 1\u201340 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90008-4","DOI":"10.1016\/0890-5401(92)90008-4"},{"key":"14_CR27","doi-asserted-by":"publisher","unstructured":"Montanari, U., Pistore, M.: Structured coalgebras and minimal HD-automata for the pi-calculus. Theor. Comput. Sci. 340(3), 539\u2013576 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.03.014","DOI":"10.1016\/j.tcs.2005.03.014"},{"key":"14_CR28","doi-asserted-by":"publisher","unstructured":"Padovani, L.: Deadlock and lock freedom in the linear $$\\pi $$-calculus. In: Henzinger, T.A., Miller, D. (eds.) Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS\u201914, Vienna, Austria, July 14 - 18, 2014. pp. 72:1\u201372:10. ACM (2014). https:\/\/doi.org\/10.1145\/2603088.2603116","DOI":"10.1145\/2603088.2603116"},{"key":"14_CR29","doi-asserted-by":"publisher","unstructured":"Padovani, L., Vasconcelos, V.T., Vieira, H.T.: Typing liveness in multiparty communicating systems. In: eva K\u00fchn, Pugliese, R. (eds.) Coordination Models and Languages - 16th IFIP WG 6.1 International Conference, COORDINATION 2014, Held as Part of the 9th International Federated Conferences on Distributed Computing Techniques, DisCoTec 2014, Berlin, Germany, June 3-5, 2014, Proceedings. Lecture Notes in Computer Science, vol.\u00a08459, pp. 147\u2013162. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-662-43376-8_10","DOI":"10.1007\/978-3-662-43376-8_10"},{"key":"14_CR30","doi-asserted-by":"publisher","unstructured":"Pous, D.: Complete Lattices and Up-To Techniques. In: Shao, Z. (ed.) APLAS\u201907. LNCS, vol.\u00a04807, pp. 351\u2013366. Springer (2007). https:\/\/doi.org\/10.1007\/978-3-540-76637-7_24","DOI":"10.1007\/978-3-540-76637-7_24"},{"key":"14_CR31","unstructured":"Sangiorgi, D., Walker, D.: The Pi-Calculus - a theory of mobile processes. Cambridge University Press (2001)"},{"key":"14_CR32","doi-asserted-by":"publisher","unstructured":"Strom, R.E., Yemini, S.: Typestate: A programming language concept for enhancing software reliability. IEEE Trans. Software Eng. 12(1), 157\u2013171 (1986). https:\/\/doi.org\/10.1109\/TSE.1986.6312929","DOI":"10.1109\/TSE.1986.6312929"},{"key":"14_CR33","doi-asserted-by":"publisher","unstructured":"Sunshine, J., Naden, K., Stork, S., Aldrich, J., Tanter, \u00c9.: First-class state change in Plaid. In: Lopes, C.V., Fisher, K. (eds.) Proceedings of the 26th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications, OOPSLA 2011, part of SPLASH 2011, Portland, OR, USA, October 22 - 27, 2011. pp. 713\u2013732. ACM (2011). https:\/\/doi.org\/10.1145\/2048066.2048122","DOI":"10.1145\/2048066.2048122"},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math. 5(2), 285\u2013309 (1955), https:\/\/projecteuclid.org:443\/euclid.pjm\/1103044538","DOI":"10.2140\/pjm.1955.5.285"},{"key":"14_CR35","doi-asserted-by":"publisher","unstructured":"Thiemann, P., Vasconcelos, V.T.: Context-free session types. In: Garrigue, J., Keller, G., Sumii, E. (eds.) Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP 2016, Nara, Japan, September 18-22, 2016. pp. 462\u2013475. ACM (2016). https:\/\/doi.org\/10.1145\/2951913.2951926","DOI":"10.1145\/2951913.2951926"},{"key":"14_CR36","doi-asserted-by":"publisher","unstructured":"Toninho, B., Yoshida, N.: Polymorphic session processes as morphisms. In: Alvim, M.S., Chatzikokolakis, K., Olarte, C., Valencia, F. (eds.) The Art of Modelling Computational Systems: A Journey from Logic and Concurrency to Security and Privacy - Essays Dedicated to Catuscia Palamidessi on the Occasion of Her 60th Birthday. Lecture Notes in Computer Science, vol. 11760, pp. 101\u2013117. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-31175-9_7","DOI":"10.1007\/978-3-030-31175-9_7"},{"key":"14_CR37","doi-asserted-by":"publisher","unstructured":"Vasconcelos, V.T.: Fundamentals of session types. Inf. Comput. 217, 52\u201370 (2012). https:\/\/doi.org\/10.1016\/j.ic.2012.05.002","DOI":"10.1016\/j.ic.2012.05.002"}],"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-030-72019-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,25]],"date-time":"2021-10-25T03:06:35Z","timestamp":1635131195000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-72019-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030720186","9783030720193"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-72019-3_14","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":"23 March 2021","order":1,"name":"first_online","label":"First Online","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":"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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 March 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 April 2021","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":"esop2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2021\/esop","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":"79","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":"24","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":"30% - 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-5","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)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic","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)"}}]}}