Lukás Holík

Publication Activity (10 Years)

Years Active: 2008-2024
Publications (10 Years): 69

Top Topics

Finite Automata

Regular Patterns

Network Intrusion

Technical Report

Top Venues

Int. J. Softw. Tools Technol. Transf.

Publications

Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc
Cooking String-Integer Conversions with Noodles. SAT (2024)
Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc
Z3-Noodler: An Automata-based String Solver. TACAS (1) (2024)
Lukás Holík, Pavol Vargovcík
Antichain with SAT and Tries. SAT (2024)
Peter Habermehl, Vojtech Havlena, Michal Hecko, Lukás Holík, Ondrej Lengál
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. CAV (1) (2024)
Peter Habermehl, Michal Hecko, Vojtech Havlena, Lukás Holík, Ondrej Lengál
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. CoRR (2024)
David Chocholatý, Tomás Fiedor, Vojtech Havlena, Lukás Holík, Martin Hruska, Ondrej Lengál, Juraj Síc
Mata: A Fast and Simple Finite Automata Library. TACAS (2) (2024)
Lukás Holík, Juraj Síc, Lenka Turonová, Tomás Vojnar
Fast Matching of Regular Patterns with Synchronizing Counting (Technical Report). CoRR (2023)
Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc
Solving String Constraints with Lengths by Stabilization. Proc. ACM Program. Lang. 7 (OOPSLA2) (2023)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bui Phi Diep, Lukás Holík, Petr Janku
Chain-Free String Constraints (Technical Report). CoRR (2023)
Tomás Fiedor, Lukás Holík, Martin Hruska, Adam Rogalewicz, Juraj Síc, Pavol Vargovcík
Reasoning about Regular Properties: A Comparative Study. CoRR (2023)
Vojtech Havlena, Petr Matousek, Ondrej Rysavý, Lukás Holík
Accurate Automata-Based Detection of Cyber Threats in Smart Grid Communication. IEEE Trans. Smart Grid 14 (3) (2023)
David Chocholatý, Tomás Fiedor, Vojtech Havlena, Lukás Holík, Martin Hruska, Ondrej Lengál, Juraj Síc
Mata, a Fast and Simple Finite Automata Library (Technical Report). CoRR (2023)
Lukás Holík, Juraj Síc, Lenka Turonová, Tomás Vojnar
Fast Matching of Regular Patterns with Synchronizing Counting. FoSSaCS (2023)
Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc
Z3-Noodler: An Automata-based String Solver (Technical Report). CoRR (2023)
Frantisek Blahoudek, Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc
Word Equations in Synergy with Regular Constraints. FM (2023)
Lukás Holík, Jirí Simácek
Optimizing an LTS-Simulation Algorithm (Technical Report). CoRR (2023)
Tomás Fiedor, Lukás Holík, Martin Hruska, Adam Rogalewicz, Juraj Síc, Pavol Vargovcík
Reasoning About Regular Properties: A Comparative Study. CADE (2023)
Frantisek Blahoudek, Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc
Word Equations in Synergy with Regular Constraints (Technical Report). CoRR (2022)
Lenka Turonová, Lukás Holík, Ivan Homoliak, Ondrej Lengál, Margus Veanes, Tomás Vojnar
Counting in Regexes Considered Harmful: Exposing ReDoS Vulnerability of Nonbacktracking Matchers. USENIX Security Symposium (2022)
Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
Low-Level Bi-Abduction. ECOOP (2022)
Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
Low-Level Bi-Abduction. CoRR (2022)
Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
Low-Level Bi-Abduction (Artifact). Dagstuhl Artifacts Ser. 8 (2) (2022)
Petr Matousek, Vojtech Havlena, Lukás Holík
Efficient Modelling of ICS Communication For Anomaly Detection Using Probabilistic Automata. IM (2021)
Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine
Correction to: An integrated specification and verification technique for highly concurrent data structures. Int. J. Softw. Tools Technol. Transf. 23 (5) (2021)
Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar
Automata Terms in a Lazy WSkS Decision Procedure. J. Autom. Reason. 65 (7) (2021)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Denghang Hu, Wei-Lun Tsai, Zhilin Wu, Di-De Yen
Solving Not-Substring Constraint withFlat Abstraction. APLAS (2021)
Martin Hruska, Lukás Holík
Towards Efficient Shape Analysis with Tree Automata. NETYS (2021)
Pavol Vargovcík, Lukás Holík
Simplifying Alternating Automata for Emptiness Testing. APLAS (2021)
Vojtech Havlena, Lukás Holík, Ondrej Lengál, Ondrej Vales, Tomás Vojnar
Antiprenexing for WSkS: A Little Goes a Long Way. LPAR (2020)
Lenka Turonová, Lukás Holík, Ondrej Lengál, Olli Saarikivi, Margus Veanes, Tomás Vojnar
Regex matching with counting-set automata. Proc. ACM Program. Lang. 4 (OOPSLA) (2020)
Milan Ceska, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar
Approximate reduction of finite automata for high-speed network intrusion detection. Int. J. Softw. Tools Technol. Transf. 22 (5) (2020)
Lukás Holík, Petr Janku, Anthony W. Lin, Philipp Rümmer, Tomás Vojnar
String Constraints with Concatenation and Transducers Solved Efficiently (Technical Report). CoRR (2020)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Julian Dolby, Petr Janku, Hsin-Hung Lin, Lukás Holík, Wei-Cheng Wu
Efficient handling of string-number conversion. PLDI (2020)
Lukás Holík, Radu Iosif, Adam Rogalewicz, Tomás Vojnar
Abstraction refinement and antichains for trace inclusion of infinite state systems. Formal Methods Syst. Des. 55 (3) (2020)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bui Phi Diep, Lukás Holík, Petr Janku
Chain-Free String Constraints. ATVA (2019)
Yu-Fang Chen, Chang-Yi Chiang, Lukás Holík, Wei-Tsung Kao, Hsin-Hung Lin, Tomás Vojnar, Yean-Fu Wen, Wei-Cheng Wu
J-ReCoVer: Java Reducer Commutativity Verifier. APLAS (2019)
Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar
Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report). CoRR (2019)
Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar
Automata Terms in a Lazy WSkS Decision Procedure (Technical Report). CoRR (2019)
Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar
Automata Terms in a Lazy WSkS Decision Procedure. CADE (2019)
Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar
Succinct Determinisation of Counting Automata via Sphere Construction. APLAS (2019)
Milan Ceska, Vojtech Havlena, Lukás Holík, Jan Korenek, Ondrej Lengál, Denis Matousek, Jirí Matousek, Jakub Semric, Tomás Vojnar
Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata. CoRR (2019)
Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar
Nested antichains for WS1S. Acta Informatica 56 (3) (2019)
Milan Ceska, Vojtech Havlena, Lukás Holík, Jan Korenek, Ondrej Lengál, Denis Matousek, Jirí Matousek, Jakub Semric, Tomás Vojnar
Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata. FCCM (2019)
Lukás Holík, Ondrej Lengál, Juraj Síc, Margus Veanes, Tomás Vojnar
Simulation Algorithms for Symbolic Automata. ATVA (2018)
Milan Ceska, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. TACAS (2) (2018)
Lukás Holík, Petr Janku, Anthony W. Lin, Philipp Rümmer, Tomás Vojnar
String constraints with concatenation and transducers solved efficiently. Proc. ACM Program. Lang. 2 (POPL) (2018)
Lukás Holík, Ondrej Lengál, Juraj Síc, Margus Veanes, Tomás Vojnar
Simulation Algorithms for Symbolic Automata (Technical Report). CoRR (2018)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Ahmed Rezine, Philipp Rümmer
Trau: SMT solver for string constraints. FMCAD (2018)
Tomás Fiedor, Lukás Holík, Adam Rogalewicz, Moritz Sinn, Tomás Vojnar, Florian Zuleger
From Shapes to Amortized Complexity. VMCAI (2018)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Ahmed Rezine, Philipp Rümmer
Flatten and conquer: a framework for efficient analysis of string constraints. PLDI (2017)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Tomás Vojnar
Counterexample Validation and Interpolation-Based Refinement for Forest Automata. VMCAI (2017)
Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine
An integrated specification and verification technique for highly concurrent data structures. Int. J. Softw. Tools Technol. Transf. 19 (5) (2017)
Lukás Holík, Roland Meyer, Tomás Vojnar, Sebastian Wolff
Effect Summaries for Thread-Modular Analysis. CoRR (2017)
Lenka Turonová, Lukás Holík
Towards Smaller Invariants for Proving Coverability. EUROCAST (2) (2017)
Tomás Fiedor, Lukás Holík, Petr Janku, Ondrej Lengál, Tomás Vojnar
Lazy Automata Techniques for WS1S. CoRR (2017)
Milan Ceska, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. CoRR (2017)
Lukás Holík, Roland Meyer, Tomás Vojnar, Sebastian Wolff
Effect Summaries for Thread-Modular Analysis - Sound Analysis Despite an Unsound Heuristic. SAS (2017)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Forester: From Heap Shapes to Automata Predicates - (Competition Contribution). TACAS (2) (2017)
Tomás Fiedor, Lukás Holík, Petr Janku, Ondrej Lengál, Tomás Vojnar
Lazy Automata Techniques for WS1S. TACAS (1) (2017)
Lukás Holík
Simulations and Antichains for Efficient Handling of Finite Automata. CoRR (2017)
Frédéric Haziza, Lukás Holík, Roland Meyer, Sebastian Wolff
Pointer Race Freedom. VMCAI (2016)
Lukás Holík, Roland Meyer, Sebastian Muskalla
Summaries for Context-Free Games. FSTTCS (2016)
Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar
Verification of heap manipulating programs with ordered data by extended forest automata. Acta Informatica 53 (4) (2016)
Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík
Parameterized verification through view abstraction. Int. J. Softw. Tools Technol. Transf. 18 (5) (2016)
Kamil Dudka, Lukás Holík, Petr Peringer, Marek Trtík, Tomás Vojnar
From Low-Level Pointers to High-Level Containers. VMCAI (2016)
Lukás Holík, Michal Kotoun, Petr Peringer, Veronika Soková, Marek Trtík, Tomás Vojnar
Predator Shape Analysis Tool Suite. Haifa Verification Conference (2016)
Lukás Holík, Roland Meyer, Sebastian Muskalla
Antichains for Inclusion Games. CoRR (2016)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Run Forester, Run Backwards! - (Competition Contribution). TACAS (2016)
Ricardo Almeida, Lukás Holík, Richard Mayr
Reduction of Nondeterministic Tree Automata. TACAS (2016)
Lukás Holík, Roland Meyer
Antichains for the Verification of Recursive Programs. NETYS (2015)
Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar
Nested Antichains for WS1S. TACAS (2015)
Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar
Nested Antichains for WS1S. CoRR (2015)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Forester: Shape Analysis Using Tree Automata - (Competition Contribution). TACAS (2015)
Kamil Dudka, Lukás Holík, Petr Peringer, Marek Trtík, Tomás Vojnar
From Low-Level Pointers to High-Level Containers. CoRR (2015)
Frédéric Haziza, Lukás Holík, Roland Meyer, Sebastian Wolff
Pointer Race Freedom. CoRR (2015)
Lukás Holík, Malte Isberner, Bengt Jonsson
Mediator Synthesis in a Component Algebra with Data. Correct System Design (2015)
Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík
View Abstraction - A Tutorial (Invited Paper). SynCoP (2015)
Ricardo Almeida, Lukás Holík, Richard Mayr
Reduction of Nondeterministic Tree Automata. CoRR (2015)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Lukás Holík, Ahmed Rezine, Philipp Rümmer, Jari Stenman
Norn: An SMT Solver for String Constraints. CAV (1) (2015)
Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Tomás Vojnar
Mediating for reduction (on minimizing alternating Büchi automata). Theor. Comput. Sci. 552 (2014)
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Lukás Holík, Ahmed Rezine, Philipp Rümmer, Jari Stenman
String Constraints for Verification. CAV (2014)
Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík
Block Me If You Can! - Context-Sensitive Parameterized Verification. SAS (2014)
Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík
All for the Price of Few. VMCAI (2013)
Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar
Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. ATVA (2013)
Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Fully Automated Shape Analysis Based on Forest Automata CoRR (2013)
Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík, Bengt Jonsson, Ahmed Rezine
An Integrated Specification and Verification Technique for Highly Concurrent Data Structures. TACAS (2013)
Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Fully Automated Shape Analysis Based on Forest Automata. CAV (2013)
Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Forest automata for verification of heap manipulation. Formal Methods Syst. Des. 41 (1) (2012)
Lukás Holík, Ondrej Lengál, Jirí Simácek, Tomás Vojnar
Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata. ATVA (2011)
Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar
Advanced Ramsey-Based Büchi Automata Inclusion Testing. CONCUR (2011)
Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Forest Automata for Verification of Heap Manipulation. CAV (2011)
Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar
Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing. CAV (2010)
Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Richard Mayr, Tomás Vojnar
When Simulation Meets Antichains. TACAS (2010)
Parosh Aziz Abdulla, Lukás Holík, Lisa Kaati, Tomás Vojnar
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. Electron. Notes Theor. Comput. Sci. 251 (2009)
Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Tomás Vojnar
Mediating for Reduction (on Minimizing Alternating Büchi Automata). FSTTCS (2009)
Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar
Composed Bisimulation for Tree Automata. Int. J. Found. Comput. Sci. 20 (4) (2009)
Ahmed Bouajjani, Peter Habermehl, Lukás Holík, Tayssir Touili, Tomás Vojnar
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. CIAA (2008)
Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar
Computing Simulations over Tree Automata. TACAS (2008)
Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar
Composed Bisimulation for Tree Automata. CIAA (2008)