{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:47:49Z","timestamp":1742986069983,"version":"3.40.3"},"publisher-location":"Cham","reference-count":70,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030451899"},{"type":"electronic","value":"9783030451905"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-45190-5_7","type":"book-chapter","created":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T09:03:02Z","timestamp":1587114182000},"page":"115-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Study of Symmetry Breaking Predicates and Model Counting"],"prefix":"10.1007","author":[{"given":"Wenxi","family":"Wang","sequence":"first","affiliation":[]},{"given":"Muhammad","family":"Usman","sequence":"additional","affiliation":[]},{"given":"Alyas","family":"Almaawi","sequence":"additional","affiliation":[]},{"given":"Kaiyuan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Kuldeep S.","family":"Meel","sequence":"additional","affiliation":[]},{"given":"Sarfraz","family":"Khurshid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,17]]},"reference":[{"key":"7_CR1","unstructured":"Alloy GitHub repository, 2019. https:\/\/github.com\/AlloyTools\/org.alloytools.alloy ."},{"key":"7_CR2","unstructured":"Alloy models repository, 2019. https:\/\/github.com\/AlloyTools\/models ."},{"key":"7_CR3","unstructured":"BreakID BitBucket repository, 2019. https:\/\/bitbucket.org\/krr\/breakid\/src\/master\/ ."},{"key":"7_CR4","unstructured":"Kodkod examples repository, 2019. https:\/\/github.com\/emina\/kodkod\/tree\/master\/examples ."},{"key":"7_CR5","unstructured":"Kodkod GitHub repository, 2019. https:\/\/github.com\/emina\/kodkod ."},{"key":"7_CR6","unstructured":"The on-line encyclopedia of integer sequences, 2019. https:\/\/oeis.org\/ ."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Alyas Almaawi, Nima Dini, Cagdas Yelen, Milos Gligoric, Sasa Misailovic, and Sarfraz Khurshid. Predictive constraint solving and analysis. In International Conference on Software Engineering, New Ideas and Emerging Results (ICSE-NIER), 2020. To appear.","DOI":"10.1145\/3377816.3381740"},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Fadi\u00a0A. Aloul, Igor\u00a0L. Markov, and Karem\u00a0A. Sakallah. Shatter: Efficient symmetry-breaking for boolean satisfiability. In 40th Annual Design Automation Conference, pages 836\u2013839, 2003.","DOI":"10.1145\/775832.776042"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Abdulbaki Aydin, Lucas Bang, and Tevfik Bultan. Automata-based model counting for string constraints. In CAV (1), volume 9206 of Lecture Notes in Computer Science, pages 255\u2013272, 2015.","DOI":"10.1007\/978-3-319-21690-4_15"},{"key":"7_CR10","unstructured":"Rehan\u00a0Abdul Aziz, Geoffrey Chu, Christian\u00a0J. Muise, and Peter\u00a0J. Stuckey. Projected model counting. CoRR, abs\/1507.07648, 2015."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Hamid Bagheri, Eunsuk Kang, Sam Malek, and Daniel Jackson. A formal approach for detection of security flaws in the android permission system. Formal Asp. Comput., 30(5):525\u2013544, 2018.","DOI":"10.1007\/s00165-017-0445-z"},{"key":"7_CR12","unstructured":"Roberto\u00a0J. Bayardo, Jr., and J.\u00a0D. Pehoushek. Counting models using connected components. In In AAAI, pages 157\u2013162, 2000."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Mateus Borges, Antonio Filieri, Marcelo d\u2019Amorim, Corina\u00a0S. P\u0103s\u0103reanu, and Willem Visser. Compositional solution space quantification for probabilistic software analysis. SIGPLAN Not., 49(6):123\u2013132, June 2014.","DOI":"10.1145\/2666356.2594329"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Chandrasekhar Boyapati, Sarfraz Khurshid, and Darko Marinov. Korat: Automated testing based on Java predicates. In ISSTA, pages 123\u2013133, 2002.","DOI":"10.1145\/566171.566191"},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Supratik Chakraborty, Kuldeep\u00a0S. Meel, Rakesh Mistry, and Moshe\u00a0Y. Vardi. Approximate probabilistic inference via word-level counting. In Proc. of AAAI, 2016.","DOI":"10.1609\/aaai.v30i1.10416"},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Supratik Chakraborty, Kuldeep\u00a0S. Meel, and Moshe\u00a0Y. Vardi. A scalable approximate model counter. In Proc. of CP, pages 200\u2013216, 2013.","DOI":"10.1007\/978-3-642-40627-0_18"},{"key":"7_CR17","unstructured":"Supratik Chakraborty, Kuldeep\u00a0S. Meel, and Moshe\u00a0Y. Vardi. Algorithmic improvements in approximate counting for probabilistic inference: From linear to logarithmic SAT calls. In Proc. of IJCAI, 2016."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Nathan Chong, Tyler Sorensen, and John Wickerson. The semantics of transactions and weak memory in x86, Power, ARM, and C++. SIGPLAN Not., 53(4):211\u2013225, 2018.","DOI":"10.1145\/3296979.3192373"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"David Clark, Sebastian Hunt, and Pasquale Malacaria. Quantitative analysis of the leakage of confidential data. Electr. Notes Theor. Comput. Sci., 59(3):238\u2013251, 2001.","DOI":"10.1016\/S1571-0661(04)00290-7"},{"key":"7_CR20","unstructured":"James Crawford. A theoretical analysis of reasoning by symmetry in first-order logic (extended abstract). In Workshop notes, AAAI-92 workshop on tractable reasoning, 1992."},{"key":"7_CR21","unstructured":"James Crawford, Matthew Ginsberg, Eugene Luks, and Amitabha Roy. Symmetry-breaking predicates for search problems. KR, 96:148\u2013159, 1996."},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Adnan Darwiche and Pierre Marquis. A knowledge compilation map. J. Artif. Int. Res., 17(1):229\u2013264, September 2002.","DOI":"10.1613\/jair.989"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Jo\u00a0Devriendt, Bart Bogaerts, Maurice Bruynooghe, and Marc Denecker. Improved static symmetry breaking for SAT. In TACAS, pages 104\u2013122, 2016.","DOI":"10.1007\/978-3-319-40970-2_8"},{"key":"7_CR24","unstructured":"Jeffrey Dudek, Kuldeep\u00a0S. Meel, and Moshe\u00a0Y. Vardi. Combining the k-cnf and xor phase-transitions. In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI), 7 2016."},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson. An extensible SAT-solver. In Enrico Giunchiglia and Armando Tacchella, editors, Theory and Applications of Satisfiability Testing, pages 502\u2013518, 2004.","DOI":"10.1007\/978-3-540-24605-3_37"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Antonio Filieri, Corina\u00a0S. P\u0103s\u0103reanu, and Willem Visser. Reliability analysis in symbolic pathfinder. In International Conference on Software Engineering, pages 622\u2013631, 2013.","DOI":"10.1109\/ICSE.2013.6606608"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"J.\u00a0P. Galeotti, N.\u00a0Rosner, C.\u00a0G.\u00a0L\u00f3pez Pombo, and M.\u00a0F. Frias. Taco: Efficient SAT-based bounded verification using symmetry breaking and tight bounds. Transactions on Software Engineering, 2013.","DOI":"10.1109\/TSE.2013.15"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Jaco Geldenhuys, Matthew\u00a0B. Dwyer, and Willem Visser. Probabilistic symbolic execution. In International Symposium on Software Testing and Analysis, pages 166\u2013176, 2012.","DOI":"10.1145\/2338965.2336773"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Ian\u00a0P. Gent, Karen\u00a0E. Petrie, and Jean-Fran\u00e7ois Puget. Symmetry in constraint programming. In Handbook of Constraint Programming, pages 329\u2013376. 2006.","DOI":"10.1016\/S1574-6526(06)80014-3"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Carla\u00a0P. Gomes, J\u00f6rg Hoffmann, Ashish Sabharwal, and Bart Selman. Short XORs for model counting: From theory to practice. In Theory and Applications of Satisfiability Testing (SAT), pages 100\u2013106, 2007.","DOI":"10.1007\/978-3-540-72788-0_13"},{"key":"7_CR31","unstructured":"Carla\u00a0P. Gomes, Ashish Sabharwal, and Bart Selman. Model counting: A new strategy for obtaining good bounds. In 21st National Conference on Artificial Intelligence - Volume 1, pages 54\u201361, 2006."},{"key":"7_CR32","doi-asserted-by":"crossref","unstructured":"Divya Gopinath, Muhammad\u00a0Zubair Malik, and Sarfraz Khurshid. Specification-based program repair using SAT. In TACAS, pages 173\u2013188, 2011.","DOI":"10.1007\/978-3-642-19835-9_15"},{"key":"7_CR33","unstructured":"Jinbo Huang and Adnan Darwiche. Dpll with a trace: From sat to knowledge compilation. In IJCAI, volume\u00a05, pages 156\u2013162, 2005."},{"key":"7_CR34","unstructured":"Daniel Jackson. Software Abstractions: Logic, Language, and Analysis. The MIT Press, 2006."},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Daniel Jackson and Kevin\u00a0J. Sullivan. COM revisited: Tool-assisted modelling of an architectural framework. In SIGSOFT FSE, pages 149\u2013158, 2000.","DOI":"10.1145\/357474.355065"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Daniel Jackson and Mandana Vaziri. Finding bugs with a constraint solver. In ISSTA, August 2000.","DOI":"10.1145\/347324.383378"},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Sarfraz Khurshid and Daniel Jackson. Exploring the design of an intentional naming scheme with an automatic constraint analyzer. In ASE, pages 13\u201322, 2000.","DOI":"10.1109\/ASE.2000.873646"},{"key":"7_CR38","doi-asserted-by":"crossref","unstructured":"Sarfraz Khurshid, Darko Marinov, Ilya Shlyakhter, and Daniel Jackson. A case for efficient solution enumeration. In SAT, pages 272\u2013286, 2003.","DOI":"10.1007\/978-3-540-24605-3_21"},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Seonmo Kim and Stephen McCamant. Bit-vector model counting using statistical estimation. In TACAS (1), pages 133\u2013151, 2018.","DOI":"10.1007\/978-3-319-89960-2_8"},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"Jean-Marie Lagniez and Pierre Marquis. A recursive algorithm for projected model counting. AAAI, 33:1536\u20131543, 2019.","DOI":"10.1609\/aaai.v33i01.33011536"},{"key":"7_CR41","doi-asserted-by":"crossref","unstructured":"Loi Luu, Shweta Shinde, Prateek Saxena, and Brian Demsky. A model counter for constraints over unbounded strings. SIGPLAN Not., 49(6):565\u2013576, June 2014.","DOI":"10.1145\/2666356.2594331"},{"key":"7_CR42","unstructured":"Darko Marinov and Sarfraz Khurshid. TestEra: A novel framework for automated testing of Java programs. In ASE, 2001."},{"key":"7_CR43","doi-asserted-by":"crossref","unstructured":"Hakan Metin, Souheib Baarir, Maximilien Colange, and Fabrice Kordon. Cdclsym: Introducing effective symmetry breaking in sat solving. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pages 99\u2013114. Springer, 2018.","DOI":"10.1007\/978-3-319-89960-2_6"},{"key":"7_CR44","unstructured":"Quoc-Sang Phan and Pasquale Malacaria. Abstract model counting: a novel approach for quantification of information leaks. In 9th ACM Symposium on Information, Computer and Communications Security, pages 283\u2013292, 2014."},{"key":"7_CR45","unstructured":"Stuart Russell and Peter Norvig. Artificial Intelligence: A Modern Approach. Prentice Hall Press, 2009."},{"key":"7_CR46","unstructured":"Karem Sakallah. Symmetry and satisfiability. Frontiers in Artificial Intelligence and Applications, 185, 012009."},{"key":"7_CR47","doi-asserted-by":"crossref","unstructured":"Marko Samer and Stefan Szeider. Algorithms for propositional model counting. Journal of Discrete Algorithms, 8(1):50\u201364, 2010.","DOI":"10.1016\/j.jda.2009.06.002"},{"key":"7_CR48","doi-asserted-by":"crossref","unstructured":"Hesam Samimi, Ei\u00a0Darli Aung, and Todd\u00a0D. Millstein. Falling back on executable specifications. In ECOOP, pages 552\u2013576, 2010.","DOI":"10.1007\/978-3-642-14107-2_26"},{"key":"7_CR49","unstructured":"Tian Sang, Fahiem Bacchus, Paul Beame, Henry\u00a0A. Kautz, and Toniann Pitassi. Combining component caching and clause learning for effective model counting. In SAT, 2004."},{"key":"7_CR50","doi-asserted-by":"crossref","unstructured":"Shubham Sharma, Subhajit Roy, Mate Soos, and Kuldeep\u00a0S. Meel. GANAK: A scalable probabilistic exact model counter. In IJCAI, pages 1169\u20131176, 2019.","DOI":"10.24963\/ijcai.2019\/163"},{"key":"7_CR51","doi-asserted-by":"crossref","unstructured":"Ilya Shlyakhter. Generating effective symmetry-breaking predicates for search problems. In Proc. Workshop on Theory and Applications of Satisfiability Testing, June 2001.","DOI":"10.1016\/S1571-0653(04)00311-7"},{"key":"7_CR52","doi-asserted-by":"crossref","unstructured":"Mate Soos and Kuldeep\u00a0S. Meel. Bird: Engineering an efficient cnf-xor sat solver and its applications to approximate model counting. In Proceedings of AAAI Conference on Artificial Intelligence (AAAI), 1 2019.","DOI":"10.1609\/aaai.v33i01.33011592"},{"key":"7_CR53","doi-asserted-by":"crossref","unstructured":"Mate Soos, Karsten Nohl, and Claude Castelluccia. Extending SAT solvers to cryptographic problems. In Theory and Applications of Satisfiability Testing (SAT), pages 244\u2013257, 2009.","DOI":"10.1007\/978-3-642-02777-2_24"},{"key":"7_CR54","doi-asserted-by":"crossref","unstructured":"Larry Stockmeyer. The complexity of approximate counting. In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, STOC \u201983, pages 118\u2013126, New York, NY, USA, 1983. ACM.","DOI":"10.1145\/800061.808740"},{"key":"7_CR55","doi-asserted-by":"crossref","unstructured":"Allison Sullivan, Kaiyuan Wang, Razieh\u00a0Nokhbeh Zaeem, and Sarfraz Khurshid. Automated test generation and mutation testing for Alloy. In ICST, 2017.","DOI":"10.1109\/ICST.2017.31"},{"key":"7_CR56","doi-asserted-by":"crossref","unstructured":"Marc Thurley. SharpSAT \u2013 Counting models with advanced component caching and implicit BCP. In Armin Biere and Carla\u00a0P. Gomes, editors, Theory and Applications of Satisfiability Testing - SAT 2006, pages 424\u2013429, Berlin, Heidelberg, 2006. Springer Berlin Heidelberg.","DOI":"10.1007\/11814948_38"},{"key":"7_CR57","unstructured":"Emina Torlak. A Constraint Solver for Software Engineering: Finding Models and Cores of Large Relational Specifications. PhD thesis, Cambridge, MA, USA, 2009. AAI0821754."},{"key":"7_CR58","unstructured":"Emina Torlak and Daniel Jackson. Kodkod: A relational model finder. In TACAS, 2007."},{"key":"7_CR59","doi-asserted-by":"crossref","unstructured":"Caroline Trippel, Daniel Lustig, and Margaret Martonosi. CheckMate: Automated synthesis of hardware exploits and security litmus tests. In MICRO, 2018.","DOI":"10.1109\/MICRO.2018.00081"},{"key":"7_CR60","doi-asserted-by":"crossref","unstructured":"G.\u00a0S. Tseitin. On the Complexity of Derivation in Propositional Calculus, pages 466\u2013483. 1983.","DOI":"10.1007\/978-3-642-81955-1_28"},{"key":"7_CR61","doi-asserted-by":"crossref","unstructured":"Alasdair Urquhart. The symmetry rule in propositional logic. Discrete Applied Mathematics, 96-97:177 \u2013 193, 1999.","DOI":"10.1016\/S0166-218X(99)00039-6"},{"key":"7_CR62","doi-asserted-by":"crossref","unstructured":"Muhammad Usman, Wenxi Wang, and Sarfraz Khurshid. TestMC: A framework for testing model counters. Under submission, 2020.","DOI":"10.1145\/3324884.3416563"},{"key":"7_CR63","doi-asserted-by":"crossref","unstructured":"Leslie\u00a0G. Valiant. The complexity of enumeration and reliability problems. SIAM J. Comput., 8:410\u2013421, 1979.","DOI":"10.1137\/0208032"},{"key":"7_CR64","unstructured":"Guy Van Den\u00a0Broeck. First-order model counting in a nutshell. In Twenty-Fifth International Joint Conference on Artificial Intelligence, pages 4086\u20134089, 2016."},{"key":"7_CR65","unstructured":"Marko Vasic, David Soloveichik, and Sarfraz Khurshid. CRNs exposed: Systematic exploration of chemical reaction networks. CoRR, abs\/1912.06197, 2019."},{"key":"7_CR66","doi-asserted-by":"crossref","unstructured":"E.\u00a0J. Weyuker and T.\u00a0J. Ostrand. Theories of program testing and the application of revealing subdomains. TSE, 6(3):236\u2013246, May 1980.","DOI":"10.1109\/TSE.1980.234485"},{"key":"7_CR67","doi-asserted-by":"crossref","unstructured":"John Wickerson, Mark Batty, Tyler Sorensen, and George\u00a0A. Constantinides. Automatically comparing memory consistency models. In 44th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), pages 190\u2013204, 2017.","DOI":"10.1145\/3093333.3009838"},{"key":"7_CR68","doi-asserted-by":"crossref","unstructured":"Tao Xie, Darko Marinov, Wolfram Schulte, and David Notkin. Symstra: A framework for generating object-oriented unit tests using symbolic execution. In 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 365\u2013381, 2005.","DOI":"10.1007\/978-3-540-31980-1_24"},{"key":"7_CR69","doi-asserted-by":"crossref","unstructured":"Razieh\u00a0Nokhbeh Zaeem and Sarfraz Khurshid. Contract-based data structure repair using Alloy. In ECOOP, pages 577\u2013598, 2010.","DOI":"10.1007\/978-3-642-14107-2_27"},{"key":"7_CR70","unstructured":"Pamela Zave. How to make Chord correct (using a stable base). CoRR, abs\/1502.06461, 2015."}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45190-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T15:39:16Z","timestamp":1666366756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45190-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030451899","9783030451905"],"references-count":70,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45190-5_7","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":"17 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","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":"30 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2020\/tacas","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":"155","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":"40","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":"8","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":"14","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 could not take place due to the COVID-19 pandemic. There was an online event on July 2, 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)"}}]}}