Publikace
-
2024
HABERMEHL Peter, HAVLENA Vojtěch, HEČKO Michal, HOLÍK Lukáš a LENGÁL Ondřej. Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. In: Proceedings of CAV'24. Montreal: Springer Verlag, 2024, s. 42-67. ISSN 0302-9743.
DetailHAVLENA Vojtěch, HOLÍK Lukáš, LENGÁL Ondřej a SÍČ Juraj. Cooking String-Integer Conversions with Noodles. In: Proceedings of SAT'24. Leibniz International Proceedings in Informatics (LIPIcs). Pune: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2024, s. 1-19. ISSN 1868-8969.
DetailFIEDOR Tomáš, HAVLENA Vojtěch, HOLÍK Lukáš, HRUŠKA Martin, CHOCHOLATÝ David, LENGÁL Ondřej a SÍČ Juraj. Mata: A Fast and Simple Finite Automata Library. In: Proceedings of TACAS'24. Luxembourgh: Springer Verlag, 2024, s. 130-151. ISSN 0302-9743.
DetailHAVLENA Vojtěch, HOLÍK Lukáš, CHEN Yu-Fang, CHOCHOLATÝ David, LENGÁL Ondřej a SÍČ Juraj. Z3-Noodler: An Automata-based String Solver. In: Proceedings of TACAS'24. Lecture Notes. Luxembourgh: Springer Verlag, 2024, s. 24-33. ISSN 0302-9743.
Detail -
2023
HAVLENA Vojtěch, MATOUŠEK Petr, RYŠAVÝ Ondřej a HOLÍK Lukáš. Accurate Automata-Based Detection of Cyber Threats in Smart Grid Communication. IEEE Transactions on Smart Grid, roč. 2023, č. 14, s. 2352-2366. ISSN 1949-3053.
DetailHOLÍK Lukáš, HOLÍKOVÁ Lenka, SÍČ Juraj a VOJNAR Tomáš. Fast Matching of Regular Patterns with Synchronizing Counting. In: Foundations of Software Science and Computation Structures. Heidelberg: Springer Verlag, 2023, s. 392-412. ISSN 0302-9743.
DetailHOLÍK Lukáš, HOLÍKOVÁ Lenka, SÍČ Juraj a VOJNAR Tomáš. Fast Matching of Regular Patterns with Synchronizing Counting (Technical Report). Ithaca, 2023.
DetailFIEDOR Tomáš, HOLÍK Lukáš, HRUŠKA Martin, ROGALEWICZ Adam, SÍČ Juraj a VARGOVČÍK Pavol. Reasoning about Regular Properties: A Comparative Study. In: Automated Deduction - CADE 29. Cham: Springer Nature Switzerland AG, 2023, s. 286-306. ISSN 0302-9743.
DetailCHEN Yu-Fang, CHOCHOLATÝ David, HAVLENA Vojtěch, HOLÍK Lukáš, LENGÁL Ondřej a SÍČ Juraj. Solving String Constraints with Lengths by Stabilization. Proceedings of the ACM on Programming Languages, roč. 7, č. 10, 2023, s. 2112-2141. ISSN 2475-1421.
DetailHOLÍK Lukáš a ŠEDÝ Michal. Utilization of Repeating Substructures for Efficient Representation of Automata (Technical Report). Brno, 2023.
DetailBLAHOUDEK František, HAVLENA Vojtěch, HOLÍK Lukáš, CHEN Yu-Fang, CHOCHOLATÝ David, LENGÁL Ondřej a SÍČ Juraj. Word Equations in Synergy with Regular Constraints. In: Proceedings of FM'23. Lübeck: Springer Verlag, 2023, s. 403-423. ISSN 0302-9743.
Detail -
2022
HOLÍKOVÁ Lenka, HOLÍK Lukáš, HOMOLIAK Ivan, LENGÁL Ondřej, VEANES Margus a VOJNAR Tomáš. 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.
DetailHOLÍK Lukáš, PERINGER Petr, ROGALEWICZ Adam, ŠOKOVÁ Veronika, VOJNAR Tomáš a ZULEGER Florian. Low-Level Bi-Abduction. In: 36th European Conference on Object-Oriented Programming (ECOOP 2022). Leibniz International Proceedings in Informatics, roč. 2022. Wadern: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2022, s. 1-30. ISBN 978-3-95977-225-9. ISSN 1868-8969.
DetailHOLÍK Lukáš, PERINGER Petr, ROGALEWICZ Adam, ŠOKOVÁ Veronika, VOJNAR Tomáš a ZULEGER Florian. Low-Level Bi-Abduction (Artifact). Dagstuhl, 2022.
DetailHOLÍK Lukáš, PERINGER Petr, ROGALEWICZ Adam, ŠOKOVÁ Veronika, VOJNAR Tomáš a ZULEGER Florian. Low-Level Bi-Abduction (technical report). Ithaca, 2022.
Detail -
2021
HAVLENA Vojtěch, HOLÍK Lukáš, LENGÁL Ondřej a VOJNAR Tomáš. Automata Terms in a Lazy WSkS Decision Procedure. Journal of Automated Reasoning, roč. 65, č. 7, 2021, s. 971-999. ISSN 0168-7433.
DetailMATOUŠEK Petr, HAVLENA Vojtěch a HOLÍK Lukáš. 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.
DetailHOLÍK Lukáš a VARGOVČÍK Pavol. 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.
DetailABDULLA Parosh A., ATIG Mohamed F., BUI Phi Diep, HOLÍK Lukáš, CHEN Yu-Fang a WU Zhilin. 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.
DetailHOLÍK Lukáš a HRUŠKA Martin. Towards Efficient Shape Analysis with Tree Automata. In: Proceedings International Conference on Networked Systems. Lecture notes in Computer Science. Cham: Springer Verlag, 2021, s. 206-214. ISSN 0302-9743.
Detail -
2020
HOLÍK Lukáš, IOSIF Radu, ROGALEWICZ Adam a VOJNAR Tomáš. Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems. Formal Methods in System Design, roč. 55, č. 3, 2020, s. 137-170. ISSN 0925-9856.
DetailHAVLENA Vojtěch, HOLÍK Lukáš, LENGÁL Ondřej, VALEŠ Ondřej a VOJNAR Tomáš. 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ČEŠKA Milan, HAVLENA Vojtěch, HOLÍK Lukáš, LENGÁL Ondřej a VOJNAR Tomáš. Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. International Journal on Software Tools for Technology Transfer, roč. 22, č. 5, 2020, s. 523-539. ISSN 1433-2779.
DetailABDULLA Parosh A., ATIG Mohamed F., BUI Phi Diep, HOLÍK Lukáš, CHEN Yu-Fang, JANKŮ Petr, LIN Hsin-Hung a WU Wei-Cheng. 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.
DetailHOLÍK Lukáš. Finite Automata Methods for Automated Reasoning. Brno: Fakulta informačních technologií VUT v Brně, 2020.
DetailHAVLENA Vojtěch, HOLÍK Lukáš a MATOUŠEK Petr. Learning Probabilistic Automata in the Context of IEC 104. IT-TR-2020-01, Brno: Fakulta informačních technologií VUT v Brně, 2020.
DetailHOLÍKOVÁ Lenka, HOLÍK Lukáš, LENGÁL Ondřej, SAARIKIVI Olli, VEANES Margus a VOJNAR Tomáš. Regex Matching with Counting-Set Automata. Proceedings of the ACM on Programming Languages, roč. 4, č. 11, 2020, s. 1-30. ISSN 2475-1421.
DetailHOLÍK Lukáš, JANKŮ Petr, LIN Anthony W., RUMMER Philipp a VOJNAR Tomáš. String Constraints with Concatenation and Transducers Solved Efficiently (Technical Report). New York: Springer International Publishing, 2020.
Detail -
2019
HAVLENA Vojtěch, HOLÍK Lukáš, LENGÁL Ondřej a VOJNAR Tomáš. Automata Terms in a Lazy WSkS Decision Procedure. In: Proceedings of 27th International Conference on Automated Deduction (CADE-27). Natal: Springer Verlag, 2019, s. 300-318. ISSN 0302-9743.
DetailHAVLENA Vojtěch, HOLÍK Lukáš, LENGÁL Ondřej a VOJNAR Tomáš. Automata Terms in a Lazy WSkS Decision Procedure (Technical Report). Ithaca, 2019.
DetailČEŠKA Milan, HAVLENA Vojtěch, HOLÍK Lukáš, KOŘENEK Jan, LENGÁL Ondřej, MATOUŠEK Denis, MATOUŠEK Jiří, SEMRIČ Jakub a VOJNAR Tomáš. 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.
DetailABDULLA Parosh A., ATIG Mohamed F., BUI Phi Diep, HOLÍK Lukáš a JANKŮ Petr. Chain-Free String Constraints. In: Proceedings of ATVA'19. Lecture Notes in Computer Science, roč. 11781. Cham: Springer International Publishing, 2019, s. 277-293. ISBN 978-3-030-31783-6.
DetailCHEN Yu-Fang, CHIANG Chang-Yi, HOLÍK Lukáš, KAO Wei-Tsung, LIN Hsin-Hung, VOJNAR Tomáš, WEN Yean-Fu a WU Wei-Cheng. J-ReCoVer: Java Reducer Commutativity Verifier. In: Proceedings of 17th Asian Symposium on Programming Languages and Systems (APLAS). Lecture Notes in Computer Science, roč. 11893. Cham: Springer International Publishing, 2019, s. 357-366. ISBN 978-3-030-34174-9.
DetailFIEDOR Tomáš, HOLÍK Lukáš, LENGÁL Ondřej a VOJNAR Tomáš. Nested Antichains for WS1S. Acta Informatica, roč. 56, č. 3, 2019, s. 205-228. ISSN 0001-5903.
DetailHOLÍK Lukáš, HOLÍKOVÁ Lenka, LENGÁL Ondřej, SAARIKIVI Olli, VEANES Margus a VOJNAR Tomáš. Succinct Determinisation of Counting Automata via Sphere Construction. In: In Proc. of 17th Asian Symposium on Programming Languages and Systems - APLAS'19. Berlin Heidelberg: Springer Verlag, 2019, s. 468-489. ISSN 0302-9743.
DetailHOLÍK Lukáš, HOLÍKOVÁ Lenka, LENGÁL Ondřej, SAARIKIVI Olli, VEANES Margus a VOJNAR Tomáš. Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report). Ithaca: Cornell University Library, 2019.
DetailABDULLA Parosh A., ATIG Mohamed F., CHEN Yu-Fang, BUI Phi Diep, HOLÍK Lukáš, REZINE Ahmed a RUMMER Philipp. 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.
DetailHOLÍK Lukáš a VARGOVČÍK Pavol. Verification of String Programs via Automata. In: PEFnet 2019 Extended Abstracts. Brno: Mendelova univerzita v Brně, 2019, s. 155-156. ISBN 978-80-7509-692-0.
Detail -
2018
ČEŠKA Milan, HAVLENA Vojtěch, HOLÍK Lukáš, LENGÁL Ondřej a VOJNAR Tomáš. Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. In: Proceedings of TACAS'18. Thessaloniki: Springer Verlag, 2018, s. 155-175. ISSN 0302-9743.
DetailFIEDOR Tomáš, HOLÍK Lukáš, ROGALEWICZ Adam, SINN Moritz, VOJNAR Tomáš a ZULEGER Florian. From Shapes to Amortized Complexity. In: Proceedings of VMCAI'18. Lecture Notes in Computer Science, roč. 10145. Heidelberg: Springer Verlag, 2018, s. 205-225. ISBN 978-3-319-73720-1. ISSN 0302-9743.
DetailHOLÍK Lukáš, LENGÁL Ondřej, SÍČ Juraj, VEANES Margus a VOJNAR Tomáš. Simulation Algorithms for Symbolic Automata. In: Proc. of 16th International Symposium on Automated Technology for Verification and Analysis. Heidelberg: Springer Verlag, 2018, s. 109-125. ISBN 978-3-030-01089-8. ISSN 0302-9743.
DetailHOLÍK Lukáš, LENGÁL Ondřej, SÍČ Juraj, VEANES Margus a VOJNAR Tomáš. Simulation Algorithms for Symbolic Automata (Technical Report). Ithaca, 2018.
DetailHOLÍK Lukáš, JANKŮ Petr, LIN Anthony W., RUMMER Philipp a VOJNAR Tomáš. String constraints with concatenation and transducers solved efficiently. Proceedings of the ACM on Programming Languages, roč. 2, č. 2, 2018, s. 96-127. ISSN 2475-1421.
DetailHOLÍK Lukáš a HOLÍKOVÁ Lenka. 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 -
2017
ABDULLA Parosh A., HAZIZA Frédéric, HOLÍK Lukáš, JONSSON Bengt a REZINE Ahmed. An integrated specification and verification technique for highly concurrent data structures for highly concurrent data structures. International Journal on Software Tools for Technology Transfer, roč. 5, č. 19, 2017, s. 549-563. ISSN 1433-2779.
DetailHOLÍK Lukáš, HRUŠKA Martin, LENGÁL Ondřej, ROGALEWICZ Adam a VOJNAR Tomáš. Counterexample Validation and Interpolation-Based Refinement for Forest Automata. In: Proceedings of VMCAI'17. Lecture Notes in Computer Science, roč. 10145. Cham: Springer Verlag, 2017, s. 288-309. ISBN 978-3-319-52234-0. ISSN 0302-9743.
DetailHRUŠKA Martin, HOLÍK Lukáš, LENGÁL Ondřej, ROGALEWICZ Adam a VOJNAR Tomáš. Counterexample Validation and Interpolation-Based Refinement for Forest Automata. Brno: Fakulta informačních technologií VUT v Brně, 2017.
DetailHOLÍK Lukáš, MEYER Roland, VOJNAR Tomáš a WOLF Sebastian. Effect Summaries for Thread-Modular Analysis Sound Analysis Despite an Unsound Heuristic. In: SAS 2017: Static Analysis. Lecture Notes in Computer Science, roč. 10422. Cham: Springer International Publishing, 2017, s. 169-191. ISBN 978-3-319-66706-5. ISSN 0302-9743.
DetailABDULLA Parosh A., ATIG Mohamed F., BUI Phi Diep, HOLÍK Lukáš, CHEN Yu-Fang, REZINE Ahmed a RUMMER Philipp. 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.
DetailHRUŠKA Martin, HOLÍK Lukáš, LENGÁL Ondřej, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Forester: From Heap Shapes to Automata Predicates. In: Proceedings of TACAS'17. Lecture Notes in Computer Science, roč. 10206. Heidelberg: Springer Verlag, 2017, s. 365-369. ISBN 978-3-662-54580-5.
DetailFIEDOR Tomáš, HOLÍK Lukáš, JANKŮ Petr, LENGÁL Ondřej a VOJNAR Tomáš. Lazy Automata Techniques for WS1S. In: Proceedings of TACAS'17. Lecture Notes in Computer Science, roč. 10205. Heidelberg: Springer Verlag, 2017, s. 407-425. ISBN 978-3-662-54576-8. ISSN 0302-9743.
DetailFIEDOR Tomáš, HOLÍK Lukáš, JANKŮ Petr, LENGÁL Ondřej a VOJNAR Tomáš. Lazy Automata Techniques for WS1S. arXiv:1701.06282, 2017.
Detail -
2016
HOLÍK Lukáš, MEYER Roland a MUSKALLA Sebastian. Antichains for the Verification of Recursive Programs. 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.
DetailDUDKA Kamil, HOLÍK Lukáš, PERINGER Petr, TRTÍK Marek a VOJNAR Tomáš. From Low-Level Pointers to High-Level Containers. In: Verification, Model Checking, and Abstract Interpretation (VMCAI). Lecture Notes in Computer Science, roč. 9583. Berlin Heidelberg: Springer Verlag, 2016, s. 431-452. ISBN 978-3-662-49121-8.
DetailDUDKA Kamil, HOLÍK Lukáš, PERINGER Petr, TRTÍK Marek a VOJNAR Tomáš. From Low-Level Pointers to High-Level Containers, Technical Report No. FIT-TR-2015-03. Brno, 2016.
DetailHAZIZA Frédéric, HOLÍK Lukáš, MEYER Roland a WOLF Sebastian. Pointer Race Freedom. In: Verification, Model Checking, and Abstract Interpretation (VMCAI). Lecture Notes in Computer Science, roč. 9583. Berlin: Springer Verlag, 2016, s. 393-412. ISBN 978-3-662-49121-8.
DetailHOLÍK Lukáš, KOTOUN Michal, PERINGER Petr, ŠOKOVÁ Veronika, TRTÍK Marek a VOJNAR Tomáš. Predator Shape Analysis Tool Suite. In: Proceedings of HVC 2016. Lecture Notes in Computer Science, roč. 10028. Zurich: Springer International Publishing, 2016, s. 202-209. ISBN 978-3-319-49052-6.
DetailALMEIDA Ricardo, HOLÍK Lukáš a MAYR Richard. 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.
DetailHOLÍK Lukáš, HRUŠKA Martin, LENGÁL Ondřej, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Run Forester, Run Backwards! (Competition Contribution). In: Proceedings of TACAS'16. Lecture Notes in Computer Science, roč. 9636. Heidelberg: Springer Verlag, 2016, s. 923-926. ISBN 978-3-662-49673-2.
DetailHOLÍK Lukáš, MEYER Roland a MUSKALLA Sebastian. 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.
DetailHOLÍK Lukáš, LENGÁL Ondřej, ROGALEWICZ Adam, SEKANINA Lukáš, VAŠÍČEK Zdeněk a VOJNAR Tomáš. Towards Formal Relaxed Equivalence Checking in Approximate Computing Methodology. In: 2nd Workshop on Approximate Computing (WAPCO 2016). Prague, 2016, s. 1-6.
Detail -
2015
HOLÍK Lukáš, HRUŠKA Martin, LENGÁL Ondřej, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Forester: Shape Analysis Using Tree Automata (Competition Contribution). In: Proceedings of TACAS'15. Lecture Notes in Computer Science, roč. 9035. Heidelberg: Springer Verlag, 2015, s. 432-435. ISBN 978-3-662-46680-3.
DetailHOLÍK Lukáš, ISBERNER Malte a JONSSON Bengt. 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.
DetailFIEDOR Tomáš, HOLÍK Lukáš, LENGÁL Ondřej a VOJNAR Tomáš. Nested Antichains for WS1S. In: Proceedings of TACAS'15. Lecture Notes in Computer Science, roč. 9035. Heidelberg: Springer Verlag, 2015, s. 658-674. ISBN 978-3-662-46680-3.
DetailABDULLA Parosh A., ATIG Mohamed F., HOLÍK Lukáš, CHEN Yu-Fang, REZINE Ahmed, RUMMER Philipp a STENMAN Jari. 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.
DetailABDULLA Parosh A., HAZIZA Frédéric a HOLÍK Lukáš. Parameterized verification through view abstraction. International Journal on Software Tools for Technology Transfer, roč. 2016, č. 5, 2015, s. 495-516. ISSN 1433-2779.
DetailABDULLA Parosh A., HOLÍK Lukáš, JONSSON Bengt, LENGÁL Ondřej, TRINH Quy Cong a VOJNAR Tomáš. Verification of heap manipulating programs with ordered data by extended forest automata. Acta Informatica, roč. 53, č. 4, 2015, s. 357-385. ISSN 0001-5903.
DetailABDULLA Parosh A., HAZIZA Frédéric a HOLÍK Lukáš. View Abstraction - A Tutorial. In: 2nd International Workshop on Synthesis of Complex Parameters. OpenAccess Series in Informatics, roč. 44. Dagstuhl: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2015, s. 1-15. ISBN 978-3-939897-82-8. ISSN 2190-6807.
Detail -
2014
ABDULLA Parosh A., HAZIZA Frédéric a HOLÍK Lukáš. Block Me If You Can! Context-Sensitive Parameterized Verification. In: 21st International Static Analysis Symposium. Lecture Notes in Computer Science, roč. 2014. Berlin: Springer Verlag, 2014, s. 1-17. ISBN 978-3-319-10935-0. ISSN 0302-9743.
DetailABDULLA Parosh A., HOLÍK Lukáš, CHEN Yu-Fang a VOJNAR Tomáš. Mediating for reduction (on minimizing alternating Buchi automata). Theoretical Computer Science, roč. 2014, č. 552, s. 26-43. ISSN 0304-3975.
DetailABDULLA Parosh A., ATIG Mohamed F., HOLÍK Lukáš, CHEN Yu-Fang, RUMMER Philipp a STENMAN Jari. String Constraints for Verification. In: 26th International Conference on Computer Aided Verification. Lecture Notes in Computer Science, Volume 8559, roč. 8559. Berlin: Springer Verlag, 2014, s. 150-166. ISBN 978-3-319-08866-2.
Detail -
2013
ABDULLA Parosh A., HAZIZA Frédéric a HOLÍK Lukáš. All for the Price of Few (Parameterized Verification through View Abstraction). In: Proc. of VMCAI 2013. Berlin Heidelberg: Springer Verlag, 2013, s. 476-495. ISBN 978-3-642-35872-2. ISSN 0302-9743.
DetailABDULLA Parosh A., HAZIZA Frédéric, HOLÍK Lukáš, JONSSON Bengt a REZINE Ahmed. An Integrated Specification and Verification Technique for Highly Concurrent Data Structures. In: 19th International Conference, TACAS 2013. Lecture Notes in Computer Science, roč. 7795. Berlin Heidelberg: Springer Verlag, 2013, s. 324-338. ISBN 978-3-642-36742-7. ISSN 0302-9743.
DetailHOLÍK Lukáš, LENGÁL Ondřej, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Fully Automated Shape Analysis Based on Forest Automata. In: Proceedings of CAV'13. Heidelberg: Springer Verlag, 2013, s. 740-755. ISBN 978-3-642-39798-1. ISSN 0302-9743.
DetailHOLÍK Lukáš, LENGÁL Ondřej, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Fully Automated Shape Analysis Based on Forest Automata. FIT-TR-2013-01, Brno: Fakulta informačních technologií VUT v Brně, 2013.
DetailABDULLA Parosh A., HOLÍK Lukáš, JONSSON Bengt, LENGÁL Ondřej, TRINH Quy Cong a VOJNAR Tomáš. Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. In: Proceedings of ATVA'13. Heidelberg: Springer Verlag, 2013, s. 224-239. ISBN 978-3-319-02443-1.
DetailABDULLA Parosh A., HOLÍK Lukáš, JONSSON Bengt, LENGÁL Ondřej, TRINH Quy Cong a VOJNAR Tomáš. Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. FIT-TR-2013-02, Brno: Fakulta informačních technologií VUT v Brně, 2013.
Detail -
2012
HABERMEHL Peter, HOLÍK Lukáš, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Forest Automata for Verification of Heap Manipulation. Formal Methods in System Design, roč. 2012, č. 41, s. 83-106. ISSN 0925-9856.
Detail -
2011
ABDULLA Parosh A., CHEN Yu-Fang, CLEMENTE Lorenzo, HOLÍK Lukáš, HONG Chih-Duo, MAYR Richard a VOJNAR Tomáš. Advanced Ramsey-based Büchi Automata Inclusion Testing. FIT-TR-2011-03, Brno: Fakulta informačních technologií VUT v Brně, 2011.
DetailABDULLA Parosh A., CHEN Yu-Fang, CLEMENTE Lorenzo, HOLÍK Lukáš, HONG Chih-Duo, MAYR Richard a VOJNAR Tomáš. Advanced Ramsey-based Büchi Automata Inclusion Testing. Lecture Notes in Computer Science, roč. 2011, č. 6901, s. 187-202. ISSN 0302-9743.
DetailHOLÍK Lukáš, LENGÁL Ondřej, ŠIMÁČEK Jiří a VOJNAR Tomáš. Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata. Lecture Notes in Computer Science, roč. 2011, č. 6996, s. 243-258. ISSN 0302-9743.
DetailHOLÍK Lukáš, LENGÁL Ondřej, ŠIMÁČEK Jiří a VOJNAR Tomáš. Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata. FIT-TR-2011-04, Brno: Fakulta informačních technologií VUT v Brně, 2011.
DetailHABERMEHL Peter, HOLÍK Lukáš, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Forest Automata for Verification of Heap Manipulation. Lecture Notes in Computer Science, roč. 2011, č. 6806, s. 424-440. ISSN 0302-9743.
DetailHABERMEHL Peter, HOLÍK Lukáš, ROGALEWICZ Adam, ŠIMÁČEK Jiří a VOJNAR Tomáš. Forest Automata for Verification of Heap Manipulation. FIT-TR-2011-01, Brno: Fakulta informačních technologií VUT v Brně, 2011.
Detail -
2010
HOLÍK Lukáš a ŠIMÁČEK Jiří. Optimizing an LTS-Simulation Algorithm. Computing and Informatics, roč. 2010, č. 7, s. 1337-1348. ISSN 1335-9150.
DetailABDULLA Parosh A., CLEMENTE Lorenzo, HOLÍK Lukáš, HONG Chih-Duo, CHEN Yu-Fang, MAYR Richard a VOJNAR Tomáš. Simulation Subsumption in Ramsey-based Büchi Automata Universality and Inclusion Testing. FIT-TR-2010-02, Brno: Fakulta informačních technologií VUT v Brně, 2010.
DetailABDULLA Parosh A., CLEMENTE Lorenzo, HOLÍK Lukáš, HONG Chih-Duo, CHEN Yu-Fang, MAYR Richard a VOJNAR Tomáš. Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing. In: Computer Aided Verification. Lecture Notes in Computer Science, roč. 6174. Berlín: Springer Verlag, 2010, s. 132-147. ISBN 978-3-642-14294-9.
DetailHOLÍK Lukáš a VOJNAR Tomáš. Simulations and Aintichains for Efficient Handling of Tree Automata. FIT Monograph. Brno: Fakulta informačních technologií VUT v Brně, 2010. ISBN 978-80-214-4217-7.
DetailABDULLA Parosh A., HOLÍK Lukáš, CHEN Yu-Fang, MAYR Richard a VOJNAR Tomáš. When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata). FIT-TR-2010-01, Brno: Fakulta informačních technologií VUT v Brně, 2010.
DetailABDULLA Parosh A., HOLÍK Lukáš, CHEN Yu-Fang, MAYR Richard a VOJNAR Tomáš. When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata). In: Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, roč. 6015. Berlín: Springer Verlag, 2010, s. 158-174. ISBN 978-3-642-12001-5.
Detail -
2009
ABDULLA Parosh A., HOLÍK Lukáš, KAATI Lisa a VOJNAR Tomáš. A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. Electronic Notes in Theoretical Computer Science, roč. 2009, č. 251, s. 27-48. ISSN 1571-0661.
DetailABDULLA Parosh A., BOUAJJANI Ahmed, HOLÍK Lukáš, KAATI Lisa a VOJNAR Tomáš. Composed Bisimulation for Tree Automata. International Journal of Foundations of Computer Science, roč. 20, č. 4, 2009, s. 685-700. ISSN 0129-0541.
DetailABDULLA Parosh A., HOLÍK Lukáš, CHEN Yu-Fang a VOJNAR Tomáš. Mediating for Reduction (On Minimizing Alternating Büchi Automata). Brno: Fakulta informačních technologií VUT v Brně, 2009.
DetailABDULLA Parosh A., HOLÍK Lukáš, CHEN Yu-Fang a VOJNAR Tomáš. Mediating for Reduction (On Minimizing Alternating Büchi Automata). FIT-TR-2009-02, Brno, 2009.
DetailABDULLA Parosh A., HOLÍK Lukáš, CHEN Yu-Fang a VOJNAR Tomáš. Zprostředkování pro redukci (Za minimalizací alternujících automatů). In: 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.
DetailHOLÍK Lukáš a ŠIMÁČEK Jiří. Optimizing an LTS-Simulation Algorithm. FIT-TR-2009-03, Brno, 2009.
DetailHOLÍK Lukáš a ŠIMÁČEK Jiří. Optimizing an LTS-Simulation Algorithm. In: 5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Znojmo: Fakulta informatiky MU, 2009, s. 93-101. ISBN 978-3-939897-15-6.
Detail -
2008
ABDULLA Parosh A., HOLÍK Lukáš, KAATI Lisa a VOJNAR Tomáš. A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. FIT-TR-2008-005, Brno, 2008.
DetailABDULLA Parosh A., HOLÍK Lukáš, KAATI Lisa a VOJNAR Tomáš. A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. In: 4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Brno: Fakulta informatiky MU, 2008, s. 3-11. ISBN 978-80-7355-082-0.
DetailBOUAJJANI Ahmed, HABERMEHL Peter, HOLÍK Lukáš, TOUILI Tayssir a VOJNAR Tomáš. Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. In: Implementation and Application of Automata. Lecture Notes in Computer Science, roč. 5148. Berlin: Springer Verlag, 2008, s. 57-67. ISBN 978-3-540-70843-8.
DetailBOUAJJANI Ahmed, HABERMEHL Peter, HOLÍK Lukáš, TOUILI Tayssir a VOJNAR Tomáš. Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. FIT-TR-2008-007, Brno: Fakulta informačních technologií VUT v Brně, 2008.
DetailVOJNAR Tomáš, ČEŠKA Milan, ROGALEWICZ Adam, ERLEBACH Pavel, HOLÍK Lukáš, BOUAJJANI Ahmed, HABERMEHL Peter, TOUILI Tayssir a MORO Pierre. Automatická verifikace programů s dynamickými datovými strukturami. Inovační podnikání & transfer technologií, roč. 2008, č. 1, s. 21-22. ISSN 1210-4612.
DetailABDULLA Parosh A., BOUAJJANI Ahmed, HOLÍK Lukáš, KAATI Lisa a VOJNAR Tomáš. Composed Bisimulation for Tree Automata. FIT-TR-2008-004, Brno, 2008.
DetailABDULLA Parosh A., BOUAJJANI Ahmed, HOLÍK Lukáš, KAATI Lisa a VOJNAR Tomáš. Composed Bisimulation for Tree Automata. In: Implementation and Application of Automata. Lecture Notes in Computer Science, roč. 5148. Berlin: Springer Verlag, 2008, s. 212-222. ISBN 978-3-540-70843-8.
DetailABDULLA Parosh A., BOUAJJANI Ahmed, HOLÍK Lukáš, KAATI Lisa a VOJNAR Tomáš. Computing Simulations over Tree Automata (Efficient Techniques for Reducing Tree Automata). In: Tools and Algorithms for the Construction and Analysis of Systems. Lecture Notes in Computer Science, roč. 4963. Berlin: Springer Verlag, 2008, s. 93-108. ISBN 978-3-540-78799-0.
DetailABDULLA Parosh A., BOUAJJANI Ahmed, HOLÍK Lukáš, KAATI Lisa a VOJNAR Tomáš. Computing Simulations over Tree Automata: Efficient Techniques for Reducing Tree Automata. FIT-TR-2008-001, Brno, 2008.
Detail -
2007
HOLÍK Lukáš a ROGALEWICZ Adam. Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. In: 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