Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection
Abstract elided by the publisher.
Related papers
- GPU-based NFA implementation for memory efficient high speed regular expression matching PPoPP 2012
- Conservative vs. optimistic parallelization of stateful network intrusion detection PPoPP 2007
- Under-Approximating Cut Sets for Reachability in Large Scale Automata Networks CAV 2013
- Mata: A Fast and Simple Finite Automata Library TACAS 2024
- Synthesizing Context-free Grammars from Recurrent Neural Networks TACAS 2021
- Proof transfer for fast certification of multiple approximate neural networks OOPSLA 2022
- Timed Automata Verification and Synthesis via Finite Automata Learning TACAS 2023
- A Unified Approach to the Deadlock Detection Problem in Networks of Communicating Finite State Machines CAV 1990