124 search results - page 21 / 25 » Antichain Algorithms for Finite Automata |
ANCS
2007
ACM
13 years 11 months ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
ACSAC
2003
IEEE
14 years 19 days ago
2003
IEEE
This paper addresses the problem of detecting masquerading, a security attack in which an intruder assumes the identity of a legitimate user. Many approaches based on Hidden Marko...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
ICGI
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present an exact algorithm for identification of deterministic finite automata (DFA) which is based on satisfiability (SAT) solvers. Despite the size of the low level ...
CEC
2003
IEEE
14 years 19 days ago
2003
IEEE
Learning Deterministic Finite Automata (DFA) is a hard task that has been much studied within machine learning and evolutionary computation research. This paper presents a new met...