| Abstract regular model checking A Bouajjani, P Habermehl, T Vojnar Computer Aided Verification: 16th International Conference, CAV 2004, Boston …, 2004 | 212 | 2004 |
| When Simulation Meets Antichains: (On Checking Language Inclusion of Nondeterministic Finite (Tree) Automata) PA Abdulla, YF Chen, L Holík, R Mayr, T Vojnar International Conference on Tools and Algorithms for the Construction and …, 2010 | 157 | 2010 |
| Programs with lists are counter automata A Bouajjani, M Bozga, P Habermehl, R Iosif, P Moro, T Vojnar International Conference on Computer Aided Verification, 517-531, 2006 | 141 | 2006 |
| Abstract regular tree model checking of complex dynamic data structures A Bouajjani, P Habermehl, A Rogalewicz, T Vojnar Static Analysis: 13th International Symposium, SAS 2006, Seoul, Korea …, 2006 | 132 | 2006 |
| Healing data races on-the-fly B Krena, Z Letko, R Tzoref, S Ur, T Vojnar proceedings of the 2007 ACM Workshop on Parallel and Distributed Systems …, 2007 | 90 | 2007 |
| Predator: A practical tool for checking manipulation of dynamic data structures using separation logic K Dudka, P Peringer, T Vojnar Computer Aided Verification: 23rd International Conference, CAV 2011 …, 2011 | 88 | 2011 |
| Verifying programs with dynamic 1-selector-linked structures in regular model checking A Bouajjani, P Habermehl, P Moro, T Vojnar International Conference on Tools and Algorithms for the Construction and …, 2005 | 88 | 2005 |
| Deciding entailments in inductive separation logic with tree automata R Iosif, A Rogalewicz, T Vojnar Automated Technology for Verification and Analysis: 12th International …, 2014 | 80 | 2014 |
| Byte-precise verification of low-level list manipulation K Dudka, P Peringer, T Vojnar Static Analysis: 20th International Symposium, SAS 2013, Seattle, WA, USA …, 2013 | 80 | 2013 |
| What else is decidable about integer arrays? P Habermehl, R Iosif, T Vojnar International Conference on Foundations of Software Science and …, 2008 | 79 | 2008 |
| 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 | 78 | 2012 |
| 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 | 77 | 2017 |
| Abstract regular tree model checking A Bouajjani, P Habermehl, A Rogalewicz, T Vojnar Electronic Notes in Theoretical Computer Science 149 (1), 37-48, 2006 | 72 | 2006 |
| Regular model checking using inference of regular languages P Habermehl, T Vojnar Electronic Notes in Theoretical Computer Science 138 (3), 21-36, 2005 | 72 | 2005 |
| Approximating complex arithmetic circuits with formal error guarantees: 32-bit multipliers accomplished M Češka, J Matyáš, V Mrazek, L Sekanina, Z Vasicek, T Vojnar 2017 IEEE/ACM International Conference on Computer-Aided Design (ICCAD), 416-423, 2017 | 68 | 2017 |
| 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 | 68 | 2011 |
| 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 | 68 | 2008 |
| Automatic verification of integer array programs M Bozga, P Habermehl, R Iosif, F Konečný, T Vojnar International Conference on Computer Aided Verification, 157-172, 2009 | 64 | 2009 |
| Abstract regular (tree) model checking A Bouajjani, P Habermehl, A Rogalewicz, T Vojnar International Journal on Software Tools for Technology Transfer 14, 167-191, 2012 | 63 | 2012 |
| Fully automated shape analysis based on forest automata L Holík, O Lengál, A Rogalewicz, J Šimáček, T Vojnar Computer Aided Verification: 25th International Conference, CAV 2013, Saint …, 2013 | 62 | 2013 |
Lukas HolikBrno University of Tehcnologyfit.vutbr.cz의 이메일 확인됨
