Sciweavers

42 search results - page 4 / 9
» An improved DFA for fast regular expression matching
Sort
View
CONEXT
2007
ACM
13 years 11 months ago
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
Michela Becchi, Patrick Crowley
RAID
2010
Springer
13 years 5 months ago
Improving NFA-Based Signature Matching Using Ordered Binary Decision Diagrams
Network intrusion detection systems (NIDS) make extensive use of regular expressions as attack signatures. Internally, NIDS represent and operate these signatures using finite au...
Liu Yang, Rezwana Karim, Vinod Ganapathy, Randy Sm...
CSR
2006
Springer
13 years 11 months ago
Fast Motif Search in Protein Sequence Databases
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
Elena Zheleva, Abdullah N. Arslan
RAID
2009
Springer
14 years 1 months ago
Multi-byte Regular Expression Matching with Speculation
Intrusion prevention systems determine whether incoming traffic matches a database of signatures, where each signature in the database represents an attack or a vulnerability. IPSs...
Daniel Luchaup, Randy Smith, Cristian Estan, Somes...
ANCS
2007
ACM
13 years 11 months ago
Compiling PCRE to FPGA for accelerating SNORT IDS
Deep Payload Inspection systems like SNORT and BRO utilize regular expression for their rules due to their high expressibility and compactness. The SNORT IDS system uses the PCRE ...
Abhishek Mitra, Walid A. Najjar, Laxmi N. Bhuyan