25 search results - page 2 / 5 » A regular expression matching using non-deterministic finite... |
CONEXT
2007
ACM
13 years 8 months ago
2007
ACM
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...
ANCS
2007
ACM
13 years 9 months ago
2007
ACM
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
ISOLA
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Regular expressions and their extensions have become a major component of industry-standard specification languages such as PSL/Sugar ([2]). The model checking procedure...
SIGCOMM
2006
ACM
13 years 11 months ago
2006
ACM
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
GLOBECOM
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--Regular expression (Regex) becomes the standard signature language for security and application detection. Deterministic finite automata (DFAs) are widely used to perform...