{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:56:05Z","timestamp":1743116165194,"version":"3.40.3"},"publisher-location":"Cham","reference-count":52,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030890506"},{"type":"electronic","value":"9783030890513"}],"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-89051-3_6","type":"book-chapter","created":{"date-parts":[[2021,10,12]],"date-time":"2021-10-12T09:30:38Z","timestamp":1634031038000},"page":"83-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Fully Abstract and Robust Compilation"],"prefix":"10.1007","author":[{"given":"Carmine","family":"Abate","sequence":"first","affiliation":[]},{"given":"Matteo","family":"Busi","sequence":"additional","affiliation":[]},{"given":"Stelios","family":"Tsampas","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,12]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M.: Protection in programming-language translations. In: Secure Internet Programming, Security Issues for Mobile and Distributed Objects, pp. 19\u201334 (1999)","DOI":"10.1007\/3-540-48749-2_2"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Abate, C., et al.: When good components go bad: formally secure compilation despite dynamic compromise. In: Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pp. 1351\u20131368 (2018)","DOI":"10.1145\/3243734.3243745"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-44914-8_1","volume-title":"Programming Languages and Systems","author":"C Abate","year":"2020","unstructured":"Abate, C., et al.: Trace-relating compiler correctness and secure compilation. In: ESOP 2020. LNCS, vol. 12075, pp. 1\u201328. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44914-8_1"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Abate, C., Blanco, R., Garg, D., Hritcu, C., Patrignani, M., Thibault, J.: Journey beyond full abstraction: exploring robust property preservation for secure compilation. In: 2019 IEEE 32nd Computer Security Foundations Symposium (CSF), pp. 256\u201325615. IEEE (2019)","DOI":"10.1109\/CSF.2019.00025"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Abate, C., Busi, M., Tsampas, S.: Fully abstract and robust compilation and how to reconcile the two, abstractly (2021)","DOI":"10.1007\/978-3-030-89051-3_6"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Abou-Saleh, F., Pattinson, D.: Towards effects in mathematical operational semantics. Electr. Notes Theor. Comput. Sci. 276, 81\u2013104 (2011)","DOI":"10.1016\/j.entcs.2011.09.016"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Aceto, L., Fokkink, W., Verhoef, C.: Structural operational semantics. In: Handbook of Process Algebra, pp. 197\u2013292. Elsevier (2001)","DOI":"10.1016\/B978-044482830-9\/50021-7"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Ahmed, A., Blume, M.: Typed closure conversion preserves observational equivalence. In: Hook, J., Thiemann, P. (eds.) Proceeding of the 13th ACM SIGPLAN International Conference on Functional Programming, ICFP 2008, Victoria, BC, Canada, 20\u201328 September 2008, pp. 157\u2013168. ACM (2008)","DOI":"10.1145\/1411203.1411227"},{"key":"6_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","DOI":"10.1145\/2034773.2034830"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Barthe, G., et al.: Formal verification of a constant-time preserving C compiler. Proc. ACM Program. Lang. 4(Popl), 1\u201330 (2019)","DOI":"10.1145\/3371075"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Barthe, G., Gr\u00e9goire, B., Laporte, V.: Secure compilation of side-channel countermeasures: the case of cryptographic \u201cconstant-time\u201d. In: 2018 IEEE 31st Computer Security Foundations Symposium (CSF), pp. 328\u2013343. IEEE (2018)","DOI":"10.1109\/CSF.2018.00031"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Besson, F., Blazy, S., Wilke, P.: A verified compcert front-end for a memory model supporting pointer arithmetic and uninitialised data. J. Autom. Reason. 62(4), 433\u2013480 (2019)","DOI":"10.1007\/s10817-017-9439-z"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Bowman, W.J., Ahmed, A.: Noninterference for free. ACM SIGPLAN Not. 50(9), 101\u2013113 (2015)","DOI":"10.1145\/2858949.2784733"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Busi, M., et al.: Provably secure isolation for interruptible enclaved execution on small microprocessors. In: 33rd IEEE Computer Security Foundations Symposium (CSF 2020) (2020)","DOI":"10.1109\/CSF49147.2020.00026"},{"issue":"6","key":"6_CR15","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","volume":"18","author":"MR Clarkson","year":"2010","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. J. Comput. Secur. 18(6), 1157\u20131210 (2010)","journal-title":"J. Comput. Secur."},{"key":"6_CR16","doi-asserted-by":"crossref","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, pp. 164\u2013177 (2016)","DOI":"10.1145\/2837614.2837618"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"D\u2019Silva, V., Payer, M., Song, D.X.: The correctness-security gap in compiler optimization. In: 2015 IEEE Symposium on Security and Privacy Workshops, SPW 2015, San Jose, CA, USA, 21\u201322 May 2015, pp. 73\u201387 (2015)","DOI":"10.1109\/SPW.2015.33"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"Durumeric, Z., et al.: The matter of heartbleed. In: Proceedings of the 2014 Conference on Internet Measurement Conference, pp. 475\u2013488 (2014)","DOI":"10.1145\/2663716.2663755"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"El-Korashy, A., Tsampas, S., Patrignani, M., Devriese, D., Garg, D., Piessens, F.: CapablePtrs: securely compiling partial programs using the pointers-as-capabilities principle. CoRR abs\/2005.05944 (2020)","DOI":"10.1109\/CSF51468.2021.00036"},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0304-3975(85)90028-3","volume":"36","author":"J Engelfriet","year":"1985","unstructured":"Engelfriet, J.: Determinacy - (observation equivalence = trace equivalence). Theor. Comput. Sci. 36(1), 21\u201325 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"6_CR21","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1017\/S0960129514000279","volume":"26","author":"D Gorla","year":"2016","unstructured":"Gorla, D., Nestmann, U.: Full abstraction for expressiveness: history, myths and facts. Math. Struct. Comput. Sci. 26(4), 639\u2013654 (2016)","journal-title":"Math. Struct. Comput. Sci."},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Jacobs, B.: Introduction to Coalgebra: Towards Mathematics of States and Observation, Cambridge Tracts in Theoretical Computer Science, vol. 59. Cambridge University Press (2016). ISBN 9781316823187","DOI":"10.1017\/CBO9781316823187"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Jacobs, K., Timany, A., Devriese, D.: Fully abstract from static to gradual. Proc. ACM Program. Lang. 5(Popl), 1\u201330 (2021)","DOI":"10.1145\/3434288"},{"issue":"38","key":"6_CR24","doi-asserted-by":"publisher","first-page":"5043","DOI":"10.1016\/j.tcs.2011.03.023","volume":"412","author":"B Klin","year":"2011","unstructured":"Klin, B.: Bialgebras for structural operational semantics: an introduction. Theoret. Comput. Sci. 412(38), 5043\u20135069 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-540-78499-9_30","volume-title":"Foundations of Software Science and Computational Structures","author":"B Klin","year":"2008","unstructured":"Klin, B., Sassone, V.: Structural operational semantics for stochastic process calculi. In: Amadio, R. (ed.) FoSSaCS 2008. LNCS, vol. 4962, pp. 428\u2013442. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78499-9_30"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Leroy, X.: Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In: Morrisett, J.G., Jones, S.L.P. (eds.) Proceedings of the 33rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2006, Charleston, South Carolina, USA, 11\u201313 January 2006, pp. 42\u201354. ACM (2006)","DOI":"10.1145\/1111320.1111042"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-17162-2_130","volume-title":"Category Theory and Computer Programming","author":"A Melton","year":"1986","unstructured":"Melton, A., Schmidt, D.A., Strecker, G.E.: Galois connections and computer science applications. In: Pitt, D., Abramsky, S., Poign\u00e9, A., Rydeheard, D. (eds.) Category Theory and Computer Programming. LNCS, vol. 240, pp. 299\u2013312. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-17162-2_130"},{"issue":"2","key":"6_CR28","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0167-6423(93)90004-9","volume":"21","author":"JC Mitchell","year":"1993","unstructured":"Mitchell, J.C.: On abstraction and the expressive power of programming languages. Sci. Comput. Program. 21(2), 141\u2013163 (1993)","journal-title":"Sci. Comput. Program."},{"key":"6_CR29","doi-asserted-by":"crossref","unstructured":"Morris, F.L.: Advice on structuring compilers and proving them correct. In: Proceedings of the 1st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 144\u2013152 (1973)","DOI":"10.1145\/512927.512941"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Murray, T., Sison, R., Pierzchalski, E., Rizkallah, C.: Compositional verification and refinement of concurrent value-dependent noninterference. In: 2016 IEEE 29th Computer Security Foundations Symposium (CSF), pp. 417\u2013431. IEEE (2016)","DOI":"10.1109\/CSF.2016.36"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"Nielson, H.R., Nielson, F.: Semantics with Applications: An Appetizer. Undergraduate Topics in Computer Science. Springer. London (2007). https:\/\/doi.org\/10.1007\/978-1-84628-692-6. ISBN 978-1-84628-691-9","DOI":"10.1007\/978-1-84628-692-6"},{"issue":"4","key":"6_CR32","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1017\/S0960129514000280","volume":"26","author":"J Parrow","year":"2016","unstructured":"Parrow, J.: General conditions for full abstraction. Math. Struct. Comput. Sci. 26(4), 655\u2013657 (2016)","journal-title":"Math. Struct. Comput. Sci."},{"key":"6_CR33","unstructured":"Patrignani, M.: Why should anyone use colours? Or, syntax highlighting beyond code snippets. CoRR abs\/2001.11334 (2020)"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Patrignani, M., Agten, P., Strackx, R., Jacobs, B., Clarke, D., Piessens, F.: Secure compilation to protected module architectures. ACM Trans. Program. Lang. Syst. 37(2), 6:1\u20136:50 (2015)","DOI":"10.1145\/2699503"},{"key":"6_CR35","doi-asserted-by":"crossref","unstructured":"Patrignani, M., Ahmed, A., Clarke, D.: Formal approaches to secure compilation: a survey of fully abstract compilation and related work. ACM Comput. Surv. (CSUR) 51(6), 1\u201336 (2019)","DOI":"10.1145\/3280984"},{"key":"6_CR36","first-page":"22","volume":"42","author":"M Patrignani","year":"2015","unstructured":"Patrignani, M., Clarke, D.: Fully abstract trace semantics for protected module architectures. Comput. Lang. Syst. Struct. 42, 22\u201345 (2015)","journal-title":"Comput. Lang. Syst. Struct."},{"key":"6_CR37","doi-asserted-by":"crossref","unstructured":"Patrignani, M., Garg, D.: Secure compilation and hyperproperty preservation. In: 2017 IEEE 30th Computer Security Foundations Symposium (CSF), pp. 392\u2013404. IEEE (2017)","DOI":"10.1109\/CSF.2017.13"},{"key":"6_CR38","doi-asserted-by":"crossref","unstructured":"Patrignani, M., Martin, E.M., Devriese, D.: On the semantic expressiveness of recursive types. Proc. ACM Program. Lang. 5(Popl), 1\u201329 (2021)","DOI":"10.1145\/3434302"},{"key":"6_CR39","doi-asserted-by":"crossref","unstructured":"Piessens, F.: Security across abstraction layers: old and new examples. In: 2020 IEEE European Symposium on Security and Privacy Workshops (EuroS&PW), pp. 271\u2013279. IEEE (2020)","DOI":"10.1109\/EuroSPW51379.2020.00043"},{"issue":"3","key":"6_CR40","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"GD Plotkin","year":"1977","unstructured":"Plotkin, G.D.: LCF considered as a programming language. Theoret. Comput. Sci. 5(3), 223\u2013255 (1977)","journal-title":"Theoret. Comput. Sci."},{"key":"6_CR41","unstructured":"Plotkin, G.D.: A structural approach to operational semantics. Aarhus university (1981)"},{"issue":"6","key":"6_CR42","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1145\/267959.269968","volume":"19","author":"A Sabry","year":"1997","unstructured":"Sabry, A., Wadler, P.: A reflection on call-by-value. ACM Trans. Program. Lang. Syst. (TOPLAS) 19(6), 916\u2013941 (1997)","journal-title":"ACM Trans. Program. Lang. Syst. (TOPLAS)"},{"key":"6_CR43","doi-asserted-by":"crossref","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)","DOI":"10.1145\/3290332"},{"key":"6_CR44","doi-asserted-by":"crossref","unstructured":"Stewart, G., Beringer, L., Cuellar, S., Appel, A.W.: Compositional compcert. In: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 275\u2013287 (2015)","DOI":"10.1145\/2676726.2676985"},{"key":"6_CR45","doi-asserted-by":"crossref","unstructured":"Strydonck, T.V., Piessens, F., Devriese, D.: Linear capabilities for fully abstract compilation of separation-logic-verified code. Proc. ACM Program. Lang. 3(ICFP), 84:1\u201384:29 (2019)","DOI":"10.1145\/3341688"},{"key":"6_CR46","doi-asserted-by":"crossref","unstructured":"Tan, Y.K., Myreen, M.O., Kumar, R., Fox, A., Owens, S., Norrish, M.: The verified cakeML compiler backend. J. Func. Program. 29 (2019)","DOI":"10.1017\/S0956796818000229"},{"key":"6_CR47","unstructured":"Thibault, J., Hritcu, C.: Nanopass back-translation of multiple traces for secure compilation proofs. In: 5th Workshop on Principles of Secure Compilation, PriSC 2021, Virtual Event, 17 January 2021 (2021). http:\/\/perso.eleves.ens-rennes.fr\/people\/Jeremy.Thibault\/prisc2021.pdf"},{"key":"6_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-030-57201-3_9","volume-title":"Coalgebraic Methods in Computer Science","author":"S Tsampas","year":"2020","unstructured":"Tsampas, S., Nuyts, A., Devriese, D., Piessens, F.: A categorical approach to secure compilation. In: Petri\u015fan, D., Rot, J. (eds.) CMCS 2020. LNCS, vol. 12094, pp. 155\u2013179. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-57201-3_9"},{"key":"6_CR49","doi-asserted-by":"crossref","unstructured":"Turi, D.: Categorical modelling of structural operational rules: case studies. In: Category Theory and Computer Science, 7th International Conference, CTCS 1997, Santa Margherita Ligure, Italy, 4\u20136 September 1997, Proceedings, pp. 127\u2013146 (1997)","DOI":"10.1007\/BFb0026985"},{"key":"6_CR50","unstructured":"Turi, D., Plotkin, G.: Towards a mathematical operational semantics. In: Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp. 280\u2013291. IEEE (1997)"},{"issue":"1","key":"6_CR51","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S1571-0661(04)80372-4","volume":"65","author":"H Watanabe","year":"2002","unstructured":"Watanabe, H.: Well-behaved translations between structural operational semantics. Electr. Notes Theoret. Comput. Sci. 65(1), 337\u2013357 (2002)","journal-title":"Electr. Notes Theoret. Comput. Sci."},{"key":"6_CR52","doi-asserted-by":"crossref","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. DAIMI Rep. Ser. 22(463) (1993)","DOI":"10.7146\/dpb.v22i463.6936"}],"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-89051-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T20:58:32Z","timestamp":1673470712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-89051-3_6"}},"subtitle":["And How to Reconcile the Two, Abstractly"],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030890506","9783030890513"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-89051-3_6","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":"12 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APLAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asian Symposium on Programming Languages and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chicago, IL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"17 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aplas2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/aplas-2021","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":"HotCrp","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","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":"17","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":"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)"}}]}}