3 papers
cs.LO2019
Automata Terms in a Lazy WSkS Decision Procedure (Technical Report)
Vojtěch Havlena, Lukáš Holík, Ondřej Lengál +1
We propose a lazy decision procedure for the logic WSkS. It builds a term-based symbolic representation of the state space of the tree automaton (TA) constructed by the classical W…
cs.FL2019
Simulations in Rank-Based Büchi Automata Complementation (Technical Report)
Yu-Fang Chen, Vojtěch Havlena, Ondřej Lengál
Complementation of Büchi automata is an essential technique used in some approaches for termination analysis of programs. The long search for an optimal complementation constructio…
cs.FL2019
Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata
Milan Češka, Vojtěch Havlena, Lukáš Holík +6
Deep packet inspection via regular expression (RE) matching is a crucial task of network intrusion detection systems (IDSes), which secure Internet connection against attacks and s…