{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T10:08:11Z","timestamp":1769076491274,"version":"3.49.0"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031274800","type":"print"},{"value":"9783031274817","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:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-27481-7_17","type":"book-chapter","created":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T14:03:10Z","timestamp":1677765790000},"page":"282-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reasoning About Promises in\u00a0Weak Memory Models with\u00a0Event Structures"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2385-7512","authenticated-orcid":false,"given":"Heike","family":"Wehrheim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lara","family":"Bargmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0446-3507","authenticated-orcid":false,"given":"Brijesh","family":"Dongol","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,3]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"Alglave, J., Cousot, P.: Ogre and Pythia: an invariance proof method for weak consistency models. In: Castagna, G., Gordon, A.D. (eds.) POPL, pp. 3\u201318. ACM (2017). https:\/\/doi.org\/10.1145\/3009837.3009883","DOI":"10.1145\/3009837.3009883"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"Batty, M., Owens, S., Sarkar, S., Sewell, P., Weber, T.: Mathematizing C++ concurrency. In: Ball, T., Sagiv, M. (eds.) POPL, pp. 55\u201366. ACM (2011). https:\/\/doi.org\/10.1145\/1926385.1926394","DOI":"10.1145\/1926385.1926394"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-030-99336-8_9","volume-title":"Programming Languages and Systems","author":"EV Bila","year":"2022","unstructured":"Bila, E.V., Dongol, B., Lahav, O., Raad, A., Wickerson, J.: View-based Owicki\u2013Gries reasoning for persistent x86-TSO. In: ESOP 2022. LNCS, vol. 13240, pp. 234\u2013261. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99336-8_9"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-17660-8_52","volume-title":"TAPSOFT \u201987","author":"G Boudol","year":"1987","unstructured":"Boudol, G., Castellani, I.: On the semantics of concurrency: partial orders and transition systems. In: Ehrig, H., Kowalski, R., Levi, G., Montanari, U. (eds.) CAAP 1987. LNCS, vol. 249, pp. 123\u2013137. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-17660-8_52"},{"key":"17_CR5","doi-asserted-by":"publisher","unstructured":"Boudol, G., Castellani, I.: Flow models of distributed computations: three equivalent semantics for CCS. Inf. Comput. 114(2), 247\u2013314 (1994). https:\/\/doi.org\/10.1006\/inco.1994.1088","DOI":"10.1006\/inco.1994.1088"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Castellani, I., Zhang, G.: Parallel product of event structures. Theor. Comput. Sci. 179(1\u20132), 203\u2013215 (1997). https:\/\/doi.org\/10.1016\/S0304-3975(96)00104-1","DOI":"10.1016\/S0304-3975(96)00104-1"},{"key":"17_CR7","doi-asserted-by":"publisher","unstructured":"Chakraborty, S., Vafeiadis, V.: Grounding thin-air reads with event structures. Proc. ACM Program. Lang. 3(POPL) (2019). https:\/\/doi.org\/10.1145\/3290383","DOI":"10.1145\/3290383"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-030-92124-8_12","volume-title":"Software Engineering and Formal Methods","author":"RJ Colvin","year":"2021","unstructured":"Colvin, R.J.: Parallelized sequential composition and\u00a0hardware weak memory models. In: Calinescu, R., P\u0103s\u0103reanu, C.S. (eds.) SEFM 2021. LNCS, vol. 13085, pp. 201\u2013221. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92124-8_12"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-030-90870-6_16","volume-title":"Formal Methods","author":"N Coughlin","year":"2021","unstructured":"Coughlin, N., Winter, K., Smith, G.: Rely\/Guarantee reasoning for multicopy atomic weak memory models. In: Huisman, M., P\u0103s\u0103reanu, C., Zhan, N. (eds.) FM 2021. LNCS, vol. 13047, pp. 292\u2013310. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90870-6_16"},{"key":"17_CR10","doi-asserted-by":"publisher","unstructured":"Dalvandi, S., Doherty, S., Dongol, B., Wehrheim, H.: Owicki-Gries reasoning for C11 RAR. In: Hirschfeld, R., Pape, T. (eds.) ECOOP. LIPIcs, vol. 166, pp. 11:1\u201311:26. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2020.11","DOI":"10.4230\/LIPIcs.ECOOP.2020.11"},{"key":"17_CR11","doi-asserted-by":"publisher","unstructured":"Dalvandi, S., Dongol, B., Doherty, S., Wehrheim, H.: Integrating Owicki\u2013Gries for C11-style memory models into Isabelle\/HOL. J. Autom. Reason. 1\u201331 (2021). https:\/\/doi.org\/10.1007\/s10817-021-09610-2","DOI":"10.1007\/s10817-021-09610-2"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Doherty, S., Dalvandi, S., Dongol, B., Wehrheim, H.: Unifying operational weak memory verification: an axiomatic approach. ACM Trans. Comput. Log. 23(4), 27:1\u201327:39 (2022). https:\/\/doi.org\/10.1145\/3545117","DOI":"10.1145\/3545117"},{"key":"17_CR13","doi-asserted-by":"publisher","unstructured":"Doherty, S., Dongol, B., Wehrheim, H., Derrick, J.: Verifying C11 programs operationally. In: Hollingsworth, J.K., Keidar, I. (eds.) PPoPP, pp. 355\u2013365. ACM (2019). https:\/\/doi.org\/10.1145\/3293883.3295702","DOI":"10.1145\/3293883.3295702"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-662-49122-5_20","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"M Doko","year":"2016","unstructured":"Doko, M., Vafeiadis, V.: A program logic for C11 memory fences. In: Jobstmann, B., Leino, K.R.M. (eds.) VMCAI 2016. LNCS, vol. 9583, pp. 413\u2013430. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49122-5_20"},{"key":"17_CR15","doi-asserted-by":"publisher","unstructured":"Flur, S., et al.: Modelling the ARMv8 architecture, operationally: concurrency and ISA. In: Bod\u00edk, R., Majumdar, R. (eds.) POPL, pp. 608\u2013621. ACM (2016). https:\/\/doi.org\/10.1145\/2837614.2837615","DOI":"10.1145\/2837614.2837615"},{"key":"17_CR16","doi-asserted-by":"publisher","unstructured":"van Glabbeek, R.J., Goltz, U.: Well-behaved flow event structures for parallel composition and action refinement. Theor. Comput. Sci. 311(1\u20133), 463\u2013478 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2003.10.031","DOI":"10.1016\/j.tcs.2003.10.031"},{"issue":"10","key":"17_CR17","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"key":"17_CR18","doi-asserted-by":"publisher","unstructured":"Jagadeesan, R., Jeffrey, A., Riely, J.: Pomsets with preconditions: a simple model of relaxed memory. Proc. ACM Program. Lang. 4(OOPSLA), 194:1\u2013194:30 (2020). https:\/\/doi.org\/10.1145\/3428262","DOI":"10.1145\/3428262"},{"key":"17_CR19","doi-asserted-by":"publisher","unstructured":"Jeffrey, A., Riely, J., Batty, M., Cooksey, S., Kaysin, I., Podkopaev, A.: The leaky semicolon: compositional semantic dependencies for relaxed-memory concurrency. Proc. ACM Program. Lang. 6(POPL), 1\u201330 (2022). https:\/\/doi.org\/10.1145\/3498716","DOI":"10.1145\/3498716"},{"key":"17_CR20","doi-asserted-by":"publisher","unstructured":"Kaiser, J., Dang, H., Dreyer, D., Lahav, O., Vafeiadis, V.: Strong logic for weak memory: reasoning about release-acquire consistency in iris. In: M\u00fcller, P. (ed.) ECOOP. LIPIcs, vol. 74, pp. 17:1\u201317:29. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017). https:\/\/doi.org\/10.4230\/LIPIcs.ECOOP.2017.17","DOI":"10.4230\/LIPIcs.ECOOP.2017.17"},{"key":"17_CR21","doi-asserted-by":"publisher","unstructured":"Kang, J., Hur, C., Lahav, O., Vafeiadis, V., Dreyer, D.: A promising semantics for relaxed-memory concurrency. In: Castagna, G., Gordon, A.D. (eds.) POPL, pp. 175\u2013189. ACM (2017). https:\/\/doi.org\/10.1145\/3009837.3009850","DOI":"10.1145\/3009837.3009850"},{"key":"17_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-47666-6_25","volume-title":"Automata, Languages, and Programming","author":"O Lahav","year":"2015","unstructured":"Lahav, O., Vafeiadis, V.: Owicki-Gries reasoning for weak memory models. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 311\u2013323. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_25"},{"key":"17_CR23","doi-asserted-by":"publisher","unstructured":"Lee, S., et al.: Promising 2.0: global optimizations in relaxed memory concurrency. In: Donaldson, A.F., Torlak, E. (eds.) PLDI, pp. 362\u2013376. ACM (2020). https:\/\/doi.org\/10.1145\/3385412.3386010","DOI":"10.1145\/3385412.3386010"},{"key":"17_CR24","unstructured":"Milner, R.: Communication and Concurrency. PHI Series in computer science, Prentice Hall, Hoboken (1989)"},{"key":"17_CR25","doi-asserted-by":"publisher","unstructured":"Nienhuis, K., Memarian, K., Sewell, P.: An operational semantics for C\/C++11 concurrency. In: Visser, E., Smaragdakis, Y. (eds.) OOPSLA, pp. 111\u2013128. ACM (2016). https:\/\/doi.org\/10.1145\/2983990.2983997","DOI":"10.1145\/2983990.2983997"},{"key":"17_CR26","doi-asserted-by":"publisher","unstructured":"O\u2019Hearn, P.W.: Incorrectness logic. Proc. ACM Program. Lang. 4(POPL), 10:1\u201310:32 (2020). https:\/\/doi.org\/10.1145\/3371078","DOI":"10.1145\/3371078"},{"key":"17_CR27","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00268134","volume":"6","author":"SS Owicki","year":"1976","unstructured":"Owicki, S.S., Gries, D.: An axiomatic proof technique for parallel programs I. Acta Inf. 6, 319\u2013340 (1976)","journal-title":"Acta Inf."},{"key":"17_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-030-44914-8_22","volume-title":"Programming Languages and Systems","author":"M Paviotti","year":"2020","unstructured":"Paviotti, M., Cooksey, S., Paradis, A., Wright, D., Owens, S., Batty, M.: Modular relaxed dependencies in weak memory concurrency. In: ESOP 2020. LNCS, vol. 12075, pp. 599\u2013625. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-44914-8_22"},{"key":"17_CR29","doi-asserted-by":"publisher","unstructured":"Pulte, C., Pichon-Pharabod, J., Kang, J., Lee, S.H., Hur, C.: Promising-ARM\/RISC-V: a simpler and faster operational concurrency model. In: McKinley, K.S., Fisher, K. (eds.) PLDI, pp. 1\u201315. ACM (2019). https:\/\/doi.org\/10.1145\/3314221.3314624","DOI":"10.1145\/3314221.3314624"},{"key":"17_CR30","doi-asserted-by":"publisher","unstructured":"Raad, A., Berdine, J., Dreyer, D., O\u2019Hearn, P.W.: Concurrent incorrectness separation logic. Proc. ACM Program. Lang. 6(POPL), 1\u201329 (2022). https:\/\/doi.org\/10.1145\/3498695","DOI":"10.1145\/3498695"},{"key":"17_CR31","doi-asserted-by":"publisher","unstructured":"Raad, A., Lahav, O., Vafeiadis, V.: Persistent Owicki-Gries reasoning: a program logic for reasoning about persistent programs on Intel-x86. Proc. ACM Program. Lang. 4(OOPSLA), 151:1\u2013151:28 (2020). https:\/\/doi.org\/10.1145\/3428219","DOI":"10.1145\/3428219"},{"key":"17_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-15057-9_4","volume-title":"Verified Software: Theories, Tools, Experiments","author":"T Ridge","year":"2010","unstructured":"Ridge, T.: A rely-guarantee proof system for x86-TSO. In: Leavens, G.T., O\u2019Hearn, P., Rajamani, S.K. (eds.) VSTTE 2010. LNCS, vol. 6217, pp. 55\u201370. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15057-9_4"},{"key":"17_CR33","doi-asserted-by":"publisher","unstructured":"Sarkar, S., Sewell, P., Alglave, J., Maranget, L., Williams, D.: Understanding POWER multiprocessors. In: Hall, M.W., Padua, D.A. (eds.) PLDI, pp. 175\u2013186. ACM (2011). https:\/\/doi.org\/10.1145\/1993498.1993520","DOI":"10.1145\/1993498.1993520"},{"key":"17_CR34","doi-asserted-by":"publisher","unstructured":"Sewell, P., Sarkar, S., Owens, S., Nardelli, F.Z., Myreen, M.O.: x86-TSO: a rigorous and usable programmer\u2019s model for x86 multiprocessors. Commun. ACM 53(7), 89\u201397 (2010). https:\/\/doi.org\/10.1145\/1785414.1785443","DOI":"10.1145\/1785414.1785443"},{"key":"17_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-89884-1_13","volume-title":"Programming Languages and Systems","author":"K Svendsen","year":"2018","unstructured":"Svendsen, K., Pichon-Pharabod, J., Doko, M., Lahav, O., Vafeiadis, V.: A separation logic for a promising semantics. In: Ahmed, A. (ed.) ESOP 2018. LNCS, vol. 10801, pp. 357\u2013384. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89884-1_13"},{"key":"17_CR36","doi-asserted-by":"publisher","unstructured":"Vafeiadis, V., Narayan, C.: Relaxed separation logic: a program logic for C11 concurrency. In: Hosking, A.L., Eugster, P.T., Lopes, C.V. (eds.) OOPSLA, pp. 867\u2013884. ACM (2013). https:\/\/doi.org\/10.1145\/2509136.2509532","DOI":"10.1145\/2509136.2509532"},{"key":"17_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-24690-6_12","volume-title":"Software Engineering and Formal Methods","author":"E de Vries","year":"2011","unstructured":"de Vries, E., Koutavas, V.: Reverse hoare logic. In: Barthe, G., Pardo, A., Schneider, G. (eds.) SEFM 2011. LNCS, vol. 7041, pp. 155\u2013171. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24690-6_12"},{"key":"17_CR38","doi-asserted-by":"publisher","unstructured":"Wehrheim, H., Bargmann, L., Dongol, B.: Reasoning about promises in weak memory models with event structures (extended version) (2022). https:\/\/doi.org\/10.48550\/ARXIV.2211.16330, https:\/\/arxiv.org\/abs\/2211.16330","DOI":"10.48550\/ARXIV.2211.16330"},{"key":"17_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/BFb0013026","volume-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","author":"G Winskel","year":"1989","unstructured":"Winskel, G.: An introduction to event structures. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) REX 1988. LNCS, vol. 354, pp. 364\u2013397. Springer, Heidelberg (1989). https:\/\/doi.org\/10.1007\/BFb0013026"},{"key":"17_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-030-90870-6_13","volume-title":"Formal Methods","author":"D Wright","year":"2021","unstructured":"Wright, D., Batty, M., Dongol, B.: Owicki-Gries reasoning for C11 programs with relaxed dependencies. In: Huisman, M., P\u0103s\u0103reanu, C., Zhan, N. (eds.) FM 2021. LNCS, vol. 13047, pp. 237\u2013254. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90870-6_13"}],"container-title":["Lecture Notes in Computer Science","Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-27481-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T14:07:41Z","timestamp":1677766061000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-27481-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031274800","9783031274817"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-27481-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L\u00fcbeck","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"6 March 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 March 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fm2023.isp.uni-luebeck.de\/wordpress\/","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":"95","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":"26","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":"2","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":"27% - 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)"}},{"value":"The proceedings also include 7 short industry papers","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)"}}]}}