Lukas Holik
Lukas Holik
Verified email at fit.vutbr.cz - Homepage
Title
Cited by
Cited by
Year
When simulation meets antichains
PA Abdulla, YF Chen, L Holík, R Mayr, T Vojnar
International Conference on Tools and Algorithms for the Construction and …, 2010
1262010
String constraints for verification
PA Abdulla, MF Atig, YF Chen, L Holík, A Rezine, P Rümmer, J Stenman
International Conference on Computer Aided Verification, 150-166, 2014
932014
All for the price of few
PA Abdulla, F Haziza, L Holík
International Workshop on Verification, Model Checking, and Abstract …, 2013
832013
Norn: An SMT solver for string constraints
PA Abdulla, MF Atig, YF Chen, L Holík, A Rezine, P Rümmer, J Stenman
International conference on computer aided verification, 462-469, 2015
792015
Antichain-based universality and inclusion testing over nondeterministic finite tree automata
A Bouajjani, P Habermehl, L Holík, T Touili, T Vojnar
International Conference on Implementation and Application of Automata, 57-67, 2008
572008
An integrated specification and verification technique for highly concurrent data structures
PA Abdulla, F Haziza, L Holík, B Jonsson, A Rezine
International Conference on Tools and Algorithms for the Construction and …, 2013
53*2013
Advanced Ramsey-based Büchi automata inclusion testing
PA Abdulla, YF Chen, L Clemente, L Holík, CD Hong, R Mayr, T Vojnar
International Conference on Concurrency Theory, 187-202, 2011
522011
Computing simulations over tree automata
PA Abdulla, A Bouajjani, L Holík, L Kaati, T Vojnar
International Conference on Tools and Algorithms for the Construction and …, 2008
522008
String constraints with concatenation and transducers solved efficiently
L Holík, P Janků, AW Lin, P Rümmer, T Vojnar
Proceedings of the ACM on Programming Languages 2 (POPL), 1-32, 2017
472017
Parameterized verification through view abstraction
P Abdulla, F Haziza, L Holík
International Journal on Software Tools for Technology Transfer 18 (5), 495-516, 2016
472016
Fully automated shape analysis based on forest automata
L Holík, O Lengál, A Rogalewicz, J Šimáček, T Vojnar
International Conference on Computer Aided Verification, 740-755, 2013
472013
Flatten and conquer: a framework for efficient analysis of string constraints
PA Abdulla, MF Atig, YF Chen, BP Diep, L Holík, A Rezine, P Rümmer
ACM SIGPLAN Notices 52 (6), 602-617, 2017
442017
Forest automata for verification of heap manipulation
P Habermehl, L Holík, A Rogalewicz, J Šimáček, T Vojnar
Formal Methods in System Design 41 (1), 83-106, 2012
392012
Forest automata for verification of heap manipulation
P Habermehl, L Holík, A Rogalewicz, J Šimáček, T Vojnar
International Conference on Computer Aided Verification, 424-440, 2011
382011
Simulation subsumption in Ramsey-based Büchi automata universality and inclusion testing
PA Abdulla, YF Chen, L Clemente, L Holík, CD Hong, R Mayr, T Vojnar
International Conference on Computer Aided Verification, 132-147, 2010
372010
Verification of heap manipulating programs with ordered data by extended forest automata
PA Abdulla, L Holík, B Jonsson, O Lengál, CQ Trinh, T Vojnar
Acta Informatica 53 (4), 357-385, 2016
312016
Trau: SMT solver for string constraints
PA Abdulla, MF Atig, YF Chen, BP Diep, L Holík, A Rezine, P Rümmer
2018 Formal Methods in Computer Aided Design (FMCAD), 1-5, 2018
202018
Efficient inclusion checking on explicit and semi-symbolic tree automata
L Holík, O Lengál, J Šimáček, T Vojnar
International Symposium on Automated Technology for Verification and …, 2011
172011
A uniform (bi-) simulation-based framework for reducing tree automata
PA Abdulla, L Holík, L Kaati, T Vojnar
Electronic Notes in Theoretical Computer Science 251, 27-48, 2009
162009
Approximate reduction of finite automata for high-speed network intrusion detection
M Češka, V Havlena, L Holík, O Lengál, T Vojnar
International Journal on Software Tools for Technology Transfer 22 (5), 523-539, 2020
152020
The system can't perform the operation now. Try again later.
Articles 1–20