Synthesis of regular expressions for FPGAs

References

• Aho , AV , Hopcroft , JE and Ullman , JD . 1974 . The Design and Analysis of Computer Algorithms , Reading, Massachusetts : Addison-Wesley .
   Google Scholar
• Baker , ZK and Prasanna , VK . “A Methodology for Synthesis of Efficient Intrusion Detection systems on FPGAs,” . IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'04) . April 20–23 2004 . pp. 135 – 144 . Napa, CA
   Google Scholar
• Baker , ZK , Jung , H-J and Prasanna , VK . “Regular Expression Software Deceleration For Intrusion Detection Systems,” . 16th Int’l Conference on Field Programmable Logic and Applications (FPL’06) . 2006 . pp. 418 – 425 .
   Google Scholar
• Berry , G and Sethi , R . 1986 . From regular expressions to deterministic automata . Theoretical Computer Science , 48 ( 1 ) : 117 – 126 .
   Google Scholar
• Bispo , J , Sourdis , I , Cardoso , JMP and Vassiliadis , S . “Regular Expression Matching for Reconfigurable Packet Inspection,” . IEEE Int’l Conf. on Field Programmable Technology (FPT’06) . Dec. 13–15 2006 , Bangkok, Thailand. pp. 119 – 126 .
   Google Scholar
• Bispo , J , Sourdis , I , Cardoso , JMP and Vassiliadis , S . “Synthesis of Regular Expressions Targeting FPGAs: Current Status and Open Issues,” . Int’l Workshop on Applied Reconfigurable Computing (ARC’07) . March 27–29 2007 , Mangaratiba, Rio de Janeiro, Brazil. pp. 179 – 190 . Springer . LNCS 4419
   Google Scholar
• Bleeding Edge Threats web sitehttp://www.bleedingthreats.net (last accessed 2007)
   Google Scholar
• Brodie , BC , Taylor , DE and Cytron , RK . “A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching,” . 33rd Int'l Symposium on Computer Architecture (ISCA'06) . June 17–21 2006 . pp. 191 – 202 . Boston, MA
   Google Scholar
• Clark , CR and Schimmel , DE . “Scalable Parallel Pattern-Matching on High-Speed Networks,” . IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM’04) . April 20–23 2004 . pp. 249 – 257 . Napa, CA
   Google Scholar
• Cox , R . 2007 . “Regular Expression Matching Can Be Simple And Fast (but is slow in Java, Perl, PHP, Python, Ruby, …),” . Available online at: http://swtch.com/∼rsc/regexp/regexp1.html
   Google Scholar
• Floyd , RW and Ullman , JD . 1982 . The Compilation of Regular Expressions into Integrated Circuits . in Journal of the ACM (JACM) , 29 : 603 – 622 .
   Google Scholar
• Goyvaerts , J . 2007 . Regular-Expressions.info–Regex Tutorial, Examples and Reference–Regexp Patterns . http://www.regular-expressions.info/ (last accessed 2007)
   Google Scholar
• Hopcroft , JE and Ullman , JD . 2001 . “ Introduction to Automata Theory, Languages and Computation ” . In , 2nd ed , Reading, Mass : Addison-Wesley .
   Google Scholar
• Lin , C-H , Huang , C-T , Jiang , C-P and Chang , S-C . “Optimization of regular expression pattern matching circuits on FPGA,” . Proc. of Conf. on Design, Automation and Test in Europe (DATE’06) . 2006 . pp. 12 – 17 .
   Google Scholar
• Karlin , AR , Trickey , HW and Ullman , JD . “Experience with a Regular Expression Compiler,” . IEEE Conf. on Computer Design/VLSI in Computers . Oct 1983 . pp. 656 – 665 .
   Google Scholar
• Kumar , S . 2006 . Algorithms to accelerate multiple regular expressions matching for deep packet inspection . in ACM SIGCOMM Computer Communication Review , 36 ( 4 ) : 339 – 350 .
   Web of Science ®Google Scholar
• McNaughton , R and Yamada , H . 1960 . Regular Expressions and State Graphs for Automata . in IEEE Transactions on Electronic Computers , 9 : 39 – 47 .
   Google Scholar
• Mukhopadhyay , A . 1979 . Hardware algorithms for non-numeric computation . in IEEE Transactions on Computers , 28 : 384 – 394 .
   Web of Science ®Google Scholar
• PCRE: Perl Compatible Regular Expressions website, http://www.pcre.org/ (last accessed 2007)
   Google Scholar
• Roesch , M . “Snort: Lightweight intrusion detection for networks,” . In Proc. 13th Systems Administration Conference (LISA) . November 7–12 1999 . pp. 229 – 238 . Seattle, WA : USENIX Association .
   Google Scholar
• SafeNet Inc. http://www.safenet-inc.com (last accessed 2007)
   Google Scholar
• Sidhu , R and Prasanna , VK . “Fast Regular Expression Matching using FPGAs,” . IEEE Symposium on Field-Programmable Custom Computing Machines(FCCM’01) . April 2001 .
   Google Scholar
• Snort official web site . http://www.snort.org (last accessed 2007)
   Google Scholar
• Sourdis , I and Pnevmatikatos , D . April 20–23 2004 . “Pre-decoded CAMs for Efficient and High-Speed NIDS Pattern Matching,” . In IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM'04) , April 20–23 , 258 – 267 . Napa, CA : IEEE Computer Society Press . 2004
   Google Scholar
• Sourdis , I , Pnevmatikatos , D , Wong , S and Vassiliadis , S . “A Reconfigurable Perfect-Hashing Scheme for Packet Inspection,” . Proceedings of 15th Int’l Conf. on Field Programmable Logic and Applications (FPL’05) . Aug. 24–26 2005 . pp. 644 – 647 .
   Google Scholar
• Sourdis , I , Bispo , J , Cardoso , JMP and Vassiliadis , S . 2008 . “Regular Expression Matching in Reconfigurable Hardware,” . The Journal of VLSI Signal Processing Systems , Springer, 2008
   Google Scholar
• Tarari Inc. http://www.tarari.com (http://www.tarari.com) (last accessed 2007)
   Google Scholar
• Winnow Technologies Inc.http://winnowtechnologies.com (last accessed 2007)
   Google Scholar
• Xilinx Inc. May 20 2005 . Using Look-Up Tables as Shift Registers (SRL16) in Spartan-3 Generation FPGAs May 20 , 2005 XAPP465 (v1.1)
   Google Scholar