{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T01:05:53Z","timestamp":1729645553921,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1109\/infocom.2014.6847977","type":"proceedings-article","created":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T15:18:13Z","timestamp":1406647093000},"page":"531-539","source":"Crossref","is-referenced-by-count":8,"title":["Deep packet inspection with DFA-trees and parametrized language overapproximation"],"prefix":"10.1109","author":[{"given":"Daniel","family":"Luchaup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lorenzo","family":"De Carli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Somesh","family":"Jha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Bach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","article-title":"Chainbased dfa deflation for fast and scalable regular expression matching using tcam","author":"peng","year":"2011","journal-title":"ANCS"},{"journal-title":"Efficient Learning of Regular Languages Using Teacher-supplied Positive Samples and Learner-generated Queries","year":"1993","author":"parekh","key":"17"},{"key":"18","doi-asserted-by":"crossref","DOI":"10.1023\/A:1010822518073","article-title":"Learning DFA from simple examples","volume":"44","author":"parekh","year":"2001","journal-title":"Mach Learn"},{"key":"15","article-title":"Multibyte regular expression matching with speculation","author":"luchaup","year":"2009","journal-title":"RAID"},{"key":"16","article-title":"Fast regular expression matching using small tcams for network intrusion detection and prevention systems","author":"meiners","year":"2010","journal-title":"Usenix Security"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39945-3_11"},{"key":"14","article-title":"Fast deep packet inspection with a dual finite automata","author":"liu","year":"2011","journal-title":"IEEE Transactions on Computers"},{"year":"0","key":"11"},{"key":"12","doi-asserted-by":"crossref","DOI":"10.1145\/1151659.1159952","article-title":"Algorithms to accelerate multiple regular expressions matching for deep packet inspection","author":"kumar","year":"2006","journal-title":"SIGCOMM"},{"key":"21","doi-asserted-by":"crossref","DOI":"10.1145\/1180405.1180413","article-title":"Protomatching network traffic for high throughput network intrusion detection","author":"rubin","year":"2006","journal-title":"CCS"},{"journal-title":"Snort-Lightweight intrusion detection for networks","year":"1999","author":"roesch","key":"20"},{"key":"22","article-title":"Fast regular expression matching using fpgas","author":"sidhu","year":"2001","journal-title":"FCCM"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402983"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2008.14"},{"year":"0","key":"25"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1145\/948109.948145"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15512-3_4"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1145\/1185347.1185360"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1145\/2482767.2482791"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1882486.1882495"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1323548.1323573"},{"journal-title":"Introduction to Automata Theory Languages and Computation","year":"2006","author":"hopcroft","key":"10"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1364654.1364656"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1145\/2145816.2145833"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803886"},{"key":"6","article-title":"What is the search space of the regular inference","author":"dupont","year":"1994","journal-title":"ICGI"},{"journal-title":"Snort IDS and IPS Toolkit","year":"2007","author":"caswell","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2006.7"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(78)90562-4"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"8"}],"event":{"name":"IEEE INFOCOM 2014 - IEEE Conference on Computer Communications","start":{"date-parts":[[2014,4,27]]},"location":"Toronto, ON, Canada","end":{"date-parts":[[2014,5,2]]}},"container-title":["IEEE INFOCOM 2014 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6839150\/6847911\/06847977.pdf?arnumber=6847977","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T15:33:33Z","timestamp":1689435213000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6847977\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/infocom.2014.6847977","relation":{},"subject":[],"published":{"date-parts":[[2014,4]]}}}