{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T13:16:39Z","timestamp":1742994999989,"version":"3.40.3"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030572006"},{"type":"electronic","value":"9783030572013"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-57201-3_9","type":"book-chapter","created":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:20:00Z","timestamp":1597965600000},"page":"155-179","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Categorical Approach to Secure Compilation"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8981-2328","authenticated-orcid":false,"given":"Stelios","family":"Tsampas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1571-5063","authenticated-orcid":false,"given":"Andreas","family":"Nuyts","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3862-6856","authenticated-orcid":false,"given":"Dominique","family":"Devriese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5438-153X","authenticated-orcid":false,"given":"Frank","family":"Piessens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,21]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Abadi, M.: Protection in programming-language translations. In: Secure Internet Programming, Security Issues for Mobile and Distributed Objects, pp. 19\u201334 (1999). https:\/\/doi.org\/10.1007\/3-540-48749-2_2","DOI":"10.1007\/3-540-48749-2_2"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Abate, C., et al.: Journey beyond full abstraction: exploring robust property preservation for secure compilation (2018). arXiv: 1807.04603 [cs.PL]","DOI":"10.1109\/CSF.2019.00025"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Abate, C., et al.: When good components go bad: formally secure compilation despite dynamic compromise. In: Lie, D. et al. (ed.) Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, 15\u201319 October 2018, pp. 1351\u20131368 (2018). https:\/\/doi.org\/10.1145\/3243734.3243745, ISBN: 978-1-4503-5693-0","DOI":"10.1145\/3243734.3243745"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Abbott, M.G., Altenkirch, T., Ghani, N.: Containers: constructing strictly positive types. Theor. Comput. Sci. 342(1), 3\u201327 (2005). https:\/\/doi.org\/10.1016\/j.tcs.2005.06.002","DOI":"10.1016\/j.tcs.2005.06.002"},{"key":"9_CR5","unstructured":"Abbott, M.G., et al.: For data: differentiating data structures. Fundam. Inform. 65(1-2), 1\u201328 (2005). http:\/\/content.iospress.com\/articles\/fundamenta-informaticae\/fi65-1-2-02"},{"key":"9_CR6","unstructured":"Abou-Saleh, F.: A coalgebraic semantics for imperative programming languages. PhD thesis. Imperial College London, UK (2014). http:\/\/hdl.handle.net\/10044\/1\/13693"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Abou-Saleh, F., Pattinson, D.: Towards effects in mathematical operational semantics. Electr. Notes Theor. Comput. Sci. 276, 81\u2013104 (2011). https:\/\/doi.org\/10.1016\/j.entcs.2011.09.016","DOI":"10.1016\/j.entcs.2011.09.016"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Agten, P., et al.: Secure compilation to modern processors. In: Chong, S. (ed.) 25th IEEE Computer Security Foundations Symposium, CSF 2012, Cambridge, MA, USA, 25\u201327 June 2012. IEEE Computer Society, pp. 171\u2013185 (2012). https:\/\/doi.org\/10.1109\/CSF.2012.12, ISBN: 978-1-4673-1918-8","DOI":"10.1109\/CSF.2012.12"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Ahmed, A., Blume, M.: An equivalence-preserving CPS translation via multi-language semantics. In: Chakravarty, M.M.T., Hu, Z., Danvy, O. (eds.) Proceeding of the 16th ACM SIGPLAN International Conference on Functional Programming, ICFP 2011, Tokyo, Japan, 19\u201321 September 2011, pp. 431\u2013444. ACM (2011). https:\/\/doi.org\/10.1145\/2034773.2034830, ISBN: 978-1-4503-0865-6","DOI":"10.1145\/2034773.2034830"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Ahmed, A., et al.: Secure compilation (Dagstuhl Seminar 18201). In: Ahmed, A., et al. (ed.) Dagstuhl Reports 8.5 (2018), pp. 1\u201330. ISSN: 2192\u20135283.https:\/\/doi.org\/10.4230\/DagRep.8.5.1, http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2018\/9891","DOI":"10.4230\/DagRep.8.5.1"},{"key":"9_CR11","unstructured":"Bartels, F.: On generalised coinduction and probabilistic specification formats: distributive laws in coalgebraic modelling (2004)"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Bonchi, F., et al.: Lax bialgebras and up-to techniques for weak bisimulations. In: Aceto, L., de Frutos-Escrig, D. (eds.) 26th International Conference on Concurrency Theory, CONCUR 2015, Madrid, Spain, September 1.4, 2015, vol. 42. LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp. 240\u2013253 (2015). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2015.240, ISBN: 978-3-939897-91-0","DOI":"10.4230\/LIPIcs.CONCUR.2015.240"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Brengos, T.: Weak bisimulation for coalgebras over order enriched monads. Logical Methods Comput. Sci. 11(2) (2015). https:\/\/doi.org\/10.2168\/LMCS-11(2:14)2015","DOI":"10.2168\/LMCS-11(2:14)2015"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Cockett, J.R.B.: Introduction to distributive categories. In: Math. Struct. Comput. Sci. 33, 277\u2013307 (1993) . https:\/\/doi.org\/10.1017\/S0960129500000232","DOI":"10.1017\/S0960129500000232"},{"key":"9_CR15","unstructured":"Costan, V., Devadas, S.: Intel SGX explained. In: IACR Cryptology ePrint Archive 2016 (2016), p. 86. http:\/\/eprint.iacr.org\/2016\/086"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Devriese, D., Patrignani, M., Piessens, F.: Fully-abstract compilation by approximate back-translation. In: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016, St. Petersburg, FL, USA, 20\u201322 January 2016, pp. 164\u2013177 (2016). https:\/\/doi.org\/10.1145\/2837614.2837618","DOI":"10.1145\/2837614.2837618"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Dreyer, D., Ahmed, A., Birkedal, L.: Logical step-indexed logical relations. Logical Methods Comput. Sci. 7(2) (2011). https:\/\/doi.org\/10.2168\/LMCS-7(2:16)2011","DOI":"10.2168\/LMCS-7(2:16)2011"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Fournet, C., et al.: Fully abstract compilation to JavaScript. In: The 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2013, Rome, Italy - January 23\u201325, 2013, pp. 371\u2013384 (2013). https:\/\/doi.org\/10.1145\/2429069.2429114","DOI":"10.1145\/2429069.2429114"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Groote, J.F., Vaandrager, F.W.: Structured operational semantics and bisimulation as a congruence. Inf. Comput. 100(2), 202\u2013260 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90013-6","DOI":"10.1016\/0890-5401(92)90013-6"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Hasuo, I., Jacobs, B., Sokolova, A.: Generic trace semantics via coinduction. Logical Methods Comput. Sci. 3(4) (2007). https:\/\/doi.org\/10.2168\/LMCS-3(4:11)2007","DOI":"10.2168\/LMCS-3(4:11)2007"},{"key":"9_CR21","unstructured":"Intel 64 and IA-32 Architectures Software Developer\u2019s Manual. Intel Corporation (2016). https:\/\/www.intel.com\/content\/dam\/www\/public\/us\/en\/documents\/manuals\/64-ia-32-architectures-software-developerinstruction-set-reference-manual-325383.pdf"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Jacobs, B.: Introduction to coalgebra: towards mathematics of states and observation, vol. 59. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press (2016). ISBN: 9781316823187. CBO9781316823187. https:\/\/doi.org\/10.1017\/CBO9781316823187","DOI":"10.1017\/CBO9781316823187"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Jacobs, B.: Parameters and parametrization in specification, using distributive categories. In: Fundam. Inform. 24(3), 209\u2013250 (1995). https:\/\/doi.org\/10.3233\/FI-1995-2431","DOI":"10.3233\/FI-1995-2431"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Jagadeesan, R., et al.: Local memory via layout randomization. In: Proceedings of the 24th IEEE Computer Security Foundations Symposium, CSF 2011, Cernay-la-Ville, France, 27\u201329 June 2011, pp. 161\u2013174. IEEE Computer Society, (2011). ISBN: 978-1-61284-644-6. https:\/\/doi.org\/10.1109\/CSF.2011.18","DOI":"10.1109\/CSF.2011.18"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Kennedy, A.: Securing the .NET programming model. In: Theor. Comput. Sci. 364(3), 311\u2013317 (2006). https:\/\/doi.org\/10.1016\/j.tcs.2006.08.014","DOI":"10.1016\/j.tcs.2006.08.014"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Klin, B.: Bialgebras for structural operational semantics: an introduction. Theor. Comput. Sci. 412(38), 5043\u20135069 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.03.023","DOI":"10.1016\/j.tcs.2011.03.023"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Klin, B., Nachyla, B.: Presenting morphisms of distributive laws. In: 6th Conference on Algebra and Coalgebra in Computer Science, CALCO 2015, 24\u201326 June 2015, Nijmegen, The Netherlands, pp. 190\u2013204 (2015). https:\/\/doi.org\/10.4230\/LIPIcs.CALCO.2015.190","DOI":"10.4230\/LIPIcs.CALCO.2015.190"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Lenisa, M., Power, J., Watanabe, H.: Distributivity for endofunctors, pointed and co-pointed endofunctors, monads and comonads. Electr. Notes Theor. Comput. Sci. 33, 230\u2013260 (2000). https:\/\/doi.org\/10.1016\/S1571-0661(05)80350-0","DOI":"10.1016\/S1571-0661(05)80350-0"},{"key":"9_CR29","unstructured":"Mcbride, C.: The derivative of a regular type is its type of one-hole contexts (Extended Abstract) (2001)"},{"key":"9_CR30","unstructured":"MIPS Architecture for Programmers Volume II-A: The MIPS32 Instruction Set Manual. MIPS Technologies (2016). https:\/\/s3-eu-west-1.amazonaws.com\/downloads-mips\/documents\/MD00086-2B-MIPS32BISAFP-6.06.pdf"},{"key":"9_CR31","unstructured":"Morris, J.H.: Lambda-calculus models of programming languages. PhD thesis. Massachusetts Institute of Technology (1968)"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"New, M.S., Bowman, W.J., Ahmed, A.: Fully abstract compilation via universal embedding. In: Garrigue, J., Keller, G., Sumii, E. (eds.) Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP 2016, Nara, Japan, 18\u201322 September 2016, pp. 103\u2013116. ACM (2016). ISBN: 978-1-4503-4219- 3. https:\/\/doi.org\/10.1145\/2951913.2951941","DOI":"10.1145\/2951913.2951941"},{"key":"9_CR33","doi-asserted-by":"publisher","unstructured":"Patrignani, M., Ahmed, A., Clarke, D.: Formal approaches to secure compilation: a survey of fully abstract compilation and related work. ACM Comput. Surv. 51(6), 125:1\u2013125:36 (2019). https:\/\/doi.org\/10.1145\/3280984, ISSN: 0360\u20130300","DOI":"10.1145\/3280984"},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"Patrignani, M., Clarke, D., Piessens, F.: Secure compilation of object-oriented components to protected module architectures. In: Shan, C. Programming Languages and Systems - 11th Asian Symposium, APLAS 2013, Melbourne, VIC, Australia, 9\u201311 December 2013. Proceedings, vol. 8301. Lecture Notes in Computer Science, pp. 176\u2013191. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-319-03542-0_13, ISBN: 978-3-319-03541-3","DOI":"10.1007\/978-3-319-03542-0_13"},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Patrignani, M., Devriese, D., Piessens, F.: On modular and fully-abstract compilation. In: IEEE 29th Computer Security Foundations Symposium, CSF 2016, Lisbon, Portugal, June 27 - July 1, 2016, pp. 17\u201330. IEEE Computer Society (2016). ISBN: 978-1-5090-2607-4. https:\/\/doi.org\/10.1109\/CSF.2016.9","DOI":"10.1109\/CSF.2016.9"},{"key":"9_CR36","doi-asserted-by":"publisher","unstructured":"Patrignani, M., Garg, D.: Robustly safe compilation. In: Programming Languages and Systems - 28th European Symposium on Programming, ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, 6\u201311 April 2019, Proceedings, pp. 469\u2013498 (2019). https:\/\/doi.org\/10.1007\/978-3-030-17184-1_17","DOI":"10.1007\/978-3-030-17184-1_17"},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Patrignani, M., et al.: Secure compilation to protected module architectures. ACM Trans. Program. Lang. Syst. 37(2), 6:1\u20136:50 (2015). https:\/\/doi.org\/10.1145\/2699503","DOI":"10.1145\/2699503"},{"key":"9_CR38","first-page":"17","volume":"60\u201361","author":"GD Plotkin","year":"2004","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. J. Log. Algebr. Program. 60\u201361, 17\u2013139 (2004)","journal-title":"J. Log. Algebr. Program."},{"key":"9_CR39","doi-asserted-by":"publisher","unstructured":"Popescu, A.: Weak bisimilarity coalgebraically. In: Algebra and Coalgebra in Computer Science, Third International Conference, CALCO 2009, Udine, Italy, 7\u201310 September 2009. Proceedings, pp. 157\u2013172 (2009). https:\/\/doi.org\/10.1007\/978-3-642-03741-2_12","DOI":"10.1007\/978-3-642-03741-2_12"},{"key":"9_CR40","doi-asserted-by":"publisher","unstructured":"Power, J., Watanabe, H.: Distributivity for a monad and a comonad. Electr. Notes Theor. Comput. Sci. 19, 102 (1999). https:\/\/doi.org\/10.1016\/S1571-0661(05)80271-3","DOI":"10.1016\/S1571-0661(05)80271-3"},{"key":"9_CR41","doi-asserted-by":"publisher","unstructured":"Rot, J., et al.: Enhanced coalgebraic bisimulation. Math. Struct. Comput. Sci. 27(7), 1236\u20131264 (2017). https:\/\/doi.org\/10.1017\/S0960129515000523","DOI":"10.1017\/S0960129515000523"},{"key":"9_CR42","doi-asserted-by":"publisher","unstructured":"Rothe, J., Masulovic, D.: Towards weak bisimulation for coalgebras. Electr. Notes Theor. Comput. Sci. 68(1), 32\u201346 (2002). https:\/\/doi.org\/10.1016\/S1571-0661(04)80499-7","DOI":"10.1016\/S1571-0661(04)80499-7"},{"key":"9_CR43","doi-asserted-by":"publisher","unstructured":"Rutten, J.J.M.M.: A note on coinduction and weak bisimilarity for while programs. In: ITA 33.4\/5, pp. 393\u2013400 (1999). https:\/\/doi.org\/10.1051\/ita:1999125","DOI":"10.1051\/ita:1999125"},{"key":"9_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-319-89884-1_17","volume-title":"Programming Languages and Systems","author":"L Skorstengaard","year":"2018","unstructured":"Skorstengaard, L., Devriese, D., Birkedal, L.: Reasoning about a machine with local capabilities. In: Ahmed, A. (ed.) ESOP 2018. LNCS, vol. 10801, pp. 475\u2013501. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_17"},{"key":"9_CR45","doi-asserted-by":"publisher","unstructured":"Skorstengaard, L., Devriese, D., Birkedal, L.: StkTokens: enforcing well-bracketed control flow and stack encapsulation using linear capabilities. Proc. ACM Program. Lang. 3(POPL), 19:1\u201319:28 (2019). https:\/\/doi.org\/10.1145\/3290332, ISSN: 2475\u20131421","DOI":"10.1145\/3290332"},{"key":"9_CR46","doi-asserted-by":"publisher","unstructured":"Tsampas, S., Devriese, D., Piessens, F.: Temporal safety for stack allocated memory on capability machines. In: 32nd IEEE Computer Security Foundations Symposium, CSF 2019, Hoboken, NJ, USA, 25\u201328 June 2019, pp. 243\u2013255. IEEE (2019). https:\/\/doi.org\/10.1109\/CSF.2019.00024, ISBN: 978-1-7281-1407-1","DOI":"10.1109\/CSF.2019.00024"},{"key":"9_CR47","doi-asserted-by":"publisher","unstructured":"Turi, D.: Categorical modelling of structural operational rules: case studies. In: Category Theory and Computer Science, 7th International Conference, CTCS \u201997, Santa Margherita Ligure, Italy, 4\u20136 September 1997, Proceedings, pp. 127\u2013146 (1997). https:\/\/doi.org\/10.1007\/BFb0026985","DOI":"10.1007\/BFb0026985"},{"key":"9_CR48","doi-asserted-by":"publisher","unstructured":"Turi, D., Plotkin, G.D.: Towards a mathematical operational semantics. In: Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29 - July 2, 1997, pp. 280\u2013291 (1997). https:\/\/doi.org\/10.1109\/LICS.1997.614955","DOI":"10.1109\/LICS.1997.614955"},{"key":"9_CR49","doi-asserted-by":"crossref","unstructured":"Van Strydonck, T., Piessens, F., Devriese, D.: Linear capabilities for fully abstract compilation of separation-logic-verified code. Proc. ACM Program. Lang. ICFP (2019). accepted","DOI":"10.1145\/3342538"},{"key":"9_CR50","doi-asserted-by":"publisher","unstructured":"Watanabe, H.: Well-behaved translations between structural operational semantics. Electr. Notes Theor. Comput. Sci. 65(1), 337\u2013357 (2002). https:\/\/doi.org\/10.1016\/S1571-0661(04)80372-4","DOI":"10.1016\/S1571-0661(04)80372-4"},{"key":"9_CR51","doi-asserted-by":"publisher","unstructured":"Watson, R.N.M., et al.: CHERI: a hybrid capability-system architecture for scalable software compartmentalization. In: 2015 IEEE Symposium on Security and Privacy, SP 2015, San Jose, CA, USA, 17\u201321 May 2015, pp. 20\u201337. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/SP.2015.9, ISBN: 978-1-4673-6949-7","DOI":"10.1109\/SP.2015.9"}],"container-title":["Lecture Notes in Computer Science","Coalgebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57201-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T12:37:43Z","timestamp":1724330263000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57201-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030572006","9783030572013"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57201-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"21 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CMCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Coalgebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cmcs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coalg.org\/cmcs20\/","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":"13","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":"9","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":"69% - 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-3","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":"There were several online events in September and October of 2020.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}