This repository contains a tool for (language non-preserving) reduction of non-deterministic finite automata (NFAs) wrt a probabilistic model (see the technical report) for more details. The particular setting considered here is the reduction of NFAs obtained from PCREs (Perl compatible regular expressions) that occur in Snort rules.
experiments/- the setting of our experimentsnetbench/- the Netbench tool that we use to transform PCREs into NFAspreproc/- a bunch of small programs used for pre-processing network traffic PCAP filesreduce/- the tool performing the reduction itselfregexps/- regular expressions that we have collected
- Milan Češka 📧
<ceskam (at) fit.vutbr.cz> - Vojtěch Havlena 📧
<ihavlena (at) fit.vutbr.cz>(corresponding author) - Lukáš Holík 📧
<holik (at) fit.vutbr.cz> - Ondřej Lengál 📧
<lengal (at) fit.vutbr.cz> - Tomáš Vojnar 📧
<vojnar (at) fit.vutbr.cz>