1 citations · 6 across the 10 of their papers we have counts for
6 papers · 1 filter
Complementing Emerson-Lei Elevator Automata (Technical Report)
Ondrej Alexaj, Vojtěch Havlena, Ondřej Lengál +2
Büchi elevator automata naturally appear in several areas of formal methods as a structural expressibly-equivalent subclass of Büchi automata where every strongly connected compone…
String Solving with Stabilization and Transducers (Technical Report)
David Chocholatý, Vojtěch Havlena, Lukáš Holík +2
We generalize an efficient automata-based approach to string constraint solving, the stabilization-based method behind the solver Z3-Noodler, to support relational constraints repr…
Mata, a Fast and Simple Finite Automata Library (Technical Report)
David Chocholatý, Tomáš Fiedor, Vojtěch Havlena +4
Mata is a well-engineered automata library written in C++ that offers a unique combination of speed and simplicity. It is meant to serve in applications such as string constraint s…
Modular Mix-and-Match Complementation of Büchi Automata (Technical Report)
Vojtěch Havlena, Ondřej Lengál, Yong Li +2
Complementation of nondeterministic Büchi automata (BAs) is an important problem in automata theory with numerous applications in formal verification, such as termination analysis…
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…
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…