Spremljaj
Tomas Vojnar
Tomas Vojnar
FI, Masaryk University & FIT, Brno University of Technology
Preverjeni e-poštni naslov na fi.muni.cz - Domača stran
Naslov
Navedeno
Navedeno
Leto
Abstract regular model checking
A Bouajjani, P Habermehl, T Vojnar
Computer Aided Verification: 16th International Conference, CAV 2004, Boston …, 2004
2152004
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
1632010
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
1432006
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
1342006
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
922007
Byte-precise verification of low-level list manipulation
K Dudka, P Peringer, T Vojnar
International Static Analysis Symposium, 215-237, 2013
892013
Predator: A practical tool for checking manipulation of dynamic data structures using separation logic
K Dudka, P Peringer, T Vojnar
International Conference on Computer Aided Verification, 372-378, 2011
892011
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
882005
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
832017
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
832012
Deciding entailments in inductive separation logic with tree automata
R Iosif, A Rogalewicz, T Vojnar
Automated Technology for Verification and Analysis: 12th International …, 2014
802014
What else is decidable about integer arrays?
P Habermehl, R Iosif, T Vojnar
International Conference on Foundations of Software Science and …, 2008
802008
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
742017
Regular model checking using inference of regular languages
P Habermehl, T Vojnar
Electronic Notes in Theoretical Computer Science 138 (3), 21-36, 2005
742005
Abstract regular tree model checking
A Bouajjani, P Habermehl, A Rogalewicz, T Vojnar
Electronic Notes in Theoretical Computer Science 149 (1), 37-48, 2006
732006
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
702012
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
702008
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
692011
Computing Simulations over Tree Automata: (Efficient Techniques for Reducing Tree Automata)
PA Abdulla, A Bouajjani, L Holík, L Kaati, T Vojnar
International Conference on Tools and Algorithms for the Construction and …, 2008
682008
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
652009
Sistem trenutno ne more izvesti postopka. Poskusite znova pozneje.
Članki 1–20