default search action
Lukás Holík
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c59]Peter Habermehl
, Vojtech Havlena
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. CAV (1) 2024: 42-67 - [c58]Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc:
Cooking String-Integer Conversions with Noodles. SAT 2024: 14:1-14:19 - [c57]Lukás Holík, Pavol Vargovcík:
Antichain with SAT and Tries. SAT 2024: 15:1-15:24 - [c56]Yu-Fang Chen
Z3-Noodler: An Automata-based String Solver. TACAS (1) 2024: 24-33 - [c55]David Chocholatý
Mata: A Fast and Simple Finite Automata Library. TACAS (2) 2024: 130-151 - [i24]Peter Habermehl, Michal Hecko, Vojtech Havlena, Lukás Holík, Ondrej Lengál:
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. CoRR abs/2403.18995 (2024) - 2023
- [j16]Yu-Fang Chen
Solving String Constraints with Lengths by Stabilization. Proc. ACM Program. Lang. 7(OOPSLA2): 2112-2141 (2023) - [j15]Vojtech Havlena
Accurate Automata-Based Detection of Cyber Threats in Smart Grid Communication. IEEE Trans. Smart Grid 14(3): 2352-2366 (2023) - [c54]Tomás Fiedor, Lukás Holík, Martin Hruska, Adam Rogalewicz, Juraj Síc
Reasoning About Regular Properties: A Comparative Study. CADE 2023: 286-306 - [c53]Frantisek Blahoudek, Yu-Fang Chen, David Chocholatý
Word Equations in Synergy with Regular Constraints. FM 2023: 403-423 - [c52]Lukás Holík
Fast Matching of Regular Patterns with Synchronizing Counting. FoSSaCS 2023: 392-412 - [i23]Lukás Holík, Juraj Síc, Lenka Turonová, Tomás Vojnar:
Fast Matching of Regular Patterns with Synchronizing Counting (Technical Report). CoRR abs/2301.12851 (2023) - [i22]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 abs/2304.05064 (2023) - [i21]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bui Phi Diep, Lukás Holík, Petr Janku:
Chain-Free String Constraints (Technical Report). CoRR abs/2307.03970 (2023) - [i20]Lukás Holík, Jirí Simácek:
Optimizing an LTS-Simulation Algorithm (Technical Report). CoRR abs/2307.04235 (2023) - [i19]Yu-Fang Chen, David Chocholatý
Z3-Noodler: An Automata-based String Solver (Technical Report). CoRR abs/2310.08327 (2023) - [i18]David Chocholatý
Mata, a Fast and Simple Finite Automata Library (Technical Report). CoRR abs/2310.10136 (2023) - 2022
- [j14]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): 11:1-11:6 (2022) - [c51]Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
Low-Level Bi-Abduction. ECOOP 2022: 19:1-19:30 - [c50]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: 4165-4182 - [e3]Ahmed Bouajjani
Automated Technology for Verification and Analysis - 20th International Symposium, ATVA 2022, Virtual Event, October 25-28, 2022, Proceedings. Lecture Notes in Computer Science 13505, Springer 2022, ISBN 978-3-031-19991-2 [contents] - [i17]Lukás Holík, Petr Peringer, Adam Rogalewicz, Veronika Soková, Tomás Vojnar, Florian Zuleger
Low-Level Bi-Abduction. CoRR abs/2205.02590 (2022) - [i16]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 abs/2212.02317 (2022) - 2021
- [j13]Vojtech Havlena
Automata Terms in a Lazy WSkS Decision Procedure. J. Autom. Reason. 65(7): 971-999 (2021) - [j12]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): 825 (2021) - [c49]Pavol Vargovcík, Lukás Holík:
Simplifying Alternating Automata for Emptiness Testing. APLAS 2021: 243-264 - [c48]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Denghang Hu
Solving Not-Substring Constraint withFlat Abstraction. APLAS 2021: 305-320 - [c47]Petr Matousek, Vojtech Havlena, Lukás Holík:
Efficient Modelling of ICS Communication For Anomaly Detection Using Probabilistic Automata. IM 2021: 81-89 - [c46]Martin Hruska, Lukás Holík:
Towards Efficient Shape Analysis with Tree Automata. NETYS 2021: 206-214 - 2020
- [j11]Lukás Holík
Abstraction refinement and antichains for trace inclusion of infinite state systems. Formal Methods Syst. Des. 55(3): 137-170 (2020) - [j10]Lenka Turonová, Lukás Holík
Regex matching with counting-set automata. Proc. ACM Program. Lang. 4(OOPSLA): 218:1-218:30 (2020) - [j9]Milan Ceska
Approximate reduction of finite automata for high-speed network intrusion detection. Int. J. Softw. Tools Technol. Transf. 22(5): 523-539 (2020) - [c45]Vojtech Havlena, Lukás Holík, Ondrej Lengál
Antiprenexing for WSkS: A Little Goes a Long Way. LPAR 2020: 298-316 - [c44]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Julian Dolby, Petr Janku, Hsin-Hung Lin, Lukás Holík
Efficient handling of string-number conversion. PLDI 2020: 943-957 - [d4]Lukás Holík
Dataset for the OOPSLA'20 paper "Regex Matching with Counting-Set Automata". Zenodo, 2020 - [d3]Lukás Holík
Dataset for the OOPSLA'20 paper "Regex Matching with Counting-Set Automata". Zenodo, 2020 - [d2]Lukás Holík
Artifact for the OOPSLA'20 paper "Regex Matching with Counting-Set Automata". Zenodo, 2020 - [i15]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 abs/2010.15975 (2020)
2010 – 2019
- 2019
- [j8]Tomás Fiedor, Lukás Holík
Nested antichains for WS1S. Acta Informatica 56(3): 205-228 (2019) - [c43]Yu-Fang Chen, Chang-Yi Chiang, Lukás Holík
J-ReCoVer: Java Reducer Commutativity Verifier. APLAS 2019: 357-366 - [c42]Lukás Holík
Succinct Determinisation of Counting Automata via Sphere Construction. APLAS 2019: 468-489 - [c41]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bui Phi Diep, Lukás Holík
Chain-Free String Constraints. ATVA 2019: 277-293 - [c40]Vojtech Havlena, Lukás Holík
Automata Terms in a Lazy WSkS Decision Procedure. CADE 2019: 300-318 - [c39]Milan Ceska
Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata. FCCM 2019: 109-117 - [d1]Ondrej Lengál
Forester Virtual Machine. Zenodo, 2019 - [i14]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 abs/1904.10786 (2019) - [i13]Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Automata Terms in a Lazy WSkS Decision Procedure (Technical Report). CoRR abs/1905.08697 (2019) - [i12]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 abs/1910.01996 (2019) - 2018
- [j7]Lukás Holík, Petr Janku, Anthony W. Lin
String constraints with concatenation and transducers solved efficiently. Proc. ACM Program. Lang. 2(POPL): 4:1-4:32 (2018) - [c38]Lukás Holík
Simulation Algorithms for Symbolic Automata. ATVA 2018: 109-125 - [c37]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík
Trau: SMT solver for string constraints. FMCAD 2018: 1-5 - [c36]Milan Ceska
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. TACAS (2) 2018: 155-175 - [c35]Tomás Fiedor, Lukás Holík
From Shapes to Amortized Complexity. VMCAI 2018: 205-225 - [i11]Lukás Holík, Ondrej Lengál, Juraj Síc, Margus Veanes, Tomás Vojnar:
Simulation Algorithms for Symbolic Automata (Technical Report). CoRR abs/1807.08487 (2018) - 2017
- [j6]Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík
An integrated specification and verification technique for highly concurrent data structures. Int. J. Softw. Tools Technol. Transf. 19(5): 549-563 (2017) - [c34]Lenka Turonová, Lukás Holík
Towards Smaller Invariants for Proving Coverability. EUROCAST (2) 2017: 109-116 - [c33]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen
Flatten and conquer: a framework for efficient analysis of string constraints. PLDI 2017: 602-617 - [c32]Lukás Holík
Effect Summaries for Thread-Modular Analysis - Sound Analysis Despite an Unsound Heuristic. SAS 2017: 169-191 - [c31]Lukás Holík
Forester: From Heap Shapes to Automata Predicates - (Competition Contribution). TACAS (2) 2017: 365-369 - [c30]Tomás Fiedor, Lukás Holík
Lazy Automata Techniques for WS1S. TACAS (1) 2017: 407-425 - [c29]Lukás Holík
Counterexample Validation and Interpolation-Based Refinement for Forest Automata. VMCAI 2017: 288-309 - [i10]Tomás Fiedor, Lukás Holík, Petr Janku, Ondrej Lengál, Tomás Vojnar:
Lazy Automata Techniques for WS1S. CoRR abs/1701.06282 (2017) - [i9]Lukás Holík, Roland Meyer, Tomás Vojnar, Sebastian Wolff:
Effect Summaries for Thread-Modular Analysis. CoRR abs/1705.03701 (2017) - [i8]Lukás Holík:
Simulations and Antichains for Efficient Handling of Finite Automata. CoRR abs/1706.03208 (2017) - [i7]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 abs/1710.08647 (2017) - 2016
- [j5]Parosh Aziz Abdulla, Lukás Holík
Verification of heap manipulating programs with ordered data by extended forest automata. Acta Informatica 53(4): 357-385 (2016) - [j4]Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík
Parameterized verification through view abstraction. Int. J. Softw. Tools Technol. Transf. 18(5): 495-516 (2016) - [c28]Lukás Holík
Summaries for Context-Free Games. FSTTCS 2016: 41:1-41:16 - [c27]Lukás Holík
Predator Shape Analysis Tool Suite. Haifa Verification Conference 2016: 202-209 - [c26]Ricardo Almeida
Reduction of Nondeterministic Tree Automata. TACAS 2016: 717-735 - [c25]Lukás Holík
Run Forester, Run Backwards! - (Competition Contribution). TACAS 2016: 923-926 - [c24]Frédéric Haziza, Lukás Holík
Pointer Race Freedom. VMCAI 2016: 393-412 - [c23]Kamil Dudka, Lukás Holík
From Low-Level Pointers to High-Level Containers. VMCAI 2016: 431-452 - [e2]Jan Bouda, Lukás Holík, Jan Kofron, Jan Strejcek, Adam Rambousek:
Proceedings 11th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2016, Telč, Czech Republic, 21st-23rd October 2016. EPTCS 233, 2016 [contents] - [i6]Lukás Holík, Roland Meyer, Sebastian Muskalla:
Antichains for Inclusion Games. CoRR abs/1603.07256 (2016) - 2015
- [c22]Lukás Holík
Mediator Synthesis in a Component Algebra with Data. Correct System Design 2015: 238-259 - [c21]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen
Norn: An SMT Solver for String Constraints. CAV (1) 2015: 462-469 - [c20]Lukás Holík
Antichains for the Verification of Recursive Programs. NETYS 2015: 322-336 - [c19]Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík:
View Abstraction - A Tutorial (Invited Paper). SynCoP 2015: 1-15 - [c18]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: 432-435 - [c17]Tomás Fiedor, Lukás Holík
Nested Antichains for WS1S. TACAS 2015: 658-674 - [i5]Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Nested Antichains for WS1S. CoRR abs/1501.03849 (2015) - [i4]Kamil Dudka, Lukás Holík, Petr Peringer, Marek Trtík, Tomás Vojnar:
From Low-Level Pointers to High-Level Containers. CoRR abs/1510.07995 (2015) - [i3]Frédéric Haziza, Lukás Holík, Roland Meyer, Sebastian Wolff:
Pointer Race Freedom. CoRR abs/1511.00184 (2015) - [i2]Ricardo Almeida, Lukás Holík, Richard Mayr:
Reduction of Nondeterministic Tree Automata. CoRR abs/1512.08823 (2015) - 2014
- [j3]Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík
Mediating for reduction (on minimizing alternating Büchi automata). Theor. Comput. Sci. 552: 26-43 (2014) - [c16]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen
String Constraints for Verification. CAV 2014: 150-166 - [c15]Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík:
Block Me If You Can! - Context-Sensitive Parameterized Verification. SAS 2014: 1-17 - [e1]Lukás Holík
Proceedings 15th International Workshop on Verification of Infinite-State Systems, INFINITY 2013, Hanoi, Vietnam, 14th October 2013. EPTCS 140, 2014 [contents] - 2013
- [c14]Parosh Aziz Abdulla, Lukás Holík
Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. ATVA 2013: 224-239 - [c13]Lukás Holík
Fully Automated Shape Analysis Based on Forest Automata. CAV 2013: 740-755 - [c12]Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík
An Integrated Specification and Verification Technique for Highly Concurrent Data Structures. TACAS 2013: 324-338 - [c11]Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík
All for the Price of Few. VMCAI 2013: 476-495 - [i1]Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar:
Fully Automated Shape Analysis Based on Forest Automata. CoRR abs/1304.5806 (2013) - 2012
- [j2]Peter Habermehl, Lukás Holík
Forest automata for verification of heap manipulation. Formal Methods Syst. Des. 41(1): 83-106 (2012) - 2011
- [c10]Lukás Holík
Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata. ATVA 2011: 243-258 - [c9]Peter Habermehl, Lukás Holík
Forest Automata for Verification of Heap Manipulation. CAV 2011: 424-440 - [c8]Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík
Advanced Ramsey-Based Büchi Automata Inclusion Testing. CONCUR 2011: 187-202 - 2010
- [c7]Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík
Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing. CAV 2010: 132-147 - [c6]Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík
When Simulation Meets Antichains. TACAS 2010: 158-174
2000 – 2009
- 2009
- [j1]Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík
Composed Bisimulation for Tree Automata. Int. J. Found. Comput. Sci. 20(4): 685-700 (2009) - [c5]Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Tomás Vojnar:
Mediating for Reduction (on Minimizing Alternating Büchi Automata). FSTTCS 2009: 1-12 - 2008
- [c4]Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík
Computing Simulations over Tree Automata. TACAS 2008: 93-108 - [c3]Ahmed Bouajjani, Peter Habermehl, Lukás Holík
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. CIAA 2008: 57-67 - [c2]Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík
Composed Bisimulation for Tree Automata. CIAA 2008: 212-222 - [c1]Parosh Aziz Abdulla, Lukás Holík
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. MEMICS 2008: 27-48
Coauthor Index
[c52] [i23] [j14] [c51] [c50] [i17] [j13] [j11] [j10] [j9] [c45] [d4] [d3] [d2] [i15] [j8] [c43] [c42] [c40] [c39] [d1] [i14] [i13] [i12] [j7] [c38] [c36] [c35] [i11] [c32] [c31] [c30] [c29] [i10] [i9] [i7] [j5] [c27] [c25] [c23] [c18] [c17] [i5] [i4] [j3] [c14] [c13] [i1] [j2] [c10] [c9] [c8] [c7] [c6] [j1] [c5] [c4] [c3] [c2] [c1]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: