{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:17:04Z","timestamp":1767928624436,"version":"3.49.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031572661","type":"print"},{"value":"9783031572678","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T00:00:00Z","timestamp":1712275200000},"content-version":"vor","delay-in-days":95,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p><jats:italic>Regular expression (regex) matching<\/jats:italic> is fundamental in many applications, especially in web services. However, matching by <jats:italic>backtracking<\/jats:italic>\u2014preferred by most real-world implementations for its practical performance and backward compatibility\u2014can suffer from so-called <jats:italic>catastrophic backtracking<\/jats:italic>, which makes the number of backtracking super-linear and leads to the well-known ReDoS vulnerability. Inspired by a recent algorithm by Davis et al. that runs in linear time for (non-extended) regexes, we study efficient backtracking matching for regexes with two common extensions, namely <jats:italic>look-around<\/jats:italic> and <jats:italic>atomic grouping<\/jats:italic>. We present linear-time backtracking matching algorithms for these extended regexes. Their efficiency relies on <jats:italic>memoization<\/jats:italic>, much like the one by Davis et al.; we also strive for smaller memoization tables by carefully trimming their range. Our experiments\u2014we used some real-world regexes with the aforementioned extensions\u2014confirm the performance advantage of our algorithms.<\/jats:p>","DOI":"10.1007\/978-3-031-57267-8_4","type":"book-chapter","created":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T16:02:01Z","timestamp":1712246521000},"page":"90-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Efficient Matching with Memoization for Regexes with Look-around and Atomic Grouping"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-0794-5743","authenticated-orcid":false,"given":"Hiroya","family":"Fujinami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8300-4650","authenticated-orcid":false,"given":"Ichiro","family":"Hasuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,5]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Aho, A.V.: Algorithms for finding patterns in strings. In: van Leeuwen, J. (ed.) 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":"4_CR2","doi-asserted-by":"publisher","unstructured":"Berglund, M., Drewes, F., van\u00a0der Merwe, B.: Analyzing catastrophic backtracking behavior in practical regular expression matching. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, Szeged, Hungary, May 27-29, 2014. EPTCS, vol.\u00a0151, pp. 109\u2013123 (2014). https:\/\/doi.org\/10.4204\/EPTCS.151.7, https:\/\/doi.org\/10.4204\/EPTCS.151.7","DOI":"10.4204\/EPTCS.151.7"},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Berglund, M., van\u00a0der Merwe, B., van Litsenborgh, S.: Regular expressions with lookahead. J. Univers. Comput. Sci. 27(4), 324\u2013340 (2021). https:\/\/doi.org\/10.3897\/jucs.66330, https:\/\/doi.org\/10.3897\/jucs.66330","DOI":"10.3897\/jucs.66330"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Berglund, M., van\u00a0der Merwe, B., Watson, B.W., Weideman, N.: On the semantics of atomic subgroups in practical regular expressions. In: Carayol, A., Nicaud, C. (eds.) Implementation and Application of Automata - 22nd International Conference, CIAA 2017, Marne-la-Vall\u00e9e, France, June 27-30, 2017, Proceedings. Lecture Notes in Computer Science, vol. 10329, pp. 14\u201326. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-60134-2_2, https:\/\/doi.org\/10.1007\/978-3-319-60134-2_2","DOI":"10.1007\/978-3-319-60134-2_2"},{"key":"4_CR5","doi-asserted-by":"publisher","unstructured":"Chida, N., Terauchi, T.: On lookaheads in regular expressions with backreferences. In: Felty, A.P. (ed.) 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022, August 2-5, 2022, Haifa, Israel. LIPIcs, vol.\u00a0228, pp. 15:1\u201315:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2022.15, https:\/\/doi.org\/10.4230\/LIPIcs.FSCD.2022.15","DOI":"10.4230\/LIPIcs.FSCD.2022.15"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Chida, N., Terauchi, T.: Repairing dos vulnerability of real-world regexes. In: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022. pp. 2060\u20132077. IEEE (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833597, https:\/\/doi.org\/10.1109\/SP46214.2022.9833597","DOI":"10.1109\/SP46214.2022.9833597"},{"key":"4_CR7","unstructured":"Cox, R.: Regular expression matching can be simple and fast (but is slow in java, perl, php, python, ruby,...) (2007), URL: http:\/\/swtch.com\/rsc\/regexp\/regexp1.html"},{"key":"4_CR8","unstructured":"Cox, R.: Regular expression matching: the virtual machine approach (2009), URL: http:\/\/swtch.com\/~rsc\/regexp\/regexp2.html"},{"key":"4_CR9","doi-asserted-by":"publisher","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: Dumas, M., Pfahl, D., Apel, S., Russo, A. (eds.) Proceedings of the ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering, ESEC\/SIGSOFT FSE 2019, Tallinn, Estonia, August 26-30, 2019. pp. 443\u2013454. ACM (2019). https:\/\/doi.org\/10.1145\/3338906.3338909, https:\/\/doi.org\/10.1145\/3338906.3338909","DOI":"10.1145\/3338906.3338909"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Davis, J.C., Servant, F., Lee, D.: Using selective memoization to defeat regular expression denial of service (redos). In: 42nd IEEE Symposium on Security and Privacy, SP 2021, San Francisco, CA, USA, 24-27 May 2021. pp. 1\u201317. IEEE (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00032, https:\/\/doi.org\/10.1109\/SP40001.2021.00032","DOI":"10.1109\/SP40001.2021.00032"},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Davis, J.: PurdueDualityLab\/memoized-regex-engine: IEEE S &P21 artifact (Apr 2021). https:\/\/doi.org\/10.5281\/zenodo.4718966, URL: https:\/\/zenodo.org\/record\/4718966","DOI":"10.5281\/zenodo.4718966"},{"key":"4_CR12","unstructured":"Exchange, S.: Stack exchange network status \u2013 outage postmortem - july 20, 2016. URL: http:\/\/web.archive.org\/web\/20210308040819\/https:\/\/stackstatus.net\/post\/147710624694\/outage-postmortem-july-20-2016 (2016)"},{"key":"4_CR13","unstructured":"Friedl, J.E.F.: Mastering regular expressions - understand your data and be more productive: for Perl, PHP, Java, .NET, Ruby, and more (3. ed.). O\u2019Reilly (2006), http:\/\/www.oreilly.de\/catalog\/regex3\/index.html"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"Fujinami, H., Hasuo, I.: Artifact Archive for memo-regex: linear-time regex matching implementation with memoization (Jan 2024). https:\/\/doi.org\/10.5281\/zenodo.10458317","DOI":"10.5281\/zenodo.10458317"},{"key":"4_CR15","unstructured":"Fujinami, H., Hasuo, I.: Efficient matching with memoization for regexes with look-around and atomic grouping (extended version) (2024), http:\/\/arxiv.org\/abs\/2401.12639"},{"key":"4_CR16","unstructured":"Graham-Cumming, J.: Details of the cloudflare outage on july 2, 2019 (2019), URL: https:\/\/web.archive.org\/web\/20190712160002\/https:\/\/blog.cloudflare.com\/details-of-the-cloudflare-outage-on-july-2-2019\/"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Herczeg, Z.: Extending the PCRE library with static backtracking based just-in-time compilation support. In: Kaeli, D.R., Moseley, T. (eds.) 12th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, CGO 2014, Orlando, FL, USA, February 15-19, 2014. p.\u00a0306. ACM (2014), https:\/\/dl.acm.org\/citation.cfm?id=2544146","DOI":"10.1145\/2544137.2544146"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Kirrage, J., Rathnayake, A., Thielecke, H.: Static analysis for regular expression denial-of-service attacks. In: L\u00f3pez, J., Huang, X., Sandhu, R.S. (eds.) Network and System Security - 7th International Conference, NSS 2013, Madrid, Spain, June 3-4, 2013. Proceedings. Lecture Notes in Computer Science, vol.\u00a07873, pp. 135\u2013148. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-38631-2_11, https:\/\/doi.org\/10.1007\/978-3-642-38631-2_11","DOI":"10.1007\/978-3-642-38631-2_11"},{"key":"4_CR19","unstructured":"Li, Y., Chen, Z., Cao, J., Xu, Z., Peng, Q., Chen, H., Chen, L., Cheung, S.: ReDoSHunter: A combined static and dynamic approach for regular expression dos detection. In: Bailey, M., Greenstadt, R. (eds.) 30th USENIX Security Symposium, USENIX Security 2021, August 11-13, 2021. pp. 3847\u20133864. USENIX Association (2021), https:\/\/www.usenix.org\/conference\/usenixsecurity21\/presentation\/li-yeting"},{"key":"4_CR20","unstructured":"Li, Y., Sun, Y., Xu, Z., Cao, J., Li, Y., Li, R., Chen, H., Cheung, S., Liu, Y., Xiao, Y.: RegexScalpel: Regular expression denial of service (redos) defense by localize-and-fix. In: Butler, K.R.B., Thomas, K. (eds.) 31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022. pp. 4183\u20134200. USENIX Association (2022), https:\/\/www.usenix.org\/conference\/usenixsecurity22\/presentation\/li-yeting"},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Li, Y., Xu, Z., Cao, J., Chen, H., Ge, T., Cheung, S., Zhao, H.: FlashRegex: Deducing anti-redos regexes from examples. In: 35th IEEE\/ACM International Conference on Automated Software Engineering, ASE 2020, Melbourne, Australia, September 21-25, 2020. pp. 659\u2013671. IEEE (2020). https:\/\/doi.org\/10.1145\/3324884.3416556, https:\/\/doi.org\/10.1145\/3324884.3416556","DOI":"10.1145\/3324884.3416556"},{"key":"4_CR22","doi-asserted-by":"publisher","unstructured":"Mamouras, K., Chattopadhyay, A.: Efficient matching of regular expressions with lookaround assertions. Proc. ACM Program. Lang. 8(POPL), 2761\u20132791 (2024). https:\/\/doi.org\/10.1145\/3632934,https:\/\/doi.org\/10.1145\/3632934","DOI":"10.1145\/3632934"},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"McNaughton, R., Yamada, H.: Regular expressions and state graphs for automata. IRE Trans. Electron. Comput. 9(1), 39\u201347 (1960). https:\/\/doi.org\/10.1109\/TEC.1960.5221603, https:\/\/doi.org\/10.1109\/TEC.1960.5221603","DOI":"10.1109\/TEC.1960.5221603"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"van\u00a0der Merwe, B., Mouton, J., van Litsenborgh, S., Berglund, M.: Memoized regular expressions. In: Maneth, S. (ed.) Implementation and Application of Automata - 25th International Conference, CIAA 2021, Virtual Event, July 19-22, 2021, Proceedings. Lecture Notes in Computer Science, vol. 12803, pp. 39\u201352. Springer (2021). https:\/\/doi.org\/10.1007\/978-3-030-79121-6_4, https:\/\/doi.org\/10.1007\/978-3-030-79121-6_4","DOI":"10.1007\/978-3-030-79121-6_4"},{"key":"4_CR25","doi-asserted-by":"publisher","unstructured":"Michael, IV, L.G., Donohue, J., Davis, J.C., Lee, D., Servant, F.: Regexes are hard: Decision-making, difficulties, and risks in programming regular expressions. In: 34th IEEE\/ACM International Conference on Automated Software Engineering, ASE 2019, San Diego, CA, USA, November 11-15, 2019. pp. 415\u2013426. IEEE (2019). https:\/\/doi.org\/10.1109\/ASE.2019.00047, https:\/\/doi.org\/10.1109\/ASE.2019.00047","DOI":"10.1109\/ASE.2019.00047"},{"key":"4_CR26","doi-asserted-by":"publisher","unstructured":"Miyazaki, T., Minamide, Y.: Derivatives of regular expressions with lookahead. J. Inf. Process. 27, 422\u2013430 (2019). https:\/\/doi.org\/10.2197\/ipsjjip.27.422, https:\/\/doi.org\/10.2197\/ipsjjip.27.422","DOI":"10.2197\/ipsjjip.27.422"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Morihata, A.: Translation of regular expression with lookahead into finite state automaton. Computer Software 29(1), 1_147\u20131_158 (2012). https:\/\/doi.org\/10.11309\/jssst.29.1_147","DOI":"10.11309\/jssst.29.1_147"},{"key":"4_CR28","doi-asserted-by":"publisher","unstructured":"Moseley, D., Nishio, M., Rodriguez, J.P., Saarikivi, O., Toub, S., Veanes, M., Wan, T., Xu, E.: Derivative based nonbacktracking real-world regex matching with backtracking semantics. Proc. ACM Program. Lang. 7(PLDI), 1026\u20131049 (2023). https:\/\/doi.org\/10.1145\/3591262, https:\/\/doi.org\/10.1145\/3591262","DOI":"10.1145\/3591262"},{"key":"4_CR29","unstructured":"Rathnayake, A., Thielecke, H.: Static analysis for regular expression exponential runtime via substructural logics. CoRR abs\/1405.7058 (2014), http:\/\/arxiv.org\/abs\/1405.7058"},{"key":"4_CR30","doi-asserted-by":"publisher","unstructured":"Sakuma, Y., Minamide, Y., Voronkov, A.: Translating regular expression matching into transducers. J. Appl. Log. 10(1), 32\u201351 (2012). https:\/\/doi.org\/10.1016\/j.jal.2011.11.003, https:\/\/doi.org\/10.1016\/j.jal.2011.11.003","DOI":"10.1016\/j.jal.2011.11.003"},{"key":"4_CR31","doi-asserted-by":"publisher","unstructured":"Shen, Y., Jiang, Y., Xu, C., Yu, P., Ma, X., Lu, J.: ReScue: crafting regular expression dos attacks. In: Huchard, M., K\u00e4stner, C., Fraser, G. (eds.) Proceedings of the 33rd ACM\/IEEE International Conference on Automated Software Engineering, ASE 2018, Montpellier, France, September 3-7, 2018. pp. 225\u2013235. ACM (2018). https:\/\/doi.org\/10.1145\/3238147.3238159, https:\/\/doi.org\/10.1145\/3238147.3238159","DOI":"10.1145\/3238147.3238159"},{"key":"4_CR32","doi-asserted-by":"publisher","unstructured":"Sidhu, R.P.S., Prasanna, V.K.: Fast regular expression matching using fpgas. In: The 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM 2001, Rohnert Park, California, USA, April 29 - May 2, 2001. pp. 227\u2013238. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/FCCM.2001.22, https:\/\/doi.ieeecomputersociety.org\/10.1109\/FCCM.2001.22","DOI":"10.1109\/FCCM.2001.22"},{"key":"4_CR33","unstructured":"Staicu, C., Pradel, M.: Freezing the web: A study of redos vulnerabilities in javascript-based web servers. In: Enck, W., Felt, A.P. (eds.) 27th USENIX Security Symposium, USENIX Security 2018, Baltimore, MD, USA, August 15-17, 2018. pp. 361\u2013376. USENIX Association (2018), https:\/\/www.usenix.org\/conference\/usenixsecurity18\/presentation\/staicu"},{"key":"4_CR34","doi-asserted-by":"publisher","unstructured":"Sugiyama, S., Minamide, Y.: Checking time linearity of regular expression matching based on backtracking. Information and Media Technologies 9(3), 222\u2013232 (2014). https:\/\/doi.org\/10.11185\/imt.9.222","DOI":"10.11185\/imt.9.222"},{"key":"4_CR35","doi-asserted-by":"publisher","unstructured":"Thompson, K.: Regular expression search algorithm. Commun. ACM 11(6), 419\u2013422 (1968). https:\/\/doi.org\/10.1145\/363347.363387, https:\/\/doi.org\/10.1145\/363347.363387","DOI":"10.1145\/363347.363387"},{"key":"4_CR36","doi-asserted-by":"publisher","unstructured":"Weideman, N., van\u00a0der Merwe, B., Berglund, M., Watson, B.W.: Analyzing matching time behavior of backtracking regular expression matchers by using ambiguity of NFA. In: Han, Y., Salomaa, K. (eds.) Implementation and Application of Automata - 21st International Conference, CIAA 2016, Seoul, South Korea, July 19-22, 2016, Proceedings. Lecture Notes in Computer Science, vol.\u00a09705, pp. 322\u2013334. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-40946-7_27, https:\/\/doi.org\/10.1007\/978-3-319-40946-7_27","DOI":"10.1007\/978-3-319-40946-7_27"},{"key":"4_CR37","doi-asserted-by":"publisher","unstructured":"W\u00fcstholz, V., Olivo, O., Heule, M.J.H., Dillig, I.: Static detection of dos vulnerabilities in programs that use regular expressions. In: Legay, A., Margaria, T. (eds.) Tools and Algorithms for the Construction and Analysis of Systems - 23rd International Conference, TACAS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings, Part II. Lecture Notes in Computer Science, vol. 10206, pp. 3\u201320 (2017). https:\/\/doi.org\/10.1007\/978-3-662-54580-5_1, https:\/\/doi.org\/10.1007\/978-3-662-54580-5_1","DOI":"10.1007\/978-3-662-54580-5_1"}],"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-031-57267-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T16:03:40Z","timestamp":1712246620000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57267-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031572661","9783031572678"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57267-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"5 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The data that support the findings of this study are openly available in Zenodo at <tt>10.5281\/zenodo.10458317<\/tt>, reference number\u00a0[].","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Data-Availability Statement"}},{"value":"ESOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg City","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esop2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2024\/conferences\/esop\/","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":"72","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":"25","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":"1","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":"35% - 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.2","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":"8","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 contain 4 artifact report that have not been part of the original submission","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)"}}]}}