{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T03:03:19Z","timestamp":1783393399312,"version":"3.54.6"},"publisher-location":"Singapore","reference-count":55,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819986637","type":"print"},{"value":"9789819986644","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"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":[[2024]]},"DOI":"10.1007\/978-981-99-8664-4_19","type":"book-chapter","created":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T06:05:13Z","timestamp":1702533913000},"page":"331-350","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Deducing Matching Strings for\u00a0Real-World Regular Expressions"],"prefix":"10.1007","author":[{"given":"Yixuan","family":"Yan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weihao","family":"Su","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lixiao","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mengxi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haiming","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chengyao","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rongchen","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zixuan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,12,15]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Aho, A.V.: Algorithms for finding patterns in strings. In: Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, pp. 255\u2013300. Elsevier and MIT Press (1990)","DOI":"10.1016\/B978-0-444-88071-0.50010-2"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Arcaini, P., Gargantini, A., Riccobene, E.: MUTREX: a mutation-based generator of fault detecting strings for regular expressions. In: ICST Workshops 2017, pp. 87\u201396 (2017)","DOI":"10.1109\/ICSTW.2017.23"},{"issue":"5","key":"19_CR3","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1109\/TKDE.2016.2515587","volume":"28","author":"A Bartoli","year":"2016","unstructured":"Bartoli, A., Lorenzo, A.D., Medvet, E., Tarlao, F.: Inference of regular expressions for text extraction from examples. IEEE Trans. Knowl. Data Eng. 28(5), 1217\u20131230 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-030-02508-3_6","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2018","author":"M Berglund","year":"2018","unstructured":"Berglund, M., Bester, W., van der Merwe, B.: Formalising boost POSIX regular expression matching. In: Fischer, B., Uustalu, T. (eds.) ICTAC 2018. LNCS, vol. 11187, pp. 99\u2013115. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02508-3_6"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2022.10.041","volume":"940","author":"M Berglund","year":"2023","unstructured":"Berglund, M., van der Merwe, B.: Re-examining regular expressions with backreferences. Theor. Comput. Sci. 940, 66\u201380 (2023)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"19_CR6","doi-asserted-by":"publisher","first-page":"324","DOI":"10.3897\/jucs.66330","volume":"27","author":"M Berglund","year":"2021","unstructured":"Berglund, M., van der Merwe, B., van Litsenborgh, S.: Regular expressions with lookahead. J. Univers. Comput. Sci. 27(4), 324\u2013340 (2021)","journal-title":"J. Univers. Comput. Sci."},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"JA Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. ACM 11(4), 481\u2013494 (1964)","journal-title":"J. ACM"},{"issue":"6","key":"19_CR8","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1142\/S012905410300214X","volume":"14","author":"C C\u00e2mpeanu","year":"2003","unstructured":"C\u00e2mpeanu, C., Salomaa, K., Yu, S.: A formal study of practical regular expressions. Int. J. Found. Comput. Sci. 14(6), 1007\u20131018 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"24\u201325","key":"19_CR9","doi-asserted-by":"publisher","first-page":"2336","DOI":"10.1016\/j.tcs.2009.02.022","volume":"410","author":"C C\u00e2mpeanu","year":"2009","unstructured":"C\u00e2mpeanu, C., Santean, N.: On the intersection of regex languages with regular languages. Theor. Comput. Sci. 410(24\u201325), 2336\u20132344 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"19_CR10","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/j.ipl.2004.09.007","volume":"92","author":"C C\u00e2mpeanu","year":"2004","unstructured":"C\u00e2mpeanu, C., Yu, S.: Pattern expressions and pattern automata. Inf. Process. Lett. 92(6), 267\u2013274 (2004)","journal-title":"Inf. Process. Lett."},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-21254-3_13","volume-title":"Language and Automata Theory and Applications","author":"P Caron","year":"2011","unstructured":"Caron, P., Champarnaud, J.-M., Mignot, L.: Partial derivatives of an extended regular expression. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 179\u2013191. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21254-3_13"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Chapman, C., Stolee, K.T.: Exploring regular expression usage and context in python. In: ISSTA 2016, pp. 282\u2013293 (2016)","DOI":"10.1145\/2931037.2931073"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Chapman, C., Wang, P., Stolee, K.T.: Exploring regular expression comprehension. In: ASE 2017, pp. 405\u2013416 (2017)","DOI":"10.1109\/ASE.2017.8115653"},{"key":"19_CR14","first-page":"1","volume":"6","author":"T Chen","year":"2022","unstructured":"Chen, T., Flores-Lamas, A., Hague, M., Han, Z., Hu, D., Kan, S., Lin, A.W., R\u00fcmmer, P., Wu, Z.: Solving string constraints with regex-dependent functions through transducers with priorities and variables. POPL 6, 1\u201331 (2022)","journal-title":"POPL"},{"key":"19_CR15","unstructured":"Chida, N., Terauchi, T.: On lookaheads in regular expressions with backreferences. In: FSCD 2022. LIPIcs, vol. 228, pp. 15:1\u201315:18 (2022)"},{"key":"19_CR16","unstructured":"Chris, K.: Regex posix - HaskellWiki. https:\/\/wiki.haskell.org\/Regex_Posix"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/3419404","volume":"64","author":"L D\u2019Antoni","year":"2021","unstructured":"D\u2019Antoni, L., Veanes, M.: Automata modulo theories. Commun. ACM 64, 86\u201395 (2021)","journal-title":"Commun. ACM"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"Davis, J.C., Coghlan, C.A., Servant, F., Lee, D.: The impact of regular expression denial of service (ReDoS) in practice: an empirical study at the ecosystem scale. In: ESEC\/FSE 2018, pp. 246\u2013256 (2018)","DOI":"10.1145\/3236024.3236027"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"Davis, J.C., IV, L.G.M., Coghlan, C.A., Servant, F., Lee, D.: Why aren\u2019t regular expressions a lingua franca? An empirical study on the re-use and portability of regular expressions. In: ESEC\/FSE 2019, pp. 443\u2013454 (2019)","DOI":"10.1145\/3338906.3338909"},{"key":"19_CR20","unstructured":"ECMA: ES2018. https:\/\/262.ecma-international.org\/9.0"},{"issue":"4","key":"19_CR21","first-page":"407","volume":"10","author":"K Ellul","year":"2005","unstructured":"Ellul, K., Krawetz, B., Shallit, J.O., Wang, M.W.: Regular expressions: new results and open problems. J. Autom. Lang. Comb. 10(4), 407\u2013437 (2005)","journal-title":"J. Autom. Lang. Comb."},{"key":"19_CR22","unstructured":"Fent: Randexp.js. https:\/\/github.com\/fent\/randexp.js"},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1070\/RM1961v016n05ABEH004112","volume":"16","author":"VM Glushkov","year":"1961","unstructured":"Glushkov, V.M.: The abstract theory of automata. Russ. Math. Surv. 16, 1\u201353 (1961)","journal-title":"Russ. Math. Surv."},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1007\/978-3-642-18275-4_18","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P Hooimeijer","year":"2011","unstructured":"Hooimeijer, P., Veanes, M.: An evaluation of automata algorithms for string analysis. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 248\u2013262. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18275-4_18"},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Larson, E., Kirk, A.: Generating evil test strings for regular expressions. In: ICST 2016, pp. 309\u2013319 (2016)","DOI":"10.1109\/ICST.2016.29"},{"key":"19_CR26","doi-asserted-by":"crossref","unstructured":"Li, N., Xie, T., Tillmann, N., de Halleux, J., Schulte, W.: Reggae: automated test generation for programs using complex regular expressions. In: ASE 2009, pp. 515\u2013519 (2009)","DOI":"10.1109\/ASE.2009.67"},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Liu, X., Jiang, Y., Wu, D.: A lightweight framework for regular expression verification. In: HASE 2019, pp. 1\u20138 (2019)","DOI":"10.1109\/HASE.2019.00011"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Loring, B., Mitchell, D., Kinder, J.: ExpoSE: practical symbolic execution of standalone JavaScript. In: SPIN 2017, pp. 196\u2013199 (2017)","DOI":"10.1145\/3092282.3092295"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Loring, B., Mitchell, D., Kinder, J.: Sound regular expression semantics for dynamic symbolic execution of javascript. In: PLDI 2019, pp. 425\u2013438 (2019)","DOI":"10.1145\/3314221.3314645"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Luo, B., Feng, Y., Wang, Z., Huang, S., Yan, R., Zhao, D.: Marrying up regular expressions with neural networks: A case study for spoken language understanding. In: ACL 2018, pp. 2083\u20132093 (2018)","DOI":"10.18653\/v1\/P18-1194"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Michael, L.G., Donohue, J., Davis, J.C., Lee, D., Servant, F.: Regexes are hard: decision-making, difficulties, and risks in programming regular expressions. In: ASE 2019, pp. 415\u2013426 (2019)","DOI":"10.1109\/ASE.2019.00047"},{"key":"19_CR32","unstructured":"Miller, F.P., Vandome, A.F., McBrewster, J.: Apache maven (2010). https:\/\/repo1.maven.org\/maven2\/"},{"key":"19_CR33","first-page":"422","volume":"27","author":"T Miyazaki","year":"2019","unstructured":"Miyazaki, T., Minamide, Y.: Derivatives of regular expressions with lookahead. J. Inf. Process. 27, 422\u2013430 (2019)","journal-title":"J. Inf. Process."},{"key":"19_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"19_CR35","unstructured":"M\u00f8ller, A.: dk.brics.automaton. https:\/\/www.brics.dk\/automaton\/"},{"key":"19_CR36","unstructured":"npm Inc: npm. https:\/\/www.npmjs.com\/"},{"key":"19_CR37","unstructured":"O\u2019Connor, C.: Crdoconnor\/xeger. https:\/\/github.com\/crdoconnor\/xeger"},{"key":"19_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/978-3-642-18098-9_25","volume-title":"Implementation and Application of Automata","author":"S Okui","year":"2011","unstructured":"Okui, S., Suzuki, T.: Disambiguation in regular expression matching via position automata with augmented transitions. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 231\u2013240. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18098-9_25"},{"key":"19_CR39","unstructured":"Python Software Foundation: Python package index - pypi. https:\/\/pypi.org\/"},{"issue":"3","key":"19_CR40","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.ipl.2009.11.002","volume":"110","author":"N Rampersad","year":"2010","unstructured":"Rampersad, N., Shallit, J.: Detecting patterns in finite regular and context-free languages. Inf. Process. Lett. 110(3), 108\u2013112 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"19_CR41","first-page":"177","volume":"2","author":"K Salomaa","year":"1998","unstructured":"Salomaa, K., Yu, S.: NFA to DFA transformation for finite languages over arbitrary alphabets. J. Autom. Lang. Comb. 2(3), 177\u2013186 (1998)","journal-title":"J. Autom. Lang. Comb."},{"key":"19_CR42","doi-asserted-by":"crossref","unstructured":"Saxena, P., Akhawe, D., Hanna, S., Mao, F., McCamant, S., Song, D.: A symbolic execution framework for JavaScript. In: S &P 2010, pp. 513\u2013528 (2010)","DOI":"10.1109\/SP.2010.38"},{"key":"19_CR43","doi-asserted-by":"crossref","unstructured":"Shen, Y., Jiang, Y., Xu, C., Yu, P., Ma, X., Lu, J.: ReScue: crafting regular expression DoS attacks. In: ASE 2018, pp. 225\u2013235 (2018)","DOI":"10.1145\/3238147.3238159"},{"key":"19_CR44","doi-asserted-by":"crossref","unstructured":"Spishak, E., Dietl, W., Ernst, M.D.: A type system for regular expressions. In: FTfJP 2012, pp. 20\u201326 (2012)","DOI":"10.1145\/2318202.2318207"},{"key":"19_CR45","doi-asserted-by":"crossref","unstructured":"Stanford, C., Veanes, M., Bj\u00f8rner, N.: Symbolic Boolean derivatives for efficiently solving extended regular expression constraints. In: PLDI 2021, pp. 620\u2013635 (2021)","DOI":"10.1145\/3410296"},{"key":"19_CR46","unstructured":"Stockmeyer, L.J.: The complexity of decision problems in automata theory and logic. Ph.D. thesis, Massachusetts Institute of Technology, USA (1974)"},{"key":"19_CR47","doi-asserted-by":"crossref","unstructured":"Su, W., Chen, H., Li, R., Chen, Z.: Modeling regex operators for solving regex crossword puzzles. In: Hermanns, H., et al. (eds.) SETTA 2023, LNCS, vol. 14464, pp. 206\u2013225. Springer, Cham (2023)","DOI":"10.1007\/978-981-99-8664-4_12"},{"key":"19_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-07151-0_13","volume-title":"Functional and Logic Programming","author":"M Sulzmann","year":"2014","unstructured":"Sulzmann, M., Lu, K.Z.M.: POSIX regular expression parsing with derivatives. In: Codish, M., Sumii, E. (eds.) FLOPS 2014. LNCS, vol. 8475, pp. 203\u2013220. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07151-0_13"},{"key":"19_CR49","unstructured":"Tauber, A.: EXREX. https:\/\/github.com\/asciimoo\/exrex"},{"key":"19_CR50","doi-asserted-by":"crossref","unstructured":"Trinh, M., Chu, D., Jaffar, J.: S3: a symbolic string solver for vulnerability detection in web applications. In: CCS 2014, pp. 1232\u20131243 (2014)","DOI":"10.1145\/2660267.2660372"},{"key":"19_CR51","unstructured":"Unicode: Unicode 15.0.0. https:\/\/unicode.org\/versions\/Unicode15.0.0\/"},{"key":"19_CR52","doi-asserted-by":"crossref","unstructured":"Veanes, M., de Halleux, P., Tillmann, N.: Rex: symbolic regular expression explorer. In: ICST 2010, pp. 498\u2013507 (2010)","DOI":"10.1109\/ICST.2010.15"},{"key":"19_CR53","doi-asserted-by":"crossref","unstructured":"Wang, P., Stolee, K.T.: How well are regular expressions tested in the wild? In: ESEC\/FSE 2018, pp. 668\u2013678 (2018)","DOI":"10.1145\/3236024.3236072"},{"key":"19_CR54","unstructured":"Youssef, M.: Generex. https:\/\/github.com\/mifmif\/Generex"},{"key":"19_CR55","doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular languages. In: Handbook of Formal Languages, Vol. 1: Word, Language, Grammar, pp. 41\u2013110 (1997)","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["Lecture Notes in Computer Science","Dependable Software Engineering. Theories, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-99-8664-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,28]],"date-time":"2023-12-28T03:22:13Z","timestamp":1703733733000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-99-8664-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,15]]},"ISBN":["9789819986637","9789819986644"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-981-99-8664-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,15]]},"assertion":[{"value":"15 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SETTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Dependable Software Engineering: Theories, Tools, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"27 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"setta2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lcs.ios.ac.cn\/setta2023\/","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":"78","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":"24","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":"31% - 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":"7","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)"}}]}}