4 citations · 6 across the 2 of their papers we have counts for
3 papers
cs.FL2023
Optimizing an LTS-Simulation Algorithm (Technical Report)
Lukáš Holík, Jiří Šimáček
When comparing the fastest algorithm for computing the largest simulation preorder over Kripke structures with the one for labeled transition systems (LTS), there is a noticeable t…
cs.LO2013★ 2 cited
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…
cs.LO2013★ 4 cited
The Tree Width of Separation Logic with Recursive Definitions
Radu Iosif, Adam Rogalewicz, Jiri Simacek
Separation Logic is a widely used formalism for describing dynamically allocated linked data structures, such as lists, trees, etc. The decidability status of various fragments of…