3 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.FL2019
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…
cs.AR2016★ 3 cited
HADES: Microprocessor Hazard Analysis via Formal Verification of Parameterized Systems
Lukáš Charvát, Aleš Smrčka, Tomáš Vojnar
HADES is a fully automated verification tool for pipeline-based microprocessors that aims at flaws caused by improperly handled data hazards. It focuses on single-pipeline micropro…
cs.LO2015★ 3 cited
Nested Antichains for WS1S
Tomas Fiedor, Lukas Holik, Ondrej Lengal +1
We propose a novel approach for coping with alternating quantification as the main source of nonelementary complexity of deciding WS1S formulae. Our approach is applicable within t…