Lukáš Holík

Other Results

• 2022

  Low-Level Bi-Abduction (Artifact), other unclassified results, 2022
  Authors: ROGALEWICZ, A.; ŠOKOVÁ, V.; VOJNAR, T.; HOLÍK, L.; PERINGER, P.; ZULEGER, F.

  Low-Level Bi-Abduction (technical report), report, 2022
  Authors: HOLÍK, L.; PERINGER, P.; ROGALEWICZ, A.; ŠOKOVÁ, V.; VOJNAR, T.; ZULEGER, F.

• 2020

  Learning Probabilistic Automata in the Context of IEC 104, report, 2020
  Authors: HAVLENA, V.; HOLÍK, L.; MATOUŠEK, P.

  String Constraints with Concatenation and Transducers Solved Efficiently (Technical Report), report, 2020
  Authors: HOLÍK, L.; JANKŮ, P.; VOJNAR, T.; LIN, A.; RUMMER, P.

• 2019

  Automata Terms in a Lazy WSkS Decision Procedure (Technical Report), report, 2019
  Authors: HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; VOJNAR, T.

  Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report), report, 2019
  Authors: HOLÍK, L.; HOLÍKOVÁ, L.; LENGÁL, O.; VOJNAR, T.; SAARIKIVI, O.; VEANES, M.

• 2018

  Simulation Algorithms for Symbolic Automata (Technical Report), report, 2018
  Authors: HOLÍK, L.; LENGÁL, O.; SÍČ, J.; VOJNAR, T.; VEANES, M.

• 2017

  Counterexample Validation and Interpolation-Based Refinement for Forest Automata, report, 2017
  Authors: HRUŠKA, M.; HOLÍK, L.; LENGÁL, O.; ROGALEWICZ, A.; VOJNAR, T.

  Lazy Automata Techniques for WS1S, report, 2017
  Authors: FIEDOR, T.; HOLÍK, L.; JANKŮ, P.; LENGÁL, O.; VOJNAR, T.

• 2016

  From Low-Level Pointers to High-Level Containers, Technical Report No. FIT-TR-2015-03, report, 2016
  Authors: DUDKA, K.; HOLÍK, L.; PERINGER, P.; TRTÍK, M.; VOJNAR, T.

• 2013

  Fully Automated Shape Analysis Based on Forest Automata, report, 2013
  Authors: HOLÍK, L.; LENGÁL, O.; ROGALEWICZ, A.; ŠIMÁČEK, J.; VOJNAR, T.

  Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata, report, 2013
  Authors: HOLÍK, L.; JONSSON, B.; LENGÁL, O.; VOJNAR, T.; TRINH, Q.; ABDULLA, P.

• 2011

  Advanced Ramsey-based Büchi Automata Inclusion Testing, report, 2011
  Authors: ABDULLA, P.; CHEN, Y.; CLEMENTE, L.; HOLÍK, L.; HONG, C.; MAYR, R.; VOJNAR, T.

  Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata, report, 2011
  Authors: HOLÍK, L.; LENGÁL, O.; ŠIMÁČEK, J.; VOJNAR, T.

  Forest Automata for Verification of Heap Manipulation, report, 2011
  Authors: HOLÍK, L.; ROGALEWICZ, A.; ŠIMÁČEK, J.; VOJNAR, T.; HABERMEHL, P.

• 2010

  Simulation Subsumption in Ramsey-based Büchi Automata Universality and Inclusion Testing, report, 2010
  Authors: HOLÍK, L.; VOJNAR, T.; CHEN, Y.; MAYR, R.; HONG, C.; ABDULLA, P.; CLEMENTE, L.

  When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata), report, 2010
  Authors: HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; CHEN, Y.; MAYR, R.

• 2009

  Mediating for Reduction (On Minimizing Alternating Büchi Automata), report, 2009
  Authors: HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; CHEN, Y.

  Mediating for Reduction (On Minimizing Alternating Büchi Automata), report, 2009
  Authors: ABDULLA, P.; HOLÍK, L.; CHEN, Y.; VOJNAR, T.

  Optimizing an LTS-Simulation Algorithm, report, 2009
  Authors: HOLÍK, L.; ŠIMÁČEK, J.

• 2008

  A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata, report, 2008
  Authors: HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; KAATI, L.

  Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata, report, 2008
  Authors: HOLÍK, L.; VOJNAR, T.; BOUAJJANI, A.; HABERMEHL, P.; TOUILI, T.

  Composed Bisimulation for Tree Automata, report, 2008
  Authors: HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; BOUAJJANI, A.; KAATI, L.

  Computing Simulations over Tree Automata: Efficient Techniques for Reducing Tree Automata, report, 2008
  Authors: HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; BOUAJJANI, A.; KAATI, L.