Lukas Holik
Lukas Holik
Dirección de correo verificada de fit.vutbr.cz - Página principal
Título
Citado por
Citado por
Año
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
1182010
All for the price of few
PA Abdulla, F Haziza, L Holík
International Workshop on Verification, Model Checking, and Abstract …, 2013
722013
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
652014
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
512015
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
512008
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
49*2013
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
422008
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
392011
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
372013
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
352012
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
352011
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
302016
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
302010
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
262016
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
222017
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
222017
Composed bisimulation for tree automata
PA Abdulla, A Bouajjani, L Holík, L Kaati, T Vojnar
International Conference on Implementation and Application of Automata, 212-222, 2008
152008
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
132009
Optimizing an LTS-simulation algorithm
L Holík, J Šimáček
Computing and Informatics 29 (6+), 1337-1348, 2012
122012
Mediating for reduction (on minimizing alternating Büchi automata)
PA Abdulla, YF Chen, L Holik, T Vojnar
IARCS Annual Conference on Foundations of Software Technology and …, 2009
122009
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20