{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T11:26:59Z","timestamp":1725708419073},"reference-count":20,"publisher":"Chapman and Hall\/CRC","isbn-type":[{"type":"print","value":"9781439846186"},{"type":"electronic","value":"9781439846193"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,10,23]]},"DOI":"10.1201\/b13055-3","type":"book-chapter","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T17:37:28Z","timestamp":1354210648000},"page":"19-43","source":"Crossref","is-referenced-by-count":0,"title":["Large-Scale Regular Expression Matching on FPGA"],"prefix":"10.1201","author":[{"given":"Yi-Hua","family":"Yang","sequence":"first","affiliation":[]},{"given":"Viktor","family":"Prasanna","sequence":"additional","affiliation":[]}],"member":"301","published-online":{"date-parts":[[2012,11,29]]},"reference":[{"volume-title":"The Theory of Parsing, Translation, and Compiling","year":"1972","author":"Aho A. V.","key":"p_1"},{"volume-title":"BMC Bioinformatics, 3(20)","year":"2002","author":"Betel D.","key":"p_2"},{"key":"p_3","doi-asserted-by":"crossref","unstructured":"J. Bispo, I. Sourdis, J. M. P. Cardoso and S. Vassiliadis, Regular expression matching for reconfigurable packet inspection. InProc. IEEE Intl. Conf. on Field Programmable Technology (FPT'06), pp.119-126, Bankok, Thailand, Dec. 2006.","DOI":"10.1109\/FPT.2006.270302"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1145\/320924.320931"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1145\/322326.322327"},{"volume-title":"BMC Bioinformatics, 9(82)","year":"2008","author":"Fourment M.","key":"p_6"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1070\/RM1961v016n05ABEH004112"},{"volume-title":"Jan.","year":"2011","author":"Hazel P.","key":"p_8"},{"key":"p_9","unstructured":"B. L. Hutchings, R. Franklin and D. Carver, Assisting network intrusion detection with reconfigurable hardware. InProc. IEEE Sym. on Field-Programmable Custom Computing Machines (FCCM'02), p.111, Napa, California, 2002. ISBN 0-7695-1801-X."},{"key":"p_11","unstructured":"C.H. Lin, C.T. Huang, C.P. Jiang and S.C. Chang, Optimization of regular expression pattern matching circuits on FPGA. InProc. Conf. on Design, Automation and Test in Europe (DATE'06), pp.12-17, Leuven, Belgium, 2006. European Design and Automation Association. ISBN 3-9810801-0-6."},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1960.5221603"},{"key":"p_13","doi-asserted-by":"crossref","unstructured":"A. R. Meyer and M. J. Fischer, Economy of description by automata, grammars, and formal systems. InProc. 12th Sym. on Switching and Automata Theory (SWAT'71), pp.188-191, Washington, DC, USA, 1971. IEEE Computer Society.","DOI":"10.1109\/SWAT.1971.11"},{"key":"p_14","doi-asserted-by":"crossref","unstructured":"A. Mitra, W. Najjar and L. Bhuyan, Compiling PCRE to FPGA for accelerating SNORT IDS. InProc. ACM\/IEEE Sym. on Architecture for Networking and Communications Systems (ANCS'07), pp.127-136, New York, NY, USA, 2007. ISBN 978-1-59593-945-946.","DOI":"10.1145\/1323548.1323571"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2010.80"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00112-7"},{"key":"p_18","unstructured":"R. Sidhu and V. Prasanna, Fast regular expression matching using FPGAs. InProc. IEEE Sym. on Field-Programmable Custom Computing Machines (FCCM'01), pp.227-238, Rohnert Park, California, 2001."},{"key":"p_19","doi-asserted-by":"crossref","unstructured":"R. Smith, C. Estan and S. Jha, Backtracking algorithmic complexity attacks against a NIDS. InProc. 22nd Annual Computer Security Applications Conference (ACSAC'06), pp.89-98, Miami Beach, Florida, Dec. 2006.","DOI":"10.1109\/ACSAC.2006.17"},{"volume-title":"Apr.","year":"2011","key":"p_20"},{"key":"p_21","doi-asserted-by":"crossref","unstructured":"N. Yamagaki, R. Sidhu and S. Kamiya, High-speed regular expression matching engine using multicharacter NFA. InProc. Intl. Conf. on Field Programmable Logic and Applications (FPL'08), pp.697-701, Heidelberg, Germany, Aug. 2008.","DOI":"10.1109\/FPL.2008.4629920"},{"key":"p_22","doi-asserted-by":"crossref","unstructured":"F. Yu, Z. Chen, Y. Diao, T. V. Lakshman and R. H. Katz, Fast and memory-efficient regular expression matching for deep packet inspection. InProc. ACM\/IEEE Sym. on Architecture for Networking and Communications Systems (ANCS'06), pp.93-102, San Jose, California, 2006. ISBN 1-59593-580-580.","DOI":"10.1145\/1185347.1185360"}],"container-title":["Discrete Mathematics and Its Applications","Handbook of Finite State Based Models and Applications"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T03:40:46Z","timestamp":1562384446000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.crcnetbase.com\/doi\/abs\/10.1201\/b13055-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,23]]},"ISBN":["9781439846186","9781439846193"],"references-count":20,"alternative-id":["10.1201\/b13055-3","10.1201\/CHDISMTHAPP","10.1201\/b13055"],"URL":"https:\/\/doi.org\/10.1201\/b13055-3","relation":{},"ISSN":["2154-459X"],"issn-type":[{"type":"print","value":"2154-459X"}],"subject":[],"published":{"date-parts":[[2012,10,23]]}}}