{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T00:50:58Z","timestamp":1762390258014,"version":"3.33.0"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,10,4]],"date-time":"2007-10-04T00:00:00Z","timestamp":1191456000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"},{"start":{"date-parts":[[2007,10,4]],"date-time":"2007-10-04T00:00:00Z","timestamp":1191456000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst Sign Image"],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1007\/s11265-007-0131-0","type":"journal-article","created":{"date-parts":[[2007,10,3]],"date-time":"2007-10-03T17:19:21Z","timestamp":1191431961000},"page":"99-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":60,"title":["Regular Expression Matching in Reconfigurable Hardware"],"prefix":"10.1007","volume":"51","author":[{"given":"Ioannis","family":"Sourdis","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o","family":"Bispo","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o M. P.","family":"Cardoso","sequence":"additional","affiliation":[]},{"given":"Stamatis","family":"Vassiliadis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,10,4]]},"reference":[{"key":"131_CR1","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1093\/nar\/gki114","volume":"33","author":"S. Stephens","year":"2005","unstructured":"S. Stephens, J. Y. Chen, M. G. Davidson, S. Thomas, and B. M. Trute, \u201cOracle database 10\u00a0g: a platform for blast search and regular expression pattern matching in life sciences,\u201d Nucleic Acids Res., vol. 33 (database-Issue), 2005, pp. 675\u2013679.","journal-title":"Nucleic Acids Res."},{"issue":"Suppl. 1","key":"131_CR2","doi-asserted-by":"crossref","first-page":"S:18","DOI":"10.1186\/1471-2105-6-S1-S18","volume":"6","author":"S. Ray","year":"2005","unstructured":"S. Ray and M. Craven, \u201cLearning statistical models for annotating proteins with function information using biomedical text,\u201d BMC Bioinformatics, vol. 6, Suppl. 1, 2005, p. S:18.","journal-title":"BMC Bioinformatics"},{"issue":"4","key":"131_CR3","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1080\/00207160310001650025","volume":"81","author":"J.-M. Champarnaud","year":"2004","unstructured":"J.-M. Champarnaud, F. Coulon, and T. Paranthoen, \u201cCompact and fast algorithms for safe regular expression search,\u201d Int. J. Comput. Math., vol. 81, no. 4, 2004, pp. 383\u2013401.","journal-title":"Int. J. Comput. Math."},{"key":"131_CR4","doi-asserted-by":"crossref","unstructured":"F. Yu, Z. Chen, Y. Diao, T. V. Lakshman, and R. H. Katz, \u201cFast and memory-efficient regular expression matching for deep packet inspection,\u201d in Proc. 2nd ACM\/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS\u201906), ACM Press, 2006, pp. 93\u2013102.","DOI":"10.1145\/1185347.1185360"},{"issue":"4","key":"131_CR5","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/1151659.1159952","volume":"36","author":"S. Kumar","year":"2006","unstructured":"S. Kumar, S. Dharmapurikar, F. Yu, P. Crowley, and J. Turner, \u201cAlgorithms to accelerate multiple regular expressions matching for deep packet inspection,\u201d Comput. Commun. Rev., vol. 36, no. 4, 2006, pp. 339\u2013350.","journal-title":"Comput. Commun. Rev."},{"key":"131_CR6","doi-asserted-by":"crossref","unstructured":"F. Yu, Z. Chen, Y. Diao, T. Lakshman, and R. H. Katz, \u201cFast and memory-efficient regular expression matching for deep packet inspection,\u201d EECS Department, University of California, Berkeley, Tech. Rep. UCB\/EECS-2006-76, May 22 2006. [Online]. Available: http:\/\/www.eecs.berkeley.edu\/Pubs\/TechRpts\/2006\/EECS-2006-76.html.","DOI":"10.1145\/1185347.1185360"},{"key":"131_CR7","doi-asserted-by":"crossref","unstructured":"S. Kumar, J. Turner, and J. Williams, \u201cAdvanced algorithms for fast and scalable deep packet inspection,\u201d in Proc. of ACM\/IEEE Symposium on Architecture for Networking and Sommunications Systems (ANCS\u201906), New York, ACM Press, 2006, pp. 81\u201392.","DOI":"10.1145\/1185347.1185359"},{"issue":"11","key":"131_CR8","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1109\/TC.2004.104","volume":"53","author":"S. Vassiliadis","year":"2004","unstructured":"S. Vassiliadis, S. Wong, G. N. Gaydadjiev, K. Bertels, G. Kuzmanov, and E. M. Panainte, \u201cThe Molen polymorphic processor,\u201d in IEEE Trans. Comput., vol. 53, no. 11, 2004, pp. 1363\u20131375.","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"131_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/508352.508353","volume":"34","author":"K. Compton","year":"2002","unstructured":"K. Compton and S. Hauck, \u201cReconfigurable computing: a survey of systems and software,\u201d ACM Comput. Surv., vol. 34, no. 2, 2002, pp. 171\u2013210.","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"131_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(86)90088-5","volume":"48","author":"G. Berry","year":"1986","unstructured":"G. Berry and R. Sethi, \u201cFrom regular expressions to deterministic automata,\u201d Theor. Comput. Sci., vol. 48, no. 1, 1986, pp. 117\u2013126.","journal-title":"Theor. Comput. Sci."},{"key":"131_CR11","doi-asserted-by":"crossref","unstructured":"J. E. Hopcroft and J. D. Ullman, \u201cIntroduction to Automata Theory, Languages and Computation, 2nd ed. Addison-Wesley, 2001.","DOI":"10.1145\/568438.568455"},{"issue":"3","key":"131_CR12","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1145\/322326.322327","volume":"29","author":"R. W. Floyd","year":"1982","unstructured":"R. W. Floyd and J. D. Ullman, \u201cThe compilation of regular expressions into integrated circuits,\u201d J. Assoc. Comput. Mach., vol. 29, no. 3, 1982, pp. 603\u2013622.","journal-title":"J. Assoc. Comput. Mach."},{"key":"131_CR13","unstructured":"A. Karlin, H. Trickey, and J. Ullman, \u201cExperience with a regular expression compiler,\u201d in Proc. of IEEE Conference on Computer Design\/VLSI in Computers, 1983, pp. 656\u2013665."},{"key":"131_CR14","unstructured":"R. Sidhu and V. K. Prasanna, \u201cFast regular expression matching using FPGAs,\u201d in Proc. of 9th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM\u201901), IEEE Computer Society Press, 2001, pp. 227\u2013238."},{"issue":"6","key":"131_CR15","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TC.1979.1675378","volume":"C-28","author":"A. Mukhopadhyay","year":"1979","unstructured":"A. Mukhopadhyay, \u201cHardware algorithms for non-numeric computation,\u201d IEEE Trans. Comput., vol. C-28, no. 6, 1979, pp. 384\u2013394.","journal-title":"IEEE Trans. Comput."},{"key":"131_CR16","unstructured":"PCRE\u2014Perl Compatible Regular Expressions, http:\/\/www.pcre.org\/."},{"key":"131_CR17","unstructured":"SNORT official web site, http:\/\/www.snort.org."},{"key":"131_CR18","unstructured":"Bleeding Edge Threats web site, http:\/\/www.bleedingthreats.net."},{"key":"131_CR19","unstructured":"I. Dubrawsky, \u201cFirewall evolution\u2014deep packet inspaction,\u201d July 2003, http:\/\/www.securityfocus.com\/infocus\/1716."},{"key":"131_CR20","unstructured":"M. Fisk and G. Varghese, \u201cAn analysis of fast string matching applied to content-based forwarding and intrusion detection,\u201d in Techical Report CS2001-0670, University of California, San Diego, 2002."},{"key":"131_CR21","doi-asserted-by":"crossref","unstructured":"B. L. Hutchings, R. Franklin, and D. Carver, \u201cAssisting network intrusion detection with reconfigurable hardware,\u201d in Proc. of 10th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM\u201902), IEEE Computer Society Press, 2002, pp. 111\u2013120.","DOI":"10.1109\/FPGA.2002.1106666"},{"key":"131_CR22","doi-asserted-by":"crossref","unstructured":"J. Moscola, J. Lockwood, R. P. Loui, and M. Pachos, \u201cImplementation of a content-scanning module for an Internet firewall,\u201d in Proc. of 11th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM\u201903), IEEE Computer Society Press, 2003, pp. 31\u201338.","DOI":"10.1109\/FPGA.2003.1227239"},{"key":"131_CR23","doi-asserted-by":"crossref","unstructured":"C. R. Clark and D. E. Schimmel, \u201cScalable parallel pattern-matching on high-speed networks,\u201d in Proc. of 12th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM\u201904), IEEE Computer Society Press, 2004, pp. 249\u2013257.","DOI":"10.1109\/FCCM.2004.50"},{"key":"131_CR24","doi-asserted-by":"crossref","unstructured":"I. Sourdis and D. Pnevmatikatos, \u201cPre-decoded CAMs for efficient and high-speed NIDS pattern matching,\u201d in Proc. 12th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM\u201904), IEEE Computer Society Press, 2004, pp. 258\u2013267.","DOI":"10.1109\/FCCM.2004.46"},{"key":"131_CR25","doi-asserted-by":"crossref","unstructured":"I. Sourdis, D. Pnevmatikatos, S. Wong, and S. Vassiliadis, \u201cA reconfigurable perfect-hashing scheme for packet inspection,\u201d in Proc. of 15th Int\u2019l Conference on Field Programmable Logic and Applications (FPL\u201905), Tampere, 2005, pp. 644\u2013647.","DOI":"10.1109\/FPL.2005.1515804"},{"key":"131_CR26","doi-asserted-by":"crossref","unstructured":"G. Papadopoulos and D. Pnevmatikatos, \u201cHashing + Memory = Low Cost, exact pattern matching,\u201d in Proc. 15th Int\u2019l Conference on Field Programmable Logic and Applications (FPL\u201905), Tampere, 2005, pp. 39\u201344.","DOI":"10.1109\/FPL.2005.1515696"},{"key":"131_CR27","unstructured":"M. Roesch, \u201c{S}nort\u2014lightweight intrusion detection for networks,\u201d in Proc. of 13th USENIX Conference on System Administration, Seattle, 1999, pp. 229\u2013238."},{"issue":"2","key":"131_CR28","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. Rabin","year":"1959","unstructured":"M. Rabin and D. Scott, \u201cFinite automata and their decision problems,\u201d IBM J. Res. Develop., vol. 3, no. 2, 1959, pp. 114\u2013125.","journal-title":"IBM J. Res. Develop."},{"issue":"1","key":"131_CR29","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/TEC.1960.5221603","volume":"EC-9","author":"R. McNaughton","year":"1960","unstructured":"R. McNaughton and H. Yamada, \u201cRegular expressions and state graphs for automata,\u201d IEEE Trans. Electron. Comput., vol. EC-9, no. 1, 1960, pp. 39\u201347.","journal-title":"IEEE Trans. Electron. Comput."},{"issue":"6","key":"131_CR30","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K. Thompson","year":"1968","unstructured":"K. Thompson, \u201cRegular expression search algorithm,\u201d Commun. ACM, vol. 11, no. 6, 1968, pp. 419\u2013422.","journal-title":"Commun. ACM"},{"issue":"5","key":"131_CR31","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1109\/12.24279","volume":"38","author":"M. J. Foster","year":"1989","unstructured":"M. J. Foster, \u201cAvoiding latch formation in regular expression recognizers,\u201d IEEE Trans. Comput., vol. 38, no. 5, 1989, pp. 754\u2013756.","journal-title":"IEEE Trans. Comput."},{"key":"131_CR32","doi-asserted-by":"crossref","unstructured":"C. R. Clark and D. E. Schimmel, \u201cEfficient reconfigurable logic circuit for matching complex network intrusion detection patterns,\u201d in Proc. 13th Int\u2019l Conference on Field Programmable Logic and Applications (FPL\u201903), Lisbon, 2003, pp. 956\u2013959.","DOI":"10.1007\/978-3-540-45234-8_94"},{"key":"131_CR33","unstructured":"C.-H. Lin, C.-T. Huang, C.-P. Jiang, and S.-C. Chang, \u201cOptimization of regular expression pattern matching circuits on FPGA,\u201d in Proc. of Conference on Design, Automation and Test in Europe (DATE\u201906), Munich, 2006, pp. 12\u201317."},{"key":"131_CR34","doi-asserted-by":"crossref","unstructured":"J. Moscola, Y. H. Cho, and J. W. Lockwood, \u201cA scalable hybrid regular expression pattern matcher,\u201d in Proc. of 14th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM\u201906), IEEE Computer Society Press, 2006, pp. 337\u2013338.","DOI":"10.1109\/FCCM.2006.18"},{"key":"131_CR35","doi-asserted-by":"crossref","unstructured":"Z. K. Baker and V. K. Prasanna, \u201cA methodology for synthesis of efficient intrusion detection systems on FPGAs,\u201d in Proc. 12th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM\u201904), IEEE Computer Society Press, 2004, pp. 135\u2013144.","DOI":"10.1109\/FCCM.2004.6"},{"key":"131_CR36","doi-asserted-by":"crossref","unstructured":"Z. K. Baker, H.-J. Jung, and V. K. Prasanna, \u201cRegular expression software deceleration for intrusion detection systems,\u201d in Proc. 16th Int\u2019l Conference on Field Programmable Logic and Applications (FPL\u201906), Madrid, 2006, pp. 418\u2013425.","DOI":"10.1109\/FPL.2006.311246"},{"key":"131_CR37","doi-asserted-by":"crossref","unstructured":"B. C. Brodie, D. E. Taylor, and R. K. Cytron, \u201cA scalable architecture for high-throughput regular-expression pattern matching,\u201d Comput. Archit. News, vol. 34, no. 2, 2006, pp. 191\u2013202 [also published in 33rd Int\u2019l Symposium on Computer Architecture (ISCA\u201906)].","DOI":"10.1145\/1150019.1136500"},{"key":"131_CR38","doi-asserted-by":"crossref","unstructured":"P. Sutton, \u201cPartial character decoding for improved regular expression matching in FPGAs,\u201d in Proc. of IEEE Int\u2019l Conference on Field-Programmable Technology (FPT\u201904), Brisbane, 2004, pp. 25\u201332.","DOI":"10.1109\/FPT.2004.1393247"},{"key":"131_CR39","doi-asserted-by":"crossref","unstructured":"I. Sourdis, V. Dimopoulos, D. Pnevmatikatos, and S. Vassiliadis, \u201cPacket pre-filtering for network intrusion detection,\u201d in Proc. 2nd ACM\/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS\u201906), San Jose, 2006, pp. 183\u2013192.","DOI":"10.1145\/1185347.1185372"},{"key":"131_CR40","doi-asserted-by":"crossref","unstructured":"I. Sourdis and D. Pnevmatikatos, \u201cFast, large-scale string match for a 10\u00a0Gbps FPGA-based network intrusion detection system,\u201d in Proc. of 13th Int\u2019l Conference on Field Programmable Logic and Applications (FPL\u201903), Lisbon, 2003, pp. 880\u2013889.","DOI":"10.1007\/978-3-540-45234-8_85"},{"key":"131_CR41","doi-asserted-by":"crossref","unstructured":"T. Sproull, G. Brebner, and C. Neely, \u201cMutable codesign for embedded protocol processing,\u201d in Proc. of 15th Int\u2019l Conference on Field Programmable Logic and Applications (FPL\u201905), Tampere, 2005, pp. 51\u201356.","DOI":"10.1109\/FPL.2005.1515698"},{"key":"131_CR42","doi-asserted-by":"crossref","unstructured":"J. C. Bispo, I. Sourdis, J. M.P. Cardoso, and S. Vassiliadis, \u201cRegular expression matching for reconfigurable packet inspection,\u201d in Proc. IEEE Int\u2019l Conference on Field Programmable Technology (FPT\u201906), Bangkok, 2006, pp. 119\u2013126.","DOI":"10.1109\/FPT.2006.270302"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-007-0131-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11265-007-0131-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-007-0131-0.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-007-0131-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T11:23:21Z","timestamp":1737458601000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11265-007-0131-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,4]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["131"],"URL":"https:\/\/doi.org\/10.1007\/s11265-007-0131-0","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"type":"print","value":"1939-8018"},{"type":"electronic","value":"1939-8115"}],"subject":[],"published":{"date-parts":[[2007,10,4]]},"assertion":[{"value":"14 April 2007","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2007","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 July 2007","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2007","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}