2 files

APPREAL (APProximate REduction of Automata and Languages) tool used to obtain experimental results in TACAS '18 paper: Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection

posted on 13.04.2018, 14:58 authored by Milan Češka, Vojtěch Havlena, Lukáš Holík, Ondřej Lengál, Tomáš Vojnar
This is an artifact containing the tool APPREAL (APProximate REduction of Automata and Languages) used to obtain experimental results in the following paper accepted for publication at TACAS'18:
M. Ceska, V. Havlena, L. Holik, O. Lengal, and T. Vojnar. Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection.

The approach outlines in the related TACAS'18 paper is implemented in a Python prototype in this repository. Other file type include openly accessible C-specific .c and .h formats, .html, Perl (.pcre) and openly-accessible text file formats.

The subdirectory .src contains source code relating to the reduction of NFAs (nondeterministic finite automata) obtained from PCREs (Perl compatible regular expressions) that occur in [Snort](https://www.snort.org) rules:

* `experiments/` - the setting of our experiments
* `netbench/` - the Netbench tool that we use to transform PCREs into NFAs
* `preproc/` - a bunch of small programs used for pre-processing network traffic PCAP files
* `reduce/` - the tool performing the reduction itself
* `regexps/` - regular expressions that we have collected

The subdirectory .packages contains required software packages and a shell file with bash script (install.sh) to install these packages,

Virtual Machine

The artifact is prepared to run on the TACAS'18 artifact evaluation virtual machine available here: https://doi.org/10.6084/m9.figshare.5896615.v1

2048 MiB of memory should be sufficient to reproduce the results from Tables 1a and 1b in the related proceedings paper, for reproducing the experiments from Tables 2 and 3, it is recommended to set the memory to 8192 MiB or more.

Detailed instructions on how to reproduce results from the TACAS'18 paper are available in README.txt


The related TACAS'18 paper considers the problem of approximate reduction of non-deterministic automata that appear in hardware-accelerated network intrusion detection systems (NIDSes). We define an error distance of a reduced automaton from the original one as the probability of packets being incorrectly classified by the reduced automaton (wrt the probabilistic distribution of packets in the network traffic). We use this notion to design an approximate reduction procedure that achieves a great size reduction (much beyond the state-of-the-art language preserving techniques) with a controlled and small error. We have implemented our approach and evaluated it on use cases from SNORT, a popular NIDS. Our results provide experimental evidence that the method can be highly efficient in practice, allowing NIDSes to follow the rapid growth in the speed of networks.


Research Data Support

Research data support provided by Springer Nature.