Mgr. Lukáš Holík

2011Abdulla, P., A., Chen, Y., Clemente, L., Holík, L., Hong, C., Mayr, R., Vojnar, T.: Advanced Ramsey-based Büchi Automata Inclusion Testing, FIT-TR-2011-03, Brno, CZ, FIT VUT, 2011, p. 45
 Abdulla, P., A., Chen, Y., Clemente, L., Holík, L., Hong, C., Mayr, R., Vojnar, T.: Advanced Ramsey-based Büchi Automata Inclusion Testing, In: Lecture Notes in Computer Science, Vol. 2011, No. 6901, DE, p. 187-202, ISSN 0302-9743
 Habermehl, P., Holík, L., Rogalewicz, A., Šimáček, J., Vojnar, T.: Forest Automata for Verification of Heap Manipulation, In: Lecture Notes in Computer Science, Vol. 2011, No. 6806, DE, p. 424-440, ISSN 0302-9743
 Habermehl, P., Holík, L., Rogalewicz, A., Šimáček, J., Vojnar, T.: Forest Automata for Verification of Heap Manipulation, FIT-TR-2011-01, Brno, CZ, FIT VUT, 2011, p. 30
 Holík, L., Lengál, O., Šimáček, J., Vojnar, T.: Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata, In: Lecture Notes in Computer Science, Vol. 2011, No. 6996, DE, p. 243-258, ISSN 0302-9743
 Holík, L., Lengál, O., Šimáček, J., Vojnar, T.: Efficient Inclusion Checking on Explicit and Semi-Symbolic Tree Automata, FIT-TR-2011-04, Brno, CZ, FIT VUT, 2011, p. 22
 Holík, L.: Simulations and Antichains for Efficient Handling of Finite Automata, Brno, CZ, UITS FIT VUT, 2011, p. 128
2010Abdulla, P., A., Clemente, L., Holík, L., Hong, C., Chen, Y., Mayr, R., Vojnar, T.: Simulation Subsumption in Ramsey-based Büchi Automata Universality and Inclusion Testing, FIT-TR-2010-02, Brno, CZ, FIT VUT, 2010, p. 30
 Abdulla, P., A., Clemente, L., Holík, L., Hong, C., Chen, Y., Mayr, R., Vojnar, T.: Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing, In: Computer Aided Verification, Berlín, DE, Springer, 2010, p. 132-147, ISBN 978-3-642-14294-9
 Abdulla, P., A., Holík, L., Chen, Y., Mayr, R., Vojnar, T.: When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata), FIT-TR-2010-01, Brno, CZ, FIT VUT, 2010, p. 22
 Abdulla, P., A., Holík, L., Chen, Y., Mayr, R., Vojnar, T.: When Simulation Meets Antichains (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata), In: Tools and Algorithms for the Construction and Analysis of Systems, Berlín, DE, Springer, 2010, p. 158-174, ISBN 978-3-642-12001-5
 Holík, L., Šimáček, J.: Optimizing an LTS-Simulation Algorithm, In: Computing and Informatics, Vol. 2010, No. 7, Bratislava, SK, p. 1337-1348, ISSN 1335-9150
 Holík, L., Vojnar, T.: Simulations and Aintichains for Efficient Handling of Tree Automata, Brno, CZ, FIT VUT, 2010, p. 150, ISBN 978-80-214-4217-7
2009Abdulla, P., A., Bouajjani, A., Holík, L., Kaati, L., Vojnar, T.: Composed Bisimulation for Tree Automata, In: International Journal of Foundations of Computer Science, Vol. 20, No. 4, 2009, SG, p. 685-700, ISSN 0129-0541
 Abdulla, P., A., Holík, L., Chen, Y., Vojnar, T.: Mediating for Reduction (On Minimizing Alternating Büchi Automata), Brno, CZ, FIT VUT, 2009, p. 26
 Abdulla, P., A., Holík, L., Chen, Y., Vojnar, T.: Mediating for Reduction (On Minimizing Alternating Büchi Automata), FIT-TR-2009-02, Brno, CZ, 2009, p. 29
 Abdulla, P., A., Holík, L., Chen, Y., Vojnar, T.: Mediating for Reduction (On Minimizing Alternating Büchi Automata), In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (2009), Wadern, DE, DROPS, 2009, p. 1-12, ISBN 978-3-939897-13-2
 Abdulla, P., A., Holík, L., Kaati, L., Vojnar, T.: A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata, In: ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, Vol. 2009, No. 251, US, p. 27-48, ISSN 1571-0661
 Holík, L., Šimáček, J.: Optimizing an LTS-Simulation Algorithm, FIT-TR-2009-03, Brno, CZ, 2009, p. 17
 Holík, L., Šimáček, J.: Optimizing an LTS-Simulation Algorithm, In: 5th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, Znojmo, CZ, FI MUNI, 2009, p. 93-101, ISBN 978-80-87342-04-6
2008Abdulla, P., A., Bouajjani, A., Holík, L., Kaati, L., Vojnar, T.: Composed Bisimulation for Tree Automata, FIT-TR-2008-004, Brno, CZ, 2008, p. 19
 Abdulla, P., A., Bouajjani, A., Holík, L., Kaati, L., Vojnar, T.: Composed Bisimulation for Tree Automata, In: Implementation and Application of Automata, Berlin, DE, Springer, 2008, p. 212-222, ISBN 978-3-540-70843-8
 Abdulla, P., A., Bouajjani, A., Holík, L., Kaati, L., Vojnar, T.: Computing Simulations over Tree Automata (Efficient Techniques for Reducing Tree Automata), In: Tools and Algorithms for the Construction and Analysis of Systems, Berlin, DE, Springer, 2008, p. 93-108, ISBN 978-3-540-78799-0
 Abdulla, P., A., Bouajjani, A., Holík, L., Kaati, L., Vojnar, T.: Computing Simulations over Tree Automata: Efficient Techniques for Reducing Tree Automata, FIT-TR-2008-001, Brno, CZ, 2008, p. 34
 Abdulla, P., A., Holík, L., Kaati, L., Vojnar, T.: A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata, FIT-TR-2008-005, Brno, CZ, 2008, p. 18
 Abdulla, P., A., Holík, L., Kaati, L., Vojnar, T.: A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata, In: 4th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, Brno, CZ, FI MUNI, 2008, p. 3-11, ISBN 978-80-7355-082-0
 Bouajjani, A., Habermehl, P., Holík, L., Touili, T., Vojnar, T.: Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata, In: Implementation and Application of Automata, Berlin, DE, Springer, 2008, p. 57-67, ISBN 978-3-540-70843-8
 Bouajjani, A., Habermehl, P., Holík, L., Touili, T., Vojnar, T.: Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata, FIT-TR-2008-007, Brno, CZ, FIT VUT, 2008, p. 15
 Vojnar, T., Češka, M., Rogalewicz, A., Erlebach, P., Holík, L., Bouajjani, A., Habermehl, P., Touili, T., Moro, P.: Automatická verifikace programů s dynamickými datovými strukturami, In: Inovační podnikání & transfer technologií, Vol. 2008, No. 1, CZ, p. 21-22, ISSN 1210-4612
2007Holík, L., Rogalewicz, A.: Counterexample Analysis in Abstract Regular Tree Model Checking of Complex Dynamic Data Structures, In: Third Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007), Znojmo, CZ, Novotny, 2007, p. 59-66, ISBN 978-80-7355-077-6

Show all publications

Your IPv4 address: 38.107.179.217
Switch to IPv6 connection

DNSSEC [dnssec]