{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T02:20:32Z","timestamp":1773886832693,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":70,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519939.3523456","type":"proceedings-article","created":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T21:05:05Z","timestamp":1654203905000},"page":"733-748","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Software-hardware codesign for efficient in-memory regular pattern matching"],"prefix":"10.1145","author":[{"given":"Lingkun","family":"Kong","sequence":"first","affiliation":[{"name":"Rice University, USA"}]},{"given":"Qixuan","family":"Yu","sequence":"additional","affiliation":[{"name":"Rice University, USA"}]},{"given":"Agnishom","family":"Chattopadhyay","sequence":"additional","affiliation":[{"name":"Rice University, USA"}]},{"given":"Alexis","family":"Le Glaunec","sequence":"additional","affiliation":[{"name":"Rice University, USA"}]},{"given":"Yi","family":"Huang","sequence":"additional","affiliation":[{"name":"Rice University, USA"}]},{"given":"Konstantinos","family":"Mamouras","sequence":"additional","affiliation":[{"name":"Rice University, USA"}]},{"given":"Kaiyuan","family":"Yang","sequence":"additional","affiliation":[{"name":"Rice University, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360855"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.18130\/V3FN18"},{"key":"e_1_3_2_1_3_1","unstructured":"2022. Apache SpamAssassin: An Open Source Anti-spam Platform.. http:\/\/spamassassin.apache.org\/  2022. Apache SpamAssassin: An Open Source Anti-spam Platform.. http:\/\/spamassassin.apache.org\/"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0035751"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/968280.968312"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24622-0_5"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-75632-5_5"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1544012.1544037"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2018.00068"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1971.223204"},{"key":"e_1_3_2_1_11_1","volume-title":"A Scalable Architecture for High-throughput Regular-expression Pattern Matching. ACM SIGARCH computer architecture news, 34, 2","author":"Brodie Benjamin C","year":"2006","unstructured":"Benjamin C Brodie , David E Taylor , and Ron K Cytron . 2006. A Scalable Architecture for High-throughput Regular-expression Pattern Matching. ACM SIGARCH computer architecture news, 34, 2 ( 2006 ), 191\u2013202. Benjamin C Brodie, David E Taylor, and Ron K Cytron. 2006. A Scalable Architecture for High-throughput Regular-expression Pattern Matching. ACM SIGARCH computer architecture news, 34, 2 (2006), 191\u2013202."},{"key":"e_1_3_2_1_12_1","volume-title":"STACS 92","author":"Br\u00fcggemann-Klein Anne","unstructured":"Anne Br\u00fcggemann-Klein and Derick Wood . 1992. Deterministic Regular Languages . In STACS 92 . Springer , Heidelberg . 173\u2013184. Anne Br\u00fcggemann-Klein and Derick Wood. 1992. Deterministic Regular Languages. In STACS 92. Springer, Heidelberg. 173\u2013184."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1997.2688"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1880153.1880157"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-60508-7_21"},{"key":"e_1_3_2_1_16_1","unstructured":"2022. ClamAV\u00ae : An Open-source Antivirus Engine for Detecting Trojans Viruses Malware & Other Malicious Threats.. https:\/\/www.clamav.net\/  2022. ClamAV\u00ae : An Open-source Antivirus Engine for Detecting Trojans Viruses Malware & Other Malicious Threats.. https:\/\/www.clamav.net\/"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19225-3_1"},{"key":"e_1_3_2_1_18_1","unstructured":"Russ Cox. 2010. Regular Expression Matching in the Wild. https:\/\/swtch.com\/ rsc\/regexp\/regexp3.html  Russ Cox. 2010. Regular Expression Matching in the Wild. https:\/\/swtch.com\/ rsc\/regexp\/regexp3.html"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.8"},{"key":"e_1_3_2_1_20_1","volume-title":"Mathematical Foundations of Computer Science","author":"Gelade Wouter","year":"2009","unstructured":"Wouter Gelade , Marc Gyssens , and Wim Martens . 2009. Regular Expressions with Counting: Weak versus Strong Determinism . In Mathematical Foundations of Computer Science 2009 . Springer , Heidelberg . 369\u2013381. Wouter Gelade, Marc Gyssens, and Wim Martens. 2009. Regular Expressions with Counting: Weak versus Strong Determinism. In Mathematical Foundations of Computer Science 2009. Springer, Heidelberg. 369\u2013381."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1070\/RM1961v016n05ABEH004112"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2016.7783747"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34175-6_24"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03466-4_15"},{"key":"e_1_3_2_1_25_1","volume-title":"Language and Automata Theory and Applications","author":"Hovland Dag","unstructured":"Dag Hovland . 2012. The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints . In Language and Automata Theory and Applications . Springer , Heidelberg . 313\u2013324. Dag Hovland. 2012. The Membership Problem for Regular Expressions with Unordered Concatenation and Numerical Constraints. In Language and Automata Theory and Applications. Springer, Heidelberg. 313\u2013324."},{"key":"e_1_3_2_1_26_1","volume-title":"CAMA: Energy and Memory Efficient Automata Processing in Content-Addressable Memories. https:\/\/doi.org\/10.48550\/arXiv.2112.00267 arxiv:cs.AR\/2112.00267.","author":"Huang Yi","year":"2021","unstructured":"Yi Huang , Zhiyu Chen , Dai Li , and Kaiyuan Yang . 2021 . CAMA: Energy and Memory Efficient Automata Processing in Content-Addressable Memories. https:\/\/doi.org\/10.48550\/arXiv.2112.00267 arxiv:cs.AR\/2112.00267. 10.48550\/arXiv.2112.00267 Yi Huang, Zhiyu Chen, Dai Li, and Kaiyuan Yang. 2021. CAMA: Energy and Memory Efficient Automata Processing in Content-Addressable Memories. https:\/\/doi.org\/10.48550\/arXiv.2112.00267 arxiv:cs.AR\/2112.00267."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cdt.2011.0066"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2018.00078"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378471"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935024"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/MICRO.2012.49"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72016-2_18"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3013053"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1971.11"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1972.29"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19475-7_4"},{"key":"e_1_3_2_1_37_1","unstructured":"2021. PCRE - Perl Compatible Regular Expressions. https:\/\/www.pcre.org\/  2021. PCRE - Perl Compatible Regular Expressions. https:\/\/www.pcre.org\/"},{"key":"e_1_3_2_1_38_1","unstructured":"2022. Posix Syntax in PCRE. https:\/\/www.pcre.org\/original\/doc\/html\/pcrepattern.html  2022. Posix Syntax in PCRE. https:\/\/www.pcre.org\/original\/doc\/html\/pcrepattern.html"},{"key":"e_1_3_2_1_39_1","unstructured":"2022. PROSITE: Database of Protein Domains Families and Functional Sites.. https:\/\/prosite.expasy.org\/  2022. PROSITE: Database of Protein Domains Families and Functional Sites.. https:\/\/prosite.expasy.org\/"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM48280.2020.00027"},{"key":"e_1_3_2_1_41_1","unstructured":"2021. RE2: Google\u2019s regular expression library. https:\/\/github.com\/google\/re2  2021. RE2: Google\u2019s regular expression library. https:\/\/github.com\/google\/re2"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2015.2430313"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2019.2901466"},{"key":"e_1_3_2_1_44_1","unstructured":"2021. Regex: A Rust Library for Parsing Compiling and Executing Regular Expressions.. https:\/\/github.com\/rust-lang\/regex  2021. Regex: A Rust Library for Parsing Compiling and Executing Regular Expressions.. https:\/\/github.com\/rust-lang\/regex"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17462-0_24"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00017"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3352460.3358324"},{"key":"e_1_3_2_1_48_1","volume-title":"Fast Regular Expression Matching Using FPGAs. In The 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM \u201901)","author":"Sidhu Reetinder","year":"2001","unstructured":"Reetinder Sidhu and Viktor K Prasanna . 2001 . Fast Regular Expression Matching Using FPGAs. In The 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM \u201901) . IEEE, New York, NY, USA. 227\u2013238. Reetinder Sidhu and Viktor K Prasanna. 2001. Fast Regular Expression Matching Using FPGAs. In The 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM \u201901). IEEE, New York, NY, USA. 227\u2013238."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402983"},{"key":"e_1_3_2_1_50_1","unstructured":"2022. Snort Intrusion Detection System.. https:\/\/www.snort.org\/  2022. Snort Intrusion Detection System.. https:\/\/www.snort.org\/"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-007-0131-0"},{"key":"e_1_3_2_1_52_1","unstructured":"2022. SPICE: A General-purpose Circuit Simulation Program for Nonlinear DC Nonlinear Transient and Linear AC Analyses. http:\/\/bwrcs.eecs.berkeley.edu\/Classes\/IcBook\/SPICE  2022. SPICE: A General-purpose Circuit Simulation Program for Nonlinear DC Nonlinear Transient and Linear AC Analyses. http:\/\/bwrcs.eecs.berkeley.edu\/Classes\/IcBook\/SPICE"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804029"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3123939.3123986"},{"key":"e_1_3_2_1_55_1","unstructured":"2022. Suricata Threat Detection Engine.. https:\/\/suricata.io\/  2022. Suricata Threat Detection Engine.. https:\/\/suricata.io\/"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498263"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/363347.363387"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354682"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3428286"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04342-0_14"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2016.7581271"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2018.8573482"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/1723112.1723149"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2968456.2976763"},{"key":"e_1_3_2_1_65_1","volume-title":"Hyperscan: A Fast Multi-Pattern Regex Matcher for Modern CPUs. In 16th USENIX Symposium on Networked Systems Design and Implementation (NSDI \u201919)","author":"Wang Xiang","year":"2019","unstructured":"Xiang Wang , Yang Hong , Harry Chang , KyoungSoo Park , Geoff Langdale , Jiayu Hu , and Heqing Zhu . 2019 . Hyperscan: A Fast Multi-Pattern Regex Matcher for Modern CPUs. In 16th USENIX Symposium on Networked Systems Design and Implementation (NSDI \u201919) . USENIX Association, 631\u2013648. https:\/\/www.usenix.org\/conference\/nsdi19\/presentation\/wang-xiang Xiang Wang, Yang Hong, Harry Chang, KyoungSoo Park, Geoff Langdale, Jiayu Hu, and Heqing Zhu. 2019. Hyperscan: A Fast Multi-Pattern Regex Matcher for Modern CPUs. In 16th USENIX Symposium on Networked Systems Design and Implementation (NSDI \u201919). USENIX Association, 631\u2013648. https:\/\/www.usenix.org\/conference\/nsdi19\/presentation\/wang-xiang"},{"key":"e_1_3_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.23919\/FPL.2017.8056759"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/1477942.1477948"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934986"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/1185347.1185360"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145833"}],"event":{"name":"PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation","location":"San Diego CA USA","acronym":"PLDI '22","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519939.3523456","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519939.3523456","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:10:30Z","timestamp":1750183830000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519939.3523456"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":70,"alternative-id":["10.1145\/3519939.3523456","10.1145\/3519939"],"URL":"https:\/\/doi.org\/10.1145\/3519939.3523456","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}