4 citations · 7 across the 4 of their papers we have counts for
4 papers
Simulations and Antichains for Efficient Handling of Finite Automata
Lukáš Holík
This thesis is focused on techniques for finite automata and their use in practice, with the main emphasis on nondeterministic tree automata. This concerns namely techniques for si…
Effect Summaries for Thread-Modular Analysis
Lukáš Holík, Roland Meyer, Tomáš Vojnar +1
We propose a novel guess-and-check principle to increase the efficiency of thread-modular verification of lock-free data structures. We build on a heuristic that guesses candidates…
Lazy Automata Techniques for WS1S
Tomáš Fiedor, Lukáš Holík, Petr Janků +2
We present a new decision procedure for the logic WS1S. It originates from the classical approach, which first builds an automaton accepting all models of a formula and then tests…
Fully Automated Shape Analysis Based on Forest Automata
Lukas Holik, Ondrej Lengal, Adam Rogalewicz +2
Forest automata (FA) have recently been proposed as a tool for shape analysis of complex heap structures. FA encode sets of tree decompositions of heap graphs in the form of tuples…