Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDLukás Holík
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j12]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): 137-170 (2020)- [j11]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): 218:1-218:30 (2020) - [j10]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): 523-539 (2020) - [c44]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: 298-316 - [c43]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: 943-957 - [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
- [j9]Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Nested antichains for WS1S. Acta Informatica 56(3): 205-228 (2019) - [c42]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: 357-366 - [c41]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: 468-489 - [c40]Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bui Phi Diep, Lukás Holík, Petr Janku:
Chain-Free String Constraints. ATVA 2019: 277-293 - [c39]Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Automata Terms in a Lazy WSkS Decision Procedure. CADE 2019: 300-318 - [c38]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: 109-117 - [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
- [j8]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): 4:1-4:32 (2018) - [c37]Lukás Holík, Ondrej Lengál, Juraj Síc, Margus Veanes, Tomás Vojnar:
Simulation Algorithms for Symbolic Automata. ATVA 2018: 109-125 - [c36]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: 1-5 - [c35]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: 155-175 - [c34]Tomás Fiedor, Lukás Holík, Adam Rogalewicz, Moritz Sinn, Tomás Vojnar, Florian Zuleger:
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
- [j7]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 for highly concurrent data structures. Int. J. Softw. Tools Technol. Transf. 19(5): 549-563 (2017) - [c33]Lenka Turonová, Lukás Holík:
Towards Smaller Invariants for Proving Coverability. EUROCAST (2) 2017: 109-116 - [c32]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: 602-617 - [c31]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: 169-191 - [c30]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: 365-369 - [c29]Tomás Fiedor, Lukás Holík, Petr Janku, Ondrej Lengál, Tomás Vojnar:
Lazy Automata Techniques for WS1S. TACAS (1) 2017: 407-425 - [c28]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: 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
- [j6]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): 357-385 (2016) - [j5]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) - [c27]Lukás Holík, Roland Meyer, Sebastian Muskalla:
Summaries for Context-Free Games. FSTTCS 2016: 41:1-41:16 - [c26]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: 202-209 - [c25]Ricardo Almeida, Lukás Holík, Richard Mayr:
Reduction of Nondeterministic Tree Automata. TACAS 2016: 717-735 - [c24]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: 923-926 - [c23]Frédéric Haziza, Lukás Holík, Roland Meyer, Sebastian Wolff:
Pointer Race Freedom. VMCAI 2016: 393-412 - [c22]Kamil Dudka, Lukás Holík, Petr Peringer, Marek Trtík, Tomás Vojnar:
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
- [c21]Lukás Holík, Malte Isberner, Bengt Jonsson:
Mediator Synthesis in a Component Algebra with Data. Correct System Design 2015: 238-259 - [c20]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: 462-469 - [c19]Lukás Holík, Roland Meyer:
Antichains for the Verification of Recursive Programs. NETYS 2015: 322-336 - [c18]Parosh Aziz Abdulla, Frédéric Haziza, Lukás Holík:
View Abstraction - A Tutorial (Invited Paper). SynCoP 2015: 1-15 - [c17]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 - [c16]Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
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
- [j4]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: 26-43 (2014) - [c15]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: 150-166 - [c14]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, Lorenzo Clemente:
Proceedings 15th International Workshop on Verification of Infinite-State Systems, INFINITY 2013, Hanoi, Vietnam, 14th October 2013. EPTCS 140, 2014 [contents] - 2013
- [c13]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: 224-239 - [c12]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: 740-755 - [c11]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: 324-338 - [c10]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
- [j3]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): 83-106 (2012) - 2011
- [c9]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: 243-258 - [c8]Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar:
Forest Automata for Verification of Heap Manipulation. CAV 2011: 424-440 - [c7]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: 187-202 - 2010
- [c6]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: 132-147 - [c5]Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Richard Mayr, Tomás Vojnar:
When Simulation Meets Antichains. TACAS 2010: 158-174
2000 – 2009
- 2009
- [j2]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: 27-48 (2009) - [j1]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): 685-700 (2009) - [c4]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
- [c3]Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar:
Computing Simulations over Tree Automata. TACAS 2008: 93-108 - [c2]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: 57-67 - [c1]Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar:
Composed Bisimulation for Tree Automata. CIAA 2008: 212-222
Coauthor Index
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-02-18 23:39 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
