{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:30:47Z","timestamp":1775838647490,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030255428","type":"print"},{"value":"9783030255435","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25543-5_19","type":"book-chapter","created":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T08:03:09Z","timestamp":1562918589000},"page":"324-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Complexity of Checking Consistency for Replicated Data Types"],"prefix":"10.1007","author":[{"given":"Ranadeep","family":"Biswas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Emmi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Constantin","family":"Enea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,12]]},"reference":[{"issue":"1\u20132","key":"19_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1006\/inco.1999.2847","volume":"160","author":"R Alur","year":"2000","unstructured":"Alur, R., McMillan, K.L., Peled, D.A.: Model-checking of correctness conditions for concurrent objects. Inf. Comput. 160(1\u20132), 167\u2013188 (2000). \n                      https:\/\/doi.org\/10.1006\/inco.1999.2847","journal-title":"Inf. Comput."},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Bingham, J.D., Condon, A., Hu, A.J.: Toward a decidable notion of sequential consistency. In: Rosenberg, A.L., auf der Heide, F.M. (eds.) SPAA 2003: Proceedings of the Fifteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Diego, California, USA, (part of FCRC 2003), 7\u20139 June 2003, pp. 304\u2013313. ACM (2003). \n                      https:\/\/doi.org\/10.1145\/777412.777467","DOI":"10.1145\/777412.777467"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-540-27813-9_33","volume-title":"Computer Aided Verification","author":"J Bingham","year":"2004","unstructured":"Bingham, J., Condon, A., Hu, A.J., Qadeer, S., Zhang, Z.: Automatic verification of sequential consistency for unbounded addresses and data values. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 427\u2013439. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-27813-9_33"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-642-37036-6_17","volume-title":"Programming Languages and Systems","author":"A Bouajjani","year":"2013","unstructured":"Bouajjani, A., Emmi, M., Enea, C., Hamza, J.: Verifying concurrent programs against sequential specifications. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol. 7792, pp. 290\u2013309. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-37036-6_17"},{"issue":"Part","key":"19_CR5","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.ic.2018.02.014","volume":"261","author":"A Bouajjani","year":"2018","unstructured":"Bouajjani, A., Emmi, M., Enea, C., Hamza, J.: On reducing linearizability to state reachability. Inf. Comput. 261(Part), 383\u2013400 (2018). \n                      https:\/\/doi.org\/10.1016\/j.ic.2018.02.014","journal-title":"Inf. Comput."},{"key":"19_CR6","unstructured":"Bouajjani, A., Enea, C., Guerraoui, R., Hamza, J.: On verifying causal consistency. In: Castagna, G., Gordon, A.D. (eds.) Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, Paris, France, 18\u201320 January 2017, pp. 626\u2013638. ACM (2017). \n                      http:\/\/dl.acm.org\/citation.cfm?id=3009888"},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Bouajjani, A., Enea, C., Hamza, J.: Verifying eventual consistency of optimistic replication systems. In: Jagannathan, S., Sewell, P. (eds.) The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, San Diego, CA, USA, 20\u201321 January 2014, pp. 285\u2013296. ACM (2014). \n                      https:\/\/doi.org\/10.1145\/2535838.2535877","DOI":"10.1145\/2535838.2535877"},{"issue":"1\u20132","key":"19_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2500000011","volume":"1","author":"S Burckhardt","year":"2014","unstructured":"Burckhardt, S.: Principles of eventual consistency. Found. Trends Program. Lang. 1(1\u20132), 1\u2013150 (2014). \n                      https:\/\/doi.org\/10.1561\/2500000011","journal-title":"Found. Trends Program. Lang."},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"Burckhardt, S., Alur, R., Martin, M.M.K.: Checkfence: checking consistency of concurrent data types on relaxed memory models. In: Ferrante, J., McKinley, K.S. (eds.) Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, San Diego, California, USA, 10\u201313 June 2007, pp. 12\u201321. ACM (2007). \n                      https:\/\/doi.org\/10.1145\/1250734.1250737","DOI":"10.1145\/1250734.1250737"},{"key":"19_CR10","doi-asserted-by":"publisher","unstructured":"Burckhardt, S., Dern, C., Musuvathi, M., Tan, R.: Line-up: a complete and automatic linearizability checker. In: Zorn, B.G., Aiken, A. (eds.) Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2010, Toronto, Ontario, Canada, 5\u201310 June 2010, pp. 330\u2013340. ACM (2010). \n                      https:\/\/doi.org\/10.1145\/1806596.1806634","DOI":"10.1145\/1806596.1806634"},{"key":"19_CR11","doi-asserted-by":"publisher","unstructured":"Burckhardt, S., Gotsman, A., Yang, H., Zawirski, M.: Replicated data types: specification, verification, optimality. In: Jagannathan, S., Sewell, P. (eds.) The 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2014, San Diego, CA, USA, 20\u201321 January 2014, pp. 271\u2013284. ACM (2014). \n                      https:\/\/doi.org\/10.1145\/2535838.2535848","DOI":"10.1145\/2535838.2535848"},{"key":"19_CR12","doi-asserted-by":"publisher","unstructured":"Cohen, A., O\u2019Leary, J.W., Pnueli, A., Tuttle, M.R., Zuck, L.D.: Verifying correctness of transactional memories. In: Proceedings of the 7th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2007, Austin, Texas, USA, 11\u201314 November 2007, pp. 37\u201344. IEEE Computer Society (2007). \n                      https:\/\/doi.org\/10.1109\/FAMCAD.2007.40","DOI":"10.1109\/FAMCAD.2007.40"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-319-96145-3_26","volume-title":"Computer Aided Verification","author":"M Emmi","year":"2018","unstructured":"Emmi, M., Enea, C.: Monitoring weak consistency. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018, Part I. LNCS, vol. 10981, pp. 487\u2013506. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-96145-3_26"},{"issue":"POPL","key":"19_CR14","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/3158113","volume":"2","author":"M Emmi","year":"2018","unstructured":"Emmi, M., Enea, C.: Sound, complete, and tractable linearizability monitoring for concurrent collections. PACMPL 2(POPL), 25:1\u201325:27 (2018). \n                      https:\/\/doi.org\/10.1145\/3158113","journal-title":"PACMPL"},{"issue":"POPL","key":"19_CR15","first-page":"60:1","volume":"3","author":"M Emmi","year":"2019","unstructured":"Emmi, M., Enea, C.: Weak-consistency specification via visibility relaxation. PACMPL 3(POPL), 60:1\u201360:28 (2019). \n                      https:\/\/dl.acm.org\/citation.cfm?id=3290373","journal-title":"PACMPL"},{"key":"19_CR16","doi-asserted-by":"publisher","unstructured":"Emmi, M., Enea, C., Hamza, J.: Monitoring refinement via symbolic reasoning. In: Grove, D., Blackburn, S. (eds.) Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, Portland, OR, USA, 15\u201317 June 2015, pp. 260\u2013269. ACM (2015). \n                      https:\/\/doi.org\/10.1145\/2737924.2737983","DOI":"10.1145\/2737924.2737983"},{"key":"19_CR17","doi-asserted-by":"publisher","unstructured":"Emmi, M., Majumdar, R., Manevich, R.: Parameterized verification of transactional memories. In: Zorn, B.G., Aiken, A. (eds.) Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2010, Toronto, Ontario, Canada, 5\u201310 June 2010, pp. 134\u2013145. ACM (2010). \n                      https:\/\/doi.org\/10.1145\/1806596.1806613","DOI":"10.1145\/1806596.1806613"},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-70545-1_8","volume-title":"Computer Aided Verification","author":"A Farzan","year":"2008","unstructured":"Farzan, A., Madhusudan, P.: Monitoring atomicity in concurrent programs. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 52\u201365. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-70545-1_8"},{"key":"19_CR19","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)"},{"issue":"4","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1208","DOI":"10.1137\/S0097539794279614","volume":"26","author":"PB Gibbons","year":"1997","unstructured":"Gibbons, P.B., Korach, E.: Testing shared memories. SIAM J. Comput. 26(4), 1208\u20131244 (1997). \n                      https:\/\/doi.org\/10.1137\/S0097539794279614","journal-title":"SIAM J. Comput."},{"key":"19_CR21","doi-asserted-by":"publisher","unstructured":"Guerraoui, R., Henzinger, T.A., Jobstmann, B., Singh, V.: Model checking transactional memories. In: Gupta, R., Amarasinghe, S.P. (eds.) Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation, Tucson, AZ, USA, 7\u201313 June 2008, pp. 372\u2013382. ACM (2008). \n                      https:\/\/doi.org\/10.1145\/1375581.1375626","DOI":"10.1145\/1375581.1375626"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-319-26850-7_21","volume-title":"Networked Systems","author":"J Hamza","year":"2015","unstructured":"Hamza, J.: On the complexity of linearizability. In: Bouajjani, A., Fauconnier, H. (eds.) NETYS 2015. LNCS, vol. 9466, pp. 308\u2013321. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-26850-7_21"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-48683-6_27","volume-title":"Computer Aided Verification","author":"TA Henzinger","year":"1999","unstructured":"Henzinger, T.A., Qadeer, S., Rajamani, S.K.: Verifying sequential consistency on shared-memory multiprocessor systems. In: Halbwachs, N., Peled, D. (eds.) CAV 1999. LNCS, vol. 1633, pp. 301\u2013315. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/3-540-48683-6_27"},{"issue":"3","key":"19_CR24","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/78969.78972","volume":"12","author":"M Herlihy","year":"1990","unstructured":"Herlihy, M., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12(3), 463\u2013492 (1990). \n                      https:\/\/doi.org\/10.1145\/78969.78972","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"19_CR25","unstructured":"Kingsbury, K.: Jepsen: Distributed systems safety research (2016). \n                      https:\/\/jepsen.io"},{"issue":"7","key":"19_CR26","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978). \n                      https:\/\/doi.org\/10.1145\/359545.359563","journal-title":"Commun. ACM"},{"issue":"9","key":"19_CR27","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1109\/TC.1979.1675439","volume":"28","author":"L Lamport","year":"1979","unstructured":"Lamport, L.: How to make a multiprocessor computer that correctly executes multiprocess programs. IEEE Trans. Comput. 28(9), 690\u2013691 (1979). \n                      https:\/\/doi.org\/10.1109\/TC.1979.1675439","journal-title":"IEEE Trans. Comput."},{"key":"19_CR28","doi-asserted-by":"publisher","unstructured":"Lowe, G.: Testing for linearizability. Concurr. Comput. Pract. Exp. 29(4) (2017). \n                      https:\/\/doi.org\/10.1002\/cpe.3928","DOI":"10.1002\/cpe.3928"},{"key":"19_CR29","doi-asserted-by":"publisher","unstructured":"Manson, J., Pugh, W., Adve, S.V.: The java memory model. In: Palsberg, J., Abadi, M. (eds.) Proceedings of the 32nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2005, Long Beach, California, USA, 12\u201314 January 2005, pp. 378\u2013391. ACM (2005). \n                      https:\/\/doi.org\/10.1145\/1040305.1040336","DOI":"10.1145\/1040305.1040336"},{"issue":"4","key":"19_CR30","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1145\/322154.322158","volume":"26","author":"CH Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H.: The serializability of concurrent database updates. J. ACM 26(4), 631\u2013653 (1979). \n                      https:\/\/doi.org\/10.1145\/322154.322158","journal-title":"J. ACM"},{"issue":"8","key":"19_CR31","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1109\/TPDS.2003.1225053","volume":"14","author":"S Qadeer","year":"2003","unstructured":"Qadeer, S.: Verifying sequential consistency on shared-memory multiprocessorsby model checking. IEEE Trans. Parallel Distrib. Syst. 14(8), 730\u2013741 (2003). \n                      https:\/\/doi.org\/10.1109\/TPDS.2003.1225053","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"19_CR32","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.jpdc.2010.12.006","volume":"71","author":"H Roh","year":"2011","unstructured":"Roh, H., Jeon, M., Kim, J., Lee, J.: Replicated abstract data types: building blocks for collaborative applications. J. Parallel Distrib. Comput. 71(3), 354\u2013368 (2011). \n                      https:\/\/doi.org\/10.1016\/j.jpdc.2010.12.006","journal-title":"J. Parallel Distrib. Comput."},{"key":"19_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-642-24550-3_29","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M Shapiro","year":"2011","unstructured":"Shapiro, M., Pregui\u00e7a, N., Baquero, C., Zawirski, M.: Conflict-free replicated data types. In: D\u00e9fago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 386\u2013400. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-24550-3_29"},{"key":"19_CR34","first-page":"67","volume":"104","author":"M Shapiro","year":"2011","unstructured":"Shapiro, M., Pregui\u00e7a, N.M., Baquero, C., Zawirski, M.: Convergent and commutative replicated data types. Bull. EATCS 104, 67\u201388 (2011). \n                      http:\/\/eatcs.org\/beatcs\/index.php\/beatcs\/article\/view\/120","journal-title":"Bull. EATCS"},{"key":"19_CR35","doi-asserted-by":"publisher","unstructured":"Terry, D.B., Demers, A.J., Petersen, K., Spreitzer, M., Theimer, M., Welch, B.B.: Session guarantees for weakly consistent replicated data. In: Proceedings of the Third International Conference on Parallel and Distributed Information Systems (PDIS 1994), Austin, Texas, USA, 28\u201330 September 1994, pp. 140\u2013149. IEEE Computer Society (1994). \n                      https:\/\/doi.org\/10.1109\/PDIS.1994.331722","DOI":"10.1109\/PDIS.1994.331722"},{"key":"19_CR36","doi-asserted-by":"publisher","unstructured":"Terry, D.B., Theimer, M., Petersen, K., Demers, A.J., Spreitzer, M., Hauser, C.: Managing update conflicts in bayou, a weakly connected replicated storage system. In: Jones, M.B. (ed.) Proceedings of the Fifteenth ACM Symposium on Operating System Principles, SOSP 1995, Copper Mountain Resort, Colorado, USA, 3\u20136 December 1995, pp. 172\u2013183. ACM (1995). \n                      https:\/\/doi.org\/10.1145\/224056.224070","DOI":"10.1145\/224056.224070"},{"issue":"1\u20132","key":"19_CR37","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1006\/jpdc.1993.1015","volume":"17","author":"JM Wing","year":"1993","unstructured":"Wing, J.M., Gong, C.: Testing and verifying concurrent objects. J. Parallel Distrib. Comput. 17(1\u20132), 164\u2013182 (1993). \n                      https:\/\/doi.org\/10.1006\/jpdc.1993.1015","journal-title":"J. Parallel Distrib. Comput."},{"key":"19_CR38","doi-asserted-by":"publisher","unstructured":"Wolper, P.: Expressing interesting properties of programs in propositional temporal logic. In: Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, St. Petersburg Beach, Florida, USA, January 1986, pp. 184\u2013193. ACM Press (1986). \n                      https:\/\/doi.org\/10.1145\/512644.512661","DOI":"10.1145\/512644.512661"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25543-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T08:08:27Z","timestamp":1562918907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-25543-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030255428","9783030255435"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25543-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York City, NY","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/i-cav.org\/2019\/","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":"258","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":"67","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":"26% - 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":"9","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}