5 citations · 29 across the 26 of their papers we have counts for
5 papers · 1 filter
Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report)
Lukáš Holík, Ondřej Lengál, Olli Saarikivi +3
We propose an efficient algorithm for determinising counting automata (CAs), i.e., finite automata extended with bounded counters. The algorithm avoids unfolding counters into cont…
PredatorHP Attacks Interval-Sized Regions
Michal Kotoun, Petr Peringer, Veronika Šoková +1
This paper describes shortly the basic principles of the PredatorHP (Predator Hunting Party) shape analyzer and presents its recent improvements. One of the most visible changes is…
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…
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…
2LS: Heap Analysis and Memory Safety (Competition Contribution)
Viktor Malik, Martin Hruska, Peter Schrammel +1
2LS is a framework for analysis of sequential C programs that can verify and refute program assertions and termination. The 2LS framework is built upon the CPROVER infrastructure a…