Publikace

• 2024

  HAVLENA, V.; HEČKO, M.; HOLÍK, L.; LENGÁL, O.; HABERMEHL, P. Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. Proceedings of CAV'24. Lecture Notes in Computer Science. Montreal: Springer Verlag, 2024. s. 42-67. ISSN: 0302-9743.
  Detail

• 2023

  HOLÍK, L.; ŠEDÝ, M. Utilization of Repeating Substructures for Efficient Representation of Automata (Technical Report). Brno: 2023. s. 1-12.
  Detail | WWW

  CHEN, Y.; CHOCHOLATÝ, D.; HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; SÍČ, J. Solving String Constraints with Lengths by Stabilization. Proceedings of the ACM on Programming Languages, 2023, roč. 7, č. 10, s. 2112-2141. ISSN: 2475-1421.
  Detail | WWW

  HAVLENA, V.; CHOCHOLATÝ, D.; LENGÁL, O.; HOLÍK, L.; SÍČ, J.; BLAHOUDEK, F.; CHEN, Y. Word Equations in Synergy with Regular Constraints. In Proceedings of FM'23. Lecture Notes in Computer Science. Lübeck: Springer Verlag, 2023. s. 403-423. ISSN: 0302-9743.
  Detail

  HAVLENA, V.; MATOUŠEK, P.; RYŠAVÝ, O.; HOLÍK, L. Accurate Automata-Based Detection of Cyber Threats in Smart Grid Communication. IEEE Transactions on Smart Grid, 2023, roč. 2023, č. 14, s. 2352-2366. ISSN: 1949-3053.
  Detail | WWW

  HOLÍK, L.; HOLÍKOVÁ, L.; SÍČ, J.; VOJNAR, T. Fast Matching of Regular Patterns with Synchronizing Counting (Technical Report). Ithaca: 2023. s. 1-32.
  Detail | WWW

  HOLÍK, L.; HOLÍKOVÁ, L.; SÍČ, J.; VOJNAR, T. Fast Matching of Regular Patterns with Synchronizing Counting. In Foundations of Software Science and Computation Structures. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2023. s. 392-412. ISSN: 0302-9743.
  Detail | WWW | Plný text v Digitální knihovně

  HOLÍK, L.; HRUŠKA, M.; SÍČ, J.; VARGOVČÍK, P.; FIEDOR, T.; ROGALEWICZ, A. Reasoning about Regular Properties: A Comparative Study. In Automated Deduction - CADE 29. Lecture Notes in Computer Science. Cham: Springer Nature Switzerland AG, 2023. s. 286-306. ISSN: 0302-9743.
  Detail

• 2022

  HOLÍK, L.; PERINGER, P.; ROGALEWICZ, A.; ŠOKOVÁ, V.; VOJNAR, T.; ZULEGER, F. Low-Level Bi-Abduction. In 36th European Conference on Object-Oriented Programming (ECOOP 2022). Leibniz International Proceedings in Informatics, LIPIcs. Leibniz International Proceedings in Informatics. Wadern: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2022. s. 1-30. ISBN: 978-3-95977-225-9. ISSN: 1868-8969.
  Detail | WWW

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

  HOLÍKOVÁ, L.; HOLÍK, L.; HOMOLIAK, I.; LENGÁL, O.; VEANES, M.; VOJNAR, T. Counting in Regexes Considered Harmful: Exposing ReDoS Vulnerability of Nonbacktracking Matchers. In Proceedings of the 31st USENIX Security Symposium. Boston, MA: USENIX, 2022. s. 4165-4182. ISBN: 978-1-939133-31-1.
  Detail | WWW

  ROGALEWICZ, A.; ŠOKOVÁ, V.; VOJNAR, T.; HOLÍK, L.; PERINGER, P.; ZULEGER, F. Low-Level Bi-Abduction (Artifact). Dagstuhl: 2022. s. 1-6.
  Detail | WWW

• 2021

  HOLÍK, L.; HRUŠKA, M. Towards Efficient Shape Analysis with Tree Automata. In Proceedings International Conference on Networked Systems. Lecture Notes in Computer Science. Lecture notes in Computer Science. Cham: Springer Verlag, 2021. s. 206-214. ISSN: 0302-9743.
  Detail

  HOLÍK, L.; VARGOVČÍK, P. Simplifying Alternating Automata for Emptiness Testing. In Programming Languages and Systems - 19th Asian Symposium, APLAS 2021, Chicago, IL, USA, October 17-18, 2021, Proceedings. Cham: Springer International Publishing, 2021. s. 243-264. ISBN: 978-3-030-89051-3.
  Detail | WWW

  HOLÍK, L.; ABDULLA, P.; ATIG, M.; BUI PHI, D.; CHEN, Y.; WU, Z. Solving Not-Substring Constraint with Flat Abstraction. In Programming Languages and Systems - 19th Asian Symposium, APLAS 2021, Chicago, IL, USA, October 17-18, 2021, Proceedings. 13008. Berlín: Springer International Publishing, 2021. s. 305-320. ISBN: 978-3-030-89051-3.
  Detail | WWW

  HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; VOJNAR, T. Automata Terms in a Lazy WSkS Decision Procedure. JOURNAL OF AUTOMATED REASONING, 2021, roč. 65, č. 7, s. 971-999. ISSN: 0168-7433.
  Detail | WWW

  MATOUŠEK, P.; HAVLENA, V.; HOLÍK, L. Efficient Modelling of ICS Communication For Anomaly Detection Using Probabilistic Automata. In Proceedings of IFIP/IEEE International Symposium on Integrated Network Management. Bordeaux: International Federation for Information Processing, 2021. s. 81-89. ISBN: 978-3-903176-32-4.
  Detail | WWW

• 2020

  HOLÍK, L.; JANKŮ, P.; VOJNAR, T.; LIN, A.; RUMMER, P. String Constraints with Concatenation and Transducers Solved Efficiently (Technical Report). New York: Springer International Publishing, 2020. s. 1-33.
  Detail | WWW

  HOLÍK, L.; ROGALEWICZ, A.; VOJNAR, T.; IOSIF, R. Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems. FORMAL METHODS IN SYSTEM DESIGN, 2020, roč. 55, č. 3, s. 137-170. ISSN: 0925-9856.
  Detail | WWW

  HAVLENA, V.; HOLÍK, L.; MATOUŠEK, P. Learning Probabilistic Automata in the Context of IEC 104. IT-TR-2020-01, Brno: Faculty of Information Technology BUT, 2020. s. 0-0.
  Detail | WWW

  HOLÍK, L. Finite Automata Methods for Automated Reasoning. Brno: Faculty of Information Technology BUT, 2020. s. 0-0.
  Detail | WWW

  ČEŠKA, M.; HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; VOJNAR, T. Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. International Journal on Software Tools for Technology Transfer, 2020, roč. 22, č. 5, s. 523-539. ISSN: 1433-2779.
  Detail | WWW

  HOLÍKOVÁ, L.; HOLÍK, L.; LENGÁL, O.; SAARIKIVI, O.; VEANES, M.; VOJNAR, T. Regex Matching with Counting-Set Automata. Proceedings of the ACM on Programming Languages, 2020, roč. 4, č. 11, s. 1-30. ISSN: 2475-1421.
  Detail | WWW

  HOLÍK, L.; JANKŮ, P.; BUI PHI, D.; CHEN, Y.; LIN, H.; WU, W.; ABDULLA, P.; ATIG, M. Efficient handling of string-number conversion. In Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Implementation. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). New York: Association for Computing Machinery, 2020. s. 943-957. ISBN: 978-1-4503-7613-6.
  Detail | WWW

  HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; VALEŠ, O.; VOJNAR, T. Antiprenexing for WSkS: A Little Goes a Long Way. In EPiC Series in Computing. Proceedings of LPAR-23. Manchester: EasyChair, 2020. s. 298-316. ISSN: 2398-7340.
  Detail | WWW

• 2019

  CHEN, Y.; CHIANG, C.; HOLÍK, L.; KAO, W.; LIN, H.; VOJNAR, T.; WEN, Y.; WU, W. J-ReCoVer: Java Reducer Commutativity Verifier. In Proceedings of 17th Asian Symposium on Programming Languages and Systems (APLAS). Lecture Notes in Computer Science. Cham: Springer International Publishing, 2019. s. 357-366. ISBN: 978-3-030-34174-9.
  Detail | WWW

  ABDULLA, P.; ATIG, M.; CHEN, Y.; BUI PHI, D.; HOLÍK, L.; REZINE, A.; RUMMER, P. Trau: SMT solver for string constraints. In Proceedings of the 18th Conference on Formal Methods in Computer-Aided Design. Austin: FMCAD Inc., 2019. s. 165-169. ISBN: 978-0-9835678-8-2.
  Detail | WWW

  VARGOVČÍK, P.; HOLÍK, L. Verification of String Programs via Automata. PEFnet 2019 Extended Abstracts. Brno: Mendel University in Brno, 2019. s. 155-156. ISBN: 978-80-7509-692-0.
  Detail | WWW

  HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; VOJNAR, T. Automata Terms in a Lazy WSkS Decision Procedure. In Proceedings of 27th International Conference on Automated Deduction (CADE-27). Lecture Notes in Computer Science. Natal: Springer Verlag, 2019. s. 300-318. ISSN: 0302-9743.
  Detail | WWW

  HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; VOJNAR, T. Automata Terms in a Lazy WSkS Decision Procedure (Technical Report). Ithaca: 2019. s. 1-25.
  Detail | WWW

  FIEDOR, T.; HOLÍK, L.; LENGÁL, O.; VOJNAR, T. Nested Antichains for WS1S. Acta Informatica, 2019, roč. 56, č. 3, s. 205-228. ISSN: 0001-5903.
  Detail | WWW

  ABDULLA, P.; ATIG, M.; BUI PHI, D.; HOLÍK, L.; JANKŮ, P. Chain-Free String Constraints. In Proceedings of ATVA'19. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2019. s. 277-293. ISBN: 978-3-030-31783-6.
  Detail | WWW

  HOLÍK, L.; HOLÍKOVÁ, L.; LENGÁL, O.; VOJNAR, T.; SAARIKIVI, O.; VEANES, M. Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report). Ithaca: Cornell University Library, 2019. s. 1-19.
  Detail | WWW

  HOLÍK, L.; HOLÍKOVÁ, L.; LENGÁL, O.; VOJNAR, T.; SAARIKIVI, O.; VEANES, M. Succinct Determinisation of Counting Automata via Sphere Construction. In In Proc. of 17th Asian Symposium on Programming Languages and Systems - APLAS'19. Lecture Notes in Computer Science. Berlin Heidelberg: Springer Verlag, 2019. s. 468-489. ISSN: 0302-9743.
  Detail | WWW

  HAVLENA, V.; ČEŠKA, M.; HOLÍK, L.; KOŘENEK, J.; LENGÁL, O.; MATOUŠEK, D.; MATOUŠEK, J.; SEMRIČ, J.; VOJNAR, T. Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata. In Proceedings - 27th IEEE International Symposium on Field-Programmable Custom Computing Machines, FCCM 2019. San Diego, CA: Institute of Electrical and Electronics Engineers, 2019. s. 109-117. ISBN: 978-1-7281-1131-5.
  Detail | WWW

• 2018

  FIEDOR, T.; HOLÍK, L.; ROGALEWICZ, A.; VOJNAR, T.; SINN, M.; ZULEGER, F. From Shapes to Amortized Complexity. In Proceedings of VMCAI'18. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2018. s. 205-225. ISBN: 978-3-319-73720-1. ISSN: 0302-9743.
  Detail | WWW

  HOLÍK, L.; JANKŮ, P.; VOJNAR, T.; LIN, A.; RUMMER, P. String constraints with concatenation and transducers solved efficiently. Proceedings of the ACM on Programming Languages, 2018, roč. 2, č. 2, s. 96-127. ISSN: 2475-1421.
  Detail | WWW

  ČEŠKA, M.; HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; VOJNAR, T. Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. In Proceedings of TACAS'18. Lecture Notes in Computer Science. Thessaloniki: Springer Verlag, 2018. s. 155-175. ISSN: 0302-9743.
  Detail | WWW | Plný text v Digitální knihovně

  HOLÍK, L.; LENGÁL, O.; SÍČ, J.; VOJNAR, T.; VEANES, M. Simulation Algorithms for Symbolic Automata (Technical Report). Ithaca: 2018. s. 1-23.
  Detail | WWW

  HOLÍK, L.; HOLÍKOVÁ, L. Towards Smaller Invariants for Proving Coverability. In Computer Aided Systems Theory - EUROCAST 2017. Berlin Heidelberg: Springer Verlag, 2018. s. 109-116. ISBN: 978-3-319-74727-9.
  Detail | WWW

  HOLÍK, L.; LENGÁL, O.; SÍČ, J.; VOJNAR, T.; VEANES, M. Simulation Algorithms for Symbolic Automata. In Proc. of 16th International Symposium on Automated Technology for Verification and Analysis. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2018. s. 109-125. ISBN: 978-3-030-01089-8. ISSN: 0302-9743.
  Detail | WWW

• 2017

  HRUŠKA, M.; HOLÍK, L.; LENGÁL, O.; ROGALEWICZ, A.; VOJNAR, T. Counterexample Validation and Interpolation-Based Refinement for Forest Automata. Brno: Faculty of Information Technology BUT, 2017. s. 1-23.
  Detail

  FIEDOR, T.; HOLÍK, L.; JANKŮ, P.; LENGÁL, O.; VOJNAR, T. Lazy Automata Techniques for WS1S. arXiv:1701.06282: 2017. s. 0-0.
  Detail | WWW

  HOLÍK, L.; HRUŠKA, M.; LENGÁL, O.; ROGALEWICZ, A.; VOJNAR, T. Counterexample Validation and Interpolation-Based Refinement for Forest Automata. In Proceedings of VMCAI'17. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Cham: Springer Verlag, 2017. s. 288-309. ISBN: 978-3-319-52234-0. ISSN: 0302-9743.
  Detail | WWW

  FIEDOR, T.; HOLÍK, L.; JANKŮ, P.; LENGÁL, O.; VOJNAR, T. Lazy Automata Techniques for WS1S. In Proceedings of TACAS'17. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2017. s. 407-425. ISBN: 978-3-662-54576-8. ISSN: 0302-9743.
  Detail | WWW

  HRUŠKA, M.; HOLÍK, L.; LENGÁL, O.; ROGALEWICZ, A.; ŠIMÁČEK, J.; VOJNAR, T. Forester: From Heap Shapes to Automata Predicates. In Proceedings of TACAS'17. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2017. s. 365-369. ISBN: 978-3-662-54580-5.
  Detail | WWW

  HOLÍK, L.; ABDULLA, P.; HAZIZA, F.; JONSSON, B.; REZINE, A. An integrated specification and verification technique for highly concurrent data structures for highly concurrent data structures. International Journal on Software Tools for Technology Transfer, 2017, roč. 5, č. 19, s. 549-563. ISSN: 1433-2779.
  Detail | WWW

  HOLÍK, L.; MEYER, R.; VOJNAR, T.; WOLF, S. Effect Summaries for Thread-Modular Analysis. In SAS 2017: Static Analysis. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2017. s. 169-191. ISBN: 978-3-319-66706-5. ISSN: 0302-9743.
  Detail | WWW

  HOLÍK, L.; ABDULLA, P.; ATIG, M.; BUI PHI, D.; CHEN, Y.; REZINE, A.; RUMMER, P. Flatten and conquer: a framework for efficient analysis of string constraints. In Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation. ACM. New York: Association for Computing Machinery, 2017. s. 602-617. ISBN: 978-1-4503-4988-8.
  Detail | WWW

• 2016

  HOLÍK, L.; MEYER, R.; MUSKALLA, S. An Anti Chain-based Approach to Recursive Program Verification. In Proceedings of International Conference on Networked Systems. Lecture Notes in Computer Science (LNCS). Cham: Springer International Publishing, 2016. s. 322-336. ISBN: 978-3-319-26849-1.
  Detail | WWW

  HOLÍK, L.; MEYER, R.; WOLF, S.; HAZIZA, F. Pointer Race Freedom. In Verification, Model Checking, and Abstract Interpretation (VMCAI). Lecture Notes in Computer Science. Berlin: Springer Verlag, 2016. s. 393-412. ISBN: 978-3-662-49121-8.
  Detail | WWW

  DUDKA, K.; HOLÍK, L.; PERINGER, P.; TRTÍK, M.; VOJNAR, T. From Low-Level Pointers to High-Level Containers, Technical Report No. FIT-TR-2015-03. Brno: 2016. s. 1-28.
  Detail | WWW

  DUDKA, K.; HOLÍK, L.; PERINGER, P.; TRTÍK, M.; VOJNAR, T. From Low-Level Pointers to High-Level Containers. In Verification, Model Checking, and Abstract Interpretation (VMCAI). Lecture Notes in Computer Science. Berlin Heidelberg: Springer Verlag, 2016. s. 431-452. ISBN: 978-3-662-49121-8.
  Detail | WWW

  HOLÍK, L.; LENGÁL, O.; ROGALEWICZ, A.; SEKANINA, L.; VAŠÍČEK, Z.; VOJNAR, T. Towards Formal Relaxed Equivalence Checking in Approximate Computing Methodology. 2nd Workshop on Approximate Computing (WAPCO 2016). Prague: 2016. s. 1-6.
  Detail | WWW

  HRUŠKA, M.; LENGÁL, O.; ŠIMÁČEK, J.; VOJNAR, T.; HOLÍK, L.; ROGALEWICZ, A. Run Forester, Run Backwards! (Competition Contribution). In Proceedings of TACAS'16. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2016. s. 923-926. ISBN: 978-3-662-49673-2.
  Detail | WWW

  PERINGER, P.; ŠOKOVÁ, V.; TRTÍK, M.; VOJNAR, T.; HOLÍK, L.; KOTOUN, M. Predator Shape Analysis Tool Suite. In Proceedings of HVC 2016. Lecture Notes in Computer Science. Zurich: Springer International Publishing, 2016. s. 202-209. ISBN: 978-3-319-49052-6.
  Detail | WWW

  HOLÍK, L.; ALMEIDA, R.; MAYR, R. Reduction of Nondeterministic Tree Automata. In Tools and Algorithms for the Construction and Analysis of Systems. Volume 9636 of the series Lecture Notes in Computer Science. Berlin Heidelberg: Springer Verlag, 2016. s. 717-735. ISBN: 978-3-662-49673-2.
  Detail | WWW

  HOLÍK, L.; MEYER, R.; MUSKALLA, S. Summaries for Context-Free Games. In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs). Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016. s. 41-57. ISBN: 978-3-95977-027-9.
  Detail | WWW

• 2015

  HOLÍK, L.; HAZIZA, F.; ABDULLA, P. View Abstraction - A Tutorial. In 2nd International Workshop on Synthesis of Complex Parameters. OpenAccess Series in Informatics (OASIcs). OpenAccess Series in Informatics. Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2015. s. 1-15. ISBN: 978-3-939897-82-8. ISSN: 2190-6807.
  Detail

  HOLÍK, L.; ISBERNER, M.; JONSSON, B. Mediator Synthesis in a Component Algebra with Data. In Correct System Design. Lecture Notes in Computer Science. Berlin: Springer Verlag, 2015. s. 238-259. ISBN: 978-3-319-23505-9.
  Detail

  HOLÍK, L.; LENGÁL, O.; VOJNAR, T.; JONSSON, B.; TRINH, Q.; ABDULLA, P. Verification of heap manipulating programs with ordered data by extended forest automata. Acta Informatica, 2015, roč. 53, č. 4, s. 357-385. ISSN: 0001-5903.
  Detail | WWW

  HRUŠKA, M.; LENGÁL, O.; ŠIMÁČEK, J.; VOJNAR, T.; HOLÍK, L.; ROGALEWICZ, A. Forester: Shape Analysis Using Tree Automata (Competition Contribution). In Proceedings of TACAS'15. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2015. s. 432-435. ISBN: 978-3-662-46680-3.
  Detail | WWW

  FIEDOR, T.; HOLÍK, L.; LENGÁL, O.; VOJNAR, T. Nested Antichains for WS1S. In Proceedings of TACAS'15. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2015. s. 658-674. ISBN: 978-3-662-46680-3.
  Detail | WWW

  HOLÍK, L.; CHEN, Y.; REZINE, A.; RUMMER, P.; STENMAN, J.; ABDULLA, P.; ATIG, M. Norn: An SMT Solver for String Constraints. In Computer Aided Verification. Lecture Notes in Computer Science Volume 9206. Cham: Springer International Publishing, 2015. s. 462-469. ISBN: 978-3-319-21689-8.
  Detail

  HOLÍK, L.; ABDULLA, P.; HAZIZA, F. Parameterized verification through view abstraction. International Journal on Software Tools for Technology Transfer, 2015, roč. 2016, č. 5, s. 495-516. ISSN: 1433-2779.
  Detail | WWW

• 2014

  ABDULLA, P.; HAZIZA, F.; HOLÍK, L. Block Me If You Can! Context-Sensitive Parameterized Verification. In 21st International Static Analysis Symposium. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Berlin: Springer Verlag, 2014. s. 1-17. ISBN: 978-3-319-10935-0. ISSN: 0302-9743.
  Detail | WWW

  HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; CHEN, Y. Mediating for reduction (on minimizing alternating Buchi automata). Theoretical Computer Science, 2014, roč. 2014, č. 552, s. 26-43. ISSN: 0304-3975.
  Detail | WWW

  HOLÍK, L.; ABDULLA, P.; ATIG, M.; CHEN, Y.; RUMMER, P.; STENMAN, J. String Constraints for Verification. In 26th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, Volume 8559. Berlin: Springer Verlag, 2014. s. 150-166. ISBN: 978-3-319-08866-2.
  Detail | WWW

• 2013

  HOLÍK, L.; LENGÁL, O.; ROGALEWICZ, A.; ŠIMÁČEK, J.; VOJNAR, T. Fully Automated Shape Analysis Based on Forest Automata. Proceedings of CAV'13. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2013. s. 740-755. ISBN: 978-3-642-39798-1. ISSN: 0302-9743.
  Detail

  HOLÍK, L.; ABDULLA, P.; HAZIZA, F.; JONSSON, B.; REZINE, A. An Integrated Specification and Verification Technique for Highly Concurrent Data Structures. 19th International Conference, TACAS 2013. Lecture Notes in Computer Science. Lecture Notes in Computer Science. Berlin Heidelberg: Springer Verlag, 2013. s. 324-338. ISBN: 978-3-642-36742-7. ISSN: 0302-9743.
  Detail | WWW

  HOLÍK, L.; ABDULLA, P.; HAZIZA, F. All for the Price of Few (Parameterized Verification through View Abstraction). Proc. of VMCAI 2013. Lecture Notes in Computer Science. Berlin Heidelberg: Springer Verlag, 2013. s. 476-495. ISBN: 978-3-642-35872-2. ISSN: 0302-9743.
  Detail

  HOLÍK, L.; JONSSON, B.; LENGÁL, O.; VOJNAR, T.; TRINH, Q.; ABDULLA, P. Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. Proceedings of ATVA'13. Heidelberg: Springer Verlag, 2013. s. 224-239. ISBN: 978-3-319-02443-1.
  Detail

• 2012

  HOLÍK, L.; ROGALEWICZ, A.; ŠIMÁČEK, J.; VOJNAR, T.; HABERMEHL, P. Forest Automata for Verification of Heap Manipulation. FORMAL METHODS IN SYSTEM DESIGN, 2012, roč. 2012, č. 41, s. 83-106. ISSN: 0925-9856.
  Detail | WWW

• 2011

  ABDULLA, P.; CHEN, Y.; CLEMENTE, L.; HOLÍK, L.; HONG, C.; MAYR, R.; VOJNAR, T. Advanced Ramsey-based Büchi Automata Inclusion Testing. Lecture Notes in Computer Science, 2011, roč. 2011, č. 6901, s. 187-202. ISSN: 0302-9743.
  Detail | WWW

  HOLÍK, L.; LENGÁL, O.; ŠIMÁČEK, J.; VOJNAR, T. Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata. Lecture Notes in Computer Science, 2011, roč. 2011, č. 6996, s. 243-258. ISSN: 0302-9743.
  Detail

  HOLÍK, L.; ROGALEWICZ, A.; ŠIMÁČEK, J.; VOJNAR, T.; HABERMEHL, P. Forest Automata for Verification of Heap Manipulation. Lecture Notes in Computer Science, 2011, roč. 2011, č. 6806, s. 424-440. ISSN: 0302-9743.
  Detail | WWW

• 2010

  HOLÍK, L.; ŠIMÁČEK, J. Optimizing an LTS-Simulation Algorithm. Computing and Informatics, 2010, roč. 2010, č. 7, s. 1337-1348. ISSN: 1335-9150.
  Detail | WWW

  HOLÍK, L.; VOJNAR, T. Simulations and Aintichains for Efficient Handling of Tree Automata. FIT Monograph. FIT Monograph. Brno: Faculty of Information Technology BUT, 2010. 150 s. ISBN: 978-80-214-4217-7.
  Detail

  HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; CHEN, Y.; MAYR, R. When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata). Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science. Berlín: Springer Verlag, 2010. s. 158-174. ISBN: 978-3-642-12001-5.
  Detail | WWW

  HOLÍK, L.; VOJNAR, T.; CHEN, Y.; MAYR, R.; HONG, C.; ABDULLA, P.; CLEMENTE, L. Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing. Computer Aided Verification. Lecture Notes in Computer Science. Berlín: Springer Verlag, 2010. s. 132-147. ISBN: 978-3-642-14294-9.
  Detail | WWW

• 2009

  HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; CHEN, Y. Zprostředkování pro redukci (Za minimalizací alternujících automatů). IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009). LIPIcs, sv. 4. Wadern: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2009. s. 1-12. ISBN: 978-3-939897-13-2.
  Detail | WWW

  HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; KAATI, L. A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, roč. 2009, č. 251, s. 27-48. ISSN: 1571-0661.
  Detail | WWW

  HOLÍK, L.; ŠIMÁČEK, J. Optimizing an LTS-Simulation Algorithm. 5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Znojmo: Faculty of Informatics MU, 2009. s. 93-101. ISBN: 978-3-939897-15-6.
  Detail | WWW

  HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; BOUAJJANI, A.; KAATI, L. Composed Bisimulation for Tree Automata. International Journal of Foundations of Computer Science, 2009, roč. 20, č. 4, s. 685-700. ISSN: 0129-0541.
  Detail | WWW

• 2008

  HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; BOUAJJANI, A.; KAATI, L. Composed Bisimulation for Tree Automata. Implementation and Application of Automata. Lecture Notes in Computer Science. Berlin: Springer Verlag, 2008. s. 212-222. ISBN: 978-3-540-70843-8.
  Detail

  HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; KAATI, L. A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. 4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Faculty of Informatics MU, 2008. s. 3-11. ISBN: 978-80-7355-082-0.
  Detail

  HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; BOUAJJANI, A.; KAATI, L. Computing Simulations over Tree Automata: Efficient Techniques for Reducing Tree Automata. FIT-TR-2008-001, Brno: 2008. s. 0-0.
  Detail | WWW

  HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; BOUAJJANI, A.; KAATI, L. Computing Simulations over Tree Automata (Efficient Techniques for Reducing Tree Automata). Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science. Berlin: Springer Verlag, 2008. s. 93-108. ISBN: 978-3-540-78799-0.
  Detail

  VOJNAR, T.; ČEŠKA, M.; ROGALEWICZ, A.; ERLEBACH, P.; HOLÍK, L.; BOUAJJANI, A.; HABERMEHL, P.; TOUILI, T.; MORO, P. Automatická verifikace programů s dynamickými datovými strukturami. Inovační podnikání & transfer technologií, 2008, roč. 2008, č. 1, s. 21-22. ISSN: 1210-4612.
  Detail | WWW

  HOLÍK, L.; VOJNAR, T.; BOUAJJANI, A.; HABERMEHL, P.; TOUILI, T. Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. FIT-TR-2008-007, Brno: Faculty of Information Technology BUT, 2008. s. 0-0.
  Detail | WWW

  HOLÍK, L.; VOJNAR, T.; BOUAJJANI, A.; HABERMEHL, P.; TOUILI, T. Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. Implementation and Application of Automata. Lecture Notes in Computer Science. Berlin: Springer Verlag, 2008. s. 57-67. ISBN: 978-3-540-70843-8.
  Detail

  HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; BOUAJJANI, A.; KAATI, L. Composed Bisimulation for Tree Automata. FIT-TR-2008-004, Brno: 2008. s. 0-0.
  Detail | WWW

  HOLÍK, L.; VOJNAR, T.; ABDULLA, P.; KAATI, L. A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. FIT-TR-2008-005, Brno: 2008. s. 0-0.
  Detail | WWW

• 2007

  HOLÍK, L.; ROGALEWICZ, A. Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007). Znojmo: Ing. Zdeněk Novotný, CSc., 2007. s. 59-66. ISBN: 978-80-7355-077-6.
  Detail | WWW

*) Citace publikací se generují jednou za 24 hodin.