{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T08:45:21Z","timestamp":1782636321174,"version":"3.54.5"},"reference-count":12,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.446.2","type":"journal-article","created":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T08:24:52Z","timestamp":1782635092000},"page":"19-36","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Regex Matching with Sparse Counting-Sets"],"prefix":"10.4204","volume":"446","author":[{"given":"Martin","family":"Berglund","sequence":"first","affiliation":[{"name":"Ume\u00e5 University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Brink","family":"van der Merwe","sequence":"additional","affiliation":[{"name":"Stellenbosch University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sicheol","family":"Sung","sequence":"additional","affiliation":[{"name":"Yonsei University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2720","published-online":{"date-parts":[[2026,6,25]]},"reference":[{"key":"symlearn","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-96145-3_23","article-title":"The Learnability of Symbolic Automata","volume-title":"Computer Aided Verification - 30th International Conference, CAV 2018, Proceedings, Part I","volume":"10981","author":"Argyros","year":"2018"},{"key":"BjorklundMT15","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1145\/2806416.2806434","article-title":"Efficient Incremental Evaluation of Succinct Regular Expressions","volume-title":"Proceedings of the 24th ACM International Conference on Information and Knowledge Management, CIKM 2015, Melbourne, VIC, Australia, October 19 - 23, 2015","author":"Bj\u00f6rklund","year":"2015"},{"key":"DavisCSL18","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1145\/3236024.3236027","article-title":"The impact of regular expression denial of service (ReDoS) in practice: an empirical study at the ecosystem scale","volume-title":"Proceedings of the 2018 26th ACM joint meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering","author":"Davis","year":"2018"},{"key":"DavisMCSL19","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1145\/3338906.3338941","article-title":"Why aren't regular expressions a lingua franca? An empirical study on the re-use and portability of regular expressions","volume-title":"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","author":"Davis","year":"2019"},{"issue":"1","key":"GeladeGM12","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1137\/100814196","article-title":"Regular Expressions with Counting: Weak versus Strong Determinism","volume":"41","author":"Gelade","year":"2012","journal-title":"SIAM J. Comput."},{"key":"GlaunecKM23","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1145\/3586044","article-title":"Regular Expression Matching using Bit Vector Automata","volume":"7","author":"Glaunec","year":"2023","journal-title":"Proc. ACM Program. Lang."},{"key":"HolikSTV23","article-title":"Fast Matching of Regular Patterns with Synchronizing Counting (Technical Report)","volume":"abs\/2301.12851","author":"Hol\u00edk","year":"2023","journal-title":"CoRR"},{"key":"KongYCGHMY22","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3519939.3523456","article-title":"Software-hardware codesign for efficient in-memory regular pattern matching","volume-title":"PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13 - 17, 2022","author":"Kong","year":"2022"},{"key":"SmithEJ08","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1109\/SP.2008.14","article-title":"XFA: Faster Signature Matching with Extended Automata","volume-title":"2008 IEEE Symposium on Security and Privacy (SP 2008), 18-21 May 2008, Oakland, California, USA","author":"Smith","year":"2008"},{"key":"SuHLCG24","first-page":"271","article-title":"Towards an Effective Method of ReDoS Detection for Non-backtracking Engines","volume-title":"33rd USENIX Security Symposium (USENIX Security 24)","author":"Su","year":"2024"},{"key":"TuronovaHHLVV22","first-page":"4165","article-title":"Counting in Regexes Considered Harmful: Exposing ReDoS Vulnerability of Nonbacktracking Matchers","volume-title":"31st USENIX Security Symposium, USENIX Security 2022, Boston, MA, USA, August 10-12, 2022","author":"Turonov\u00e1","year":"2022"},{"key":"TuronovaHLSVV20","doi-asserted-by":"publisher","DOI":"10.1145\/3428286","article-title":"Regex matching with counting-set automata","volume":"4","author":"Turonov\u00e1","year":"2020","journal-title":"Proc. ACM Program. Lang."}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T08:24:54Z","timestamp":1782635094000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/2606.26679v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,25]]},"references-count":12,"URL":"https:\/\/doi.org\/10.4204\/eptcs.446.2","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,25]]}}}