Sciweavers

124 search results - page 18 / 25
» Antichain Algorithms for Finite Automata
Sort
View
ASE
2005
137views more  ASE 2005»
13 years 7 months ago
Rewriting-Based Techniques for Runtime Verification
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...
Grigore Rosu, Klaus Havelund
ICC
2007
IEEE
144views Communications» more  ICC 2007»
14 years 1 months ago
A Deterministic Cost-effective String Matching Algorithm for Network Intrusion Detection System
—Network Intrusion Detection Systems (NIDS) are more and more important in today’s network security for identifying and preventing malicious attacks over the network. This pape...
Nen-Fu Huang, Yen-Ming Chu, Chen-Ying Hsieh, Chi-H...
ICC
2007
IEEE
137views Communications» more  ICC 2007»
14 years 1 months ago
A Novel Algorithm and Architecture for High Speed Pattern Matching in Resource-Limited Silicon Solution
— Network Intrusion Detection Systems (NIDS) are more and more important for identifying and preventing the malicious attacks over the network. This paper proposes a novel cost-e...
Nen-Fu Huang, Yen-Ming Chu, Chi-Hung Tsai, Chen-Yi...
ANCS
2006
ACM
14 years 1 months ago
Advanced algorithms for fast and scalable deep packet inspection
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
Sailesh Kumar, Jonathan S. Turner, John Williams
SIGCOMM
2006
ACM
14 years 1 months ago
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
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...
Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patr...