Mgr. Lukáš Holík, Ph.D. (DBLP might be more up-to-date)

2018
  • L. Holík, P. Janků, A.W. Lin, P. Rümmer and T. Vojnar. String Constraints with Concatenation and Transducers Solved Efficiently. In POPL'18, accepted, to appear. ACM Trans. Comput. Log.,
2017
  • P.A. Abdulla, M.F. Atig, Y. Chen, B.P. Diep, L. Holík, A. Rezine and P. Rümmer. Flatten and conquer: A framework for efficient analysis of string constraints. In PLDI'17. pp. 602-617. ACM Trans. Comput. Log.. [DOI]
  • P.A. Abdulla, F. Haziza, L. Holík, B. Jonsson and A. Rezine. An integrated specification and verification technique for highly concurrent data structures for highly concurrent data structures. STTT. vol. 19, no. 5, pp. 549-563. [DOI]
  • T. Fiedor, L. Holík, P. Janků, O. Lengál and T. Vojnar. Lazy Automata Techniques for WS1S. In TACAS'17. LNCS, vol. 10205, pp. 407-425. Springer. [DOI] [Preprint]
  • L. Holík, M. Hruška, O. Lengál, A. Rogalewicz and T. Vojnar. Counterexample Validation and Interpolation-Based Refinement for Forest Automata. In VMCAI'16. LNCS, vol. 10145, pp. 288-309. Springer. [DOI] [Preprint]
  • L. Holík, R. Meyer, T. Vojnar and S. Wolff. Effect Summaries for Thread-Modular Analysis - Sound Analysis Despite an Unsound Heuristic. In SAS'17. LNCS, vol. 10422, pp. 169-191. Springer. [DOI]
  • L. Holík, M. Hruška, O. Lengál, A. Rogalewicz, J. Šimáček and T. Vojnar. Forester: From Heap Shapes to Automata Predicates - (Competition Contribution). In TACAS'17. LNCS, vol. 10206, pp. 365-369. Springer. [DOI]
2016
  • P.A. Abdulla, F. Haziza and L. Holík. Parameterized Verification through View Abstraction. STTT. vol. 18, no. 5, pp. 495-516. [DOI]
  • P.A. Abdulla, L. Holík, B. Jonsson, O. Lengál, C.Q. Trinh and T. Vojnar. Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. Acta Inf.. vol. 53, no. 4, pp. 357-385. [DOI]
  • R. Almeida, L. Holík and R. Mayr. Reduction of Nondeterministic Tree Automata. In TACAS'16. LNCS, vol. 9636, pp. 717-735. Springer. [DOI] [Preprint]
  • K. Dudka, L. Holík, P. Peringer, M. Trtík and T. Vojnar. From Low-Level Pointers to High-Level Containers. In VMCAI'16. LNCS, vol. 9583, pp. 431-452. Springer. [DOI] [Preprint]
  • F. Haziza, L. Holík, R. Meyer and S. Wolff. Pointer Race Freedom. In VMCAI'16. LNCS, vol. 9583, pp. 393-412. Springer. [DOI] [Preprint]
  • L. Holík, M. Kotoun, P. Peringer, V. Soková, M. Trtík and T. Vojnar. Predator Shape Analysis Tool Suite. In HVC'16. LNCS, vol. 10028, pp. 202-209. [DOI]
  • L. Holík, M. Hruška, O. Lengál, A. Rogalewicz, J. Šimáček and T. Vojnar. Run Forester, Run Backwards! - (Competition Contribution). In TACAS'16. LNCS, vol. 9636, pp. 923-926. Springer. [DOI]
  • L. Holík, R. Meyer and S. Muskalla. Summaries for Context-Free Games. In FSTTCS'16. LIPIcs, vol. 65, pp. 41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [DOI] [Preprint]
2015
  • P.A. Abdulla, M.F. Atig, Y. Chen, L. Holík, A. Rezine, P. Rümmer and J. Stenman. Norn: An SMT Solver for String Constraints. In CAV'15. LNCS, vol. 9206, pp. 462-469. Springer. [DOI]
  • P.A. Abdulla, F. Haziza and L. Holík. View Abstraction - A Tutorial (Invited Paper). In SynCoP'15. OASICS, vol. 44, pp. 1-15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. [DOI]
  • L. Holík, M. Hruška, O. Lengál, A. Rogalewicz, J. Šimáček and T. Vojnar. Forester: Shape Analysis Using Tree Automata. In TACAS'15. LNCS, vol. 9035, pp. 432-435. January, 2015. Springer Berlin Heidelberg. [DOI] [Preprint]
  • T. Fiedor, L. Holík, O. Lengál and T. Vojnar. Nested Antichains for WS1S. In TACAS'15. LNCS, vol. 9035, pp. 658-674. January, 2015. Springer Berlin Heidelberg. [DOI] [Preprint]
  • L. Holík and R. Meyer. Antichains for the Verification of Recursive Programs. In NETYS'15. LNCS, vol. 9466, pp. 322-336. Springer. [DOI]
  • L. Holík, M. Isberner and B. Jonsson. Mediator Synthesis in a Component Algebra with Data. In Correct System Design - Symposium in Honor of Ernst-Rüdiger Olderog on the Occasion of His 60th Birthday, Oldenburg, Germany. LNCS, vol. 9360, pp. 238-259. Springer. [DOI]
2014
  • P.A. Abdulla, Y.-F. Chen, L. Holík and T. Vojnar. Mediating for reduction (on minimizing alternating Büchi automata). Theoretical Computer Science. vol. 552, no. 0, pp. 26-43. October, 2014. [DOI] [Preprint]
  • P. Abdulla, M. Atig, Y.-F. Chen, L. Holík, A. Rezine, P. Rümmer and J. Stenman. String Constraints for Verification. In CAV'14. LNCS, vol. 8559, pp. 150-166. Springer International Publishing. [DOI]
  • P. Abdulla, F. Haziza and L. Holík. Block Me If You Can!. In SAS'14. LNCS, vol. 8723, pp. 1-17. January, 2014. Springer International Publishing. [DOI]
2013
  • P.A. Abdulla, F. Haziza and L. Holík. All for the Price of Few. In VMCAI'13. LNCS, vol. 7737, pp. 476-495. Springer Berlin Heidelberg. [DOI]
  • P.A. Abdulla, F. Haziza, L. Holík, B. Jonsson and A. Rezine. An Integrated Specification and Verification Technique for Highly Concurrent Data Structures. In TACAS'13. LNCS, vol. 7795, pp. 324-338. Springer Berlin Heidelberg. The EASCT award for the best paper at TACAS 2013. [DOI] [Preprint]
  • P.A. Abdulla, L. Holík, B. Jonsson, O. Lengál, C.Q. Trinh and T. Vojnar. Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. In ATVA'13. LNCS, vol. 8172, pp. 224-239. Springer International Publishing. [DOI] [Preprint]
  • L. Holík, O. Lengál, A. Rogalewicz, J. Šimáček and T. Vojnar. Fully Automated Shape Analysis Based on Forest Automata. In CAV'13. LNCS, vol. 8044, pp. 740-755. Springer Berlin Heidelberg. [DOI] [Preprint]
2012
  • P. Habermehl, L. Holík, A. Rogalewicz, J. Šimáček and T. Vojnar. Forest Automata for Verification of Heap Manipulation. Formal Methods in System Design. vol. 1, pp. 83-106. [DOI] [Preprint]
2011
  • P.A. Abdulla, Y.-F. Chen, L. Clemente, L. Holík, C.-D. Hong, R. Mayr and T. Vojnar. Advanced Ramsey-Based Büchi Automata Inclusion Testing. In CONCUR'11. LNCS, vol. 6901, pp. 187-202. Springer Berlin Heidelberg. [DOI] [Preprint]
  • P. Habermehl, L. Holík, A. Rogalewicz, J. Šimáček and T. Vojnar. Forest Automata for Verification of Heap Manipulation. In CAV'11. LNCS, vol. 6806, pp. 424-440. Springer Berlin Heidelberg. [DOI] [Preprint]
  • L. Holík, O. Lengál, J. Šimáček and T. Vojnar. Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata. In ATVA'11. LNCS, vol. 6996, pp. 243-258. Springer Berlin Heidelberg. [DOI] [Preprint]
  • L. Holík. Simulations and Antichains for Efficient Handling of Finite Automata. Thesis at: Department of Intelligent Systems FIT BUT. Brno, CZ, [Preprint]
2010
  • P.A. Abdulla, Y.-F. Chen, L. Clemente, L. Holík, C.-D. Hong, R. Mayr and T. Vojnar. Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing. In CAV'10. LNCS, vol. 6174, pp. 132-147. Springer Berlin Heidelberg. [DOI] [Preprint]
  • P.A. Abdulla, Y.-F. Chen, L. Holík, R. Mayr and T. Vojnar. When Simulation Meets Antichains. In TACAS'10. LNCS, vol. 6015, pp. 158-174. Springer Berlin Heidelberg. The EATCS award for best theoretical paper at ETAPS 2010. [DOI] [Preprint]
  • L. Holík and T. Vojnar. Simulations and Aintichains for Efficient Handling of Tree Automata. Brno, CZ, FIT Monograph, Faculty of Information Technology BUT.
2009
  • P.A. Abdulla, A. Bouajjani, L. Holík, L. Kaati and T. Vojnar. Composed Bisimulation for Tree Automata. International Journal of Foundations of Computer Science. vol. 04, pp. 685-700. [DOI]
  • P.A. Abdulla, Y.-F. Chen, L. Holík and T. Vojnar. Mediating for Reduction (on Minimizing Alternating Büchi Automata). In FSTTCS'09. Leibniz International Proceedings in Informatics (LIPIcs), vol. 4, pp. 1-12. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. [DOI] [Preprint]
  • A.P. Abdulla, L. Holík, L. Kaati and T. Vojnar. A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. MEMICS'08. vol. 2009, no. 251, pp. 27-48. [DOI] [Preprint]
  • L. Holík and J. Šimáček. Optimizing an LTS-Simulation Algorithm. In MEMICS'09. Znojmo, CZ, pp. 93-101. Faculty of Informatics MU.
2008
  • P.A. Abdulla, A. Bouajjani, L. Holík, L. Kaati and T. Vojnar. Composed Bisimulation for Tree Automata. In CIAA'08. LNCS, vol. 5148, pp. 212-222. Springer Berlin Heidelberg. The best paper award of CIAA'08. [DOI] [Preprint]
  • P.A. Abdulla, A. Bouajjani, L. Holík, L. Kaati and T. Vojnar. Computing Simulations over Tree Automata. In TACAS'08. LNCS, vol. 4963, pp. 93-108. Springer Berlin Heidelberg. [DOI] [Preprint]
  • A.P. Abdulla, L. Holík, L. Kaati and Tomáš Vojnar. A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. In MEMICS'08. Brno, CZ, pp. 3-11. Faculty of Informatics MU. [Preprint]
  • A. Bouajjani, P. Habermehl, L. Holík, T. Touili and T. Vojnar. Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. In CIAA'08. LNCS, vol. 5148, pp. 57-67. Springer Berlin Heidelberg. [DOI] [Preprint]
2007
  • L. Holík and A. Rogalewicz. Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. In MEMICS'07. Znojmo, CZ, pp. 59-66. [Preprint]

All publications (with ISBN, etc.)...