Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDTomás Vojnar
Person information
- affiliation: Brno University of Technology
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[j26]Milan Ceska, Jirí Matyás, Vojtech Mrazek
, Lukás Sekanina, Zdenek Vasícek, Tomás Vojnar:
Adaptive verifiability-driven strategy for evolutionary approximation of arithmetic circuits. Appl. Soft Comput. 95: 106466 (2020)- [j25]Lukás Holík, Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Abstraction refinement and antichains for trace inclusion of infinite state systems. Formal Methods Syst. Des. 55(3): 137-170 (2020) - [j24]Lenka Turonová, Lukás Holík, Ondrej Lengál, Olli Saarikivi, Margus Veanes, Tomás Vojnar:
Regex matching with counting-set automata. Proc. ACM Program. Lang. 4(OOPSLA): 218:1-218:30 (2020) - [j23]Milan Ceska, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Approximate reduction of finite automata for high-speed network intrusion detection. Int. J. Softw. Tools Technol. Transf. 22(5): 523-539 (2020) - [c105]Vojtech Havlena, Lukás Holík, Ondrej Lengál, Ondrej Vales, Tomás Vojnar:
Antiprenexing for WSkS: A Little Goes a Long Way. LPAR 2020: 298-316 - [c104]Milan Ceska, Jirí Matyás, Vojtech Mrazek, Tomás Vojnar:
Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits. SAT 2020: 481-491 - [c103]Viktor Malík, Peter Schrammel, Tomás Vojnar:
2LS: Heap Analysis and Memory Safety - (Competition Contribution). TACAS (2) 2020: 368-372 - [c102]Petr Peringer, Veronika Soková, Tomás Vojnar:
PredatorHP Revamped (Not Only) for Interval-Sized Memory Regions and Memory Reallocation (Competition Contribution). TACAS (2) 2020: 408-412 - [c101]Marek Chalupa, Tomás Jasek, Lukás Tomovic, Martin Hruska, Veronika Soková, Paulína Ayaziová, Jan Strejcek, Tomás Vojnar:
Symbiotic 7: Integration of Predator and More - (Competition Contribution). TACAS (2) 2020: 413-417 - [i16]Milan Ceska, Jirí Matyás, Vojtech Mrazek, Lukás Sekanina, Zdenek Vasícek, Tomás Vojnar:
Adaptive Verifiability-Driven Strategy for Evolutionary Approximation of Arithmetic Circuits. CoRR abs/2003.02491 (2020) - [i15]Lukás Holík, Petr Janku, Anthony W. Lin, Philipp Rümmer, Tomás Vojnar:
String Constraints with Concatenation and Transducers Solved Efficiently (Technical Report). CoRR abs/2010.15975 (2020)
2010 – 2019
- 2019
- [j22]Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Nested antichains for WS1S. Acta Informatica 56(3): 205-228 (2019) - [j21]Luigi Pomante, Vittoriano Muttillo, Bohuslav Krena, Tomás Vojnar, Filip Veljkovic, Pacome Magnin, Martin Matschnig, Bernhard Fischer, Jabier Martinez, Thomas Gruber:
The AQUAS ECSEL Project Aggregated Quality Assurance for Systems: Co-Engineering Inside and Across the Product Life Cycle. Microprocess. Microsystems 69: 54-67 (2019) - [c100]Yu-Fang Chen, Chang-Yi Chiang, Lukás Holík, Wei-Tsung Kao, Hsin-Hung Lin, Tomás Vojnar, Yean-Fu Wen, Wei-Cheng Wu:
J-ReCoVer: Java Reducer Commutativity Verifier. APLAS 2019: 357-366 - [c99]Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar:
Succinct Determinisation of Counting Automata via Sphere Construction. APLAS 2019: 468-489 - [c98]Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Automata Terms in a Lazy WSkS Decision Procedure. CADE 2019: 300-318 - [c97]Milan Ceska Jr., Milan Ceska, Jirí Matyás, Adam Pankuch, Tomás Vojnar:
Approximating Complex Arithmetic Circuits with Guaranteed Worst-Case Relative Error. EUROCAST (1) 2019: 482-490 - [c96]Milan Ceska, Vojtech Havlena, Lukás Holík, Jan Korenek, Ondrej Lengál, Denis Matousek, Jirí Matousek, Jakub Semric, Tomás Vojnar:
Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata. FCCM 2019: 109-117 - [c95]Mihaela Sighireanu, Juan Antonio Navarro Pérez, Andrey Rybalchenko, Nikos Gorogiannis, Radu Iosif, Andrew Reynolds, Cristina Serban, Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger, Wei-Ngan Chin, Quang Loc Le, Quang-Trung Ta, Ton-Chanh Le, Thanh-Toan Nguyen, Siau-Cheng Khoo, Michal Cyprian, Adam Rogalewicz, Tomás Vojnar, Constantin Enea, Ondrej Lengál, Chong Gao, Zhilin Wu:
SL-COMP: Competition of Solvers for Separation Logic. TACAS (3) 2019: 116-132 - [e8]Tomás Vojnar, Lijun Zhang:
Tools and Algorithms for the Construction and Analysis of Systems - 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part I. Lecture Notes in Computer Science 11427, Springer 2019, ISBN 978-3-030-17461-3 [contents] - [e7]Tomás Vojnar, Lijun Zhang:
Tools and Algorithms for the Construction and Analysis of Systems - 25th International Conference, TACAS 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Prague, Czech Republic, April 6-11, 2019, Proceedings, Part II. Lecture Notes in Computer Science 11428, Springer 2019, ISBN 978-3-030-17464-4 [contents] - [i14]Viktor Malík, Martin Hruska, Peter Schrammel, Tomás Vojnar:
2LS: Heap Analysis and Memory Safety (Competition Contribution). CoRR abs/1903.00712 (2019) - [i13]Milan Ceska, Vojtech Havlena, Lukás Holík, Jan Korenek, Ondrej Lengál, Denis Matousek, Jirí Matousek, Jakub Semric, Tomás Vojnar:
Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata. CoRR abs/1904.10786 (2019) - [i12]Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Automata Terms in a Lazy WSkS Decision Procedure (Technical Report). CoRR abs/1905.08697 (2019) - [i11]Michal Kotoun, Petr Peringer, Veronika Soková, Tomás Vojnar:
PredatorHP Attacks Interval-Sized Regions. CoRR abs/1909.07152 (2019) - [i10]Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar:
Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report). CoRR abs/1910.01996 (2019) - 2018
- [j20]Lukás Holík, Petr Janku, Anthony W. Lin, Philipp Rümmer, Tomás Vojnar:
String constraints with concatenation and transducers solved efficiently. Proc. ACM Program. Lang. 2(POPL): 4:1-4:32 (2018) - [c94]Lukás Holík, Ondrej Lengál, Juraj Síc, Margus Veanes, Tomás Vojnar:
Simulation Algorithms for Symbolic Automata. ATVA 2018: 109-125 - [c93]Milan Ceska, Jirí Matyás, Vojtech Mrazek, Lukás Sekanina, Zdenek Vasícek, Tomás Vojnar:
ADAC: Automated Design of Approximate Circuits. CAV (1) 2018: 612-620 - [c92]Luigi Pomante, Bohuslav Krena, Tomás Vojnar, Filip Veljkovic, Pacome Magnin:
The AQUAS ECSEL Project. DSD 2018: 592-599 - [c91]Viktor Malík, Martin Hruska, Peter Schrammel, Tomás Vojnar:
Template-Based Verification of Heap-Manipulating Programs. FMCAD 2018: 1-9 - [c90]Jan Fiedor, Monika Muzikovská, Ales Smrcka, Ondrej Vasícek, Tomás Vojnar:
Advances in the ANaConDA framework for dynamic analysis and testing of concurrent C/C++ programs. ISSTA 2018: 356-359 - [c89]Milan Ceska, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. TACAS (2) 2018: 155-175 - [c88]Viktor Malík, Stefan Marticek, Peter Schrammel, Mandayam K. Srivas, Tomás Vojnar, Johanan Wahlang:
2LS: Memory Safety and Non-termination - (Competition Contribution). TACAS (2) 2018: 417-421 - [c87]Tomás Fiedor, Lukás Holík, Adam Rogalewicz, Moritz Sinn, Tomás Vojnar, Florian Zuleger:
From Shapes to Amortized Complexity. VMCAI 2018: 205-225 - [p1]João M. Lourenço, Jan Fiedor, Bohuslav Krena, Tomás Vojnar:
Discovering Concurrency Errors. Lectures on Runtime Verification 2018: 34-60 - [i9]Lukás Holík, Ondrej Lengál, Juraj Síc, Margus Veanes, Tomás Vojnar:
Simulation Algorithms for Symbolic Automata (Technical Report). CoRR abs/1807.08487 (2018) - 2017
- [j19]Renata Avros, V. Dudka, Bohuslav Krena, Zdenek Letko, Hana Pluhácková, Shmuel Ur, Tomás Vojnar, Zeev Volkovich:
Boosted decision trees for behaviour mining of concurrent programmes. Concurr. Comput. Pract. Exp. 29(21) (2017) - [j18]Constantin Enea, Ondrej Lengál, Mihaela Sighireanu, Tomás Vojnar:
Compositional entailment checking for a fragment of separation logic. Formal Methods Syst. Des. 51(3): 575-607 (2017) - [c86]Bohuslav Krena, Hana Pluhácková, Shmuel Ur, Tomás Vojnar:
Prediction of Coverage of Expensive Concurrency Metrics Using Cheaper Metrics. EUROCAST (2) 2017: 99-108 - [c85]Milan Ceska, Jirí Matyás, Vojtech Mrazek, Lukás Sekanina, Zdenek Vasícek, Tomás Vojnar:
Approximating complex arithmetic circuits with formal error guarantees: 32-bit multipliers accomplished. ICCAD 2017: 416-423 - [c84]Ricardo J. Dias, Carla Ferreira, Jan Fiedor, João M. Lourenço, Ales Smrcka, Diogo G. Sousa, Tomás Vojnar:
Verifying Concurrent Programs Using Contracts. ICST 2017: 196-206 - [c83]Constantin Enea, Ondrej Lengál, Mihaela Sighireanu, Tomás Vojnar:
SPEN: A Solver for Separation Logic. NFM 2017: 302-309 - [c82]Lukás Holík, Roland Meyer, Tomás Vojnar, Sebastian Wolff:
Effect Summaries for Thread-Modular Analysis - Sound Analysis Despite an Unsound Heuristic. SAS 2017: 169-191 - [c81]Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar:
Forester: From Heap Shapes to Automata Predicates - (Competition Contribution). TACAS (2) 2017: 365-369 - [c80]Tomás Fiedor, Lukás Holík, Petr Janku, Ondrej Lengál, Tomás Vojnar:
Lazy Automata Techniques for WS1S. TACAS (1) 2017: 407-425 - [c79]Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Tomás Vojnar:
Counterexample Validation and Interpolation-Based Refinement for Forest Automata. VMCAI 2017: 288-309 - [i8]Tomás Fiedor, Lukás Holík, Petr Janku, Ondrej Lengál, Tomás Vojnar:
Lazy Automata Techniques for WS1S. CoRR abs/1701.06282 (2017) - [i7]Lukás Holík, Roland Meyer, Tomás Vojnar, Sebastian Wolff:
Effect Summaries for Thread-Modular Analysis. CoRR abs/1705.03701 (2017) - [i6]Milan Ceska, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. CoRR abs/1710.08647 (2017) - 2016
- [j17]Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar:
Verification of heap manipulating programs with ordered data by extended forest automata. Acta Informatica 53(4): 357-385 (2016) - [c78]Lukás Holík, Michal Kotoun, Petr Peringer, Veronika Soková, Marek Trtík, Tomás Vojnar:
Predator Shape Analysis Tool Suite. Haifa Verification Conference 2016: 202-209 - [c77]Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Abstraction Refinement and Antichains for Trace Inclusion of Infinite State Systems. TACAS 2016: 71-89 - [c76]Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar:
Run Forester, Run Backwards! - (Competition Contribution). TACAS 2016: 923-926 - [c75]Michal Kotoun, Petr Peringer, Veronika Soková, Tomás Vojnar:
Optimized PredatorHP and the SV-COMP Heap and Memory Safety Benchmark - (Competition Contribution). TACAS 2016: 942-945 - [c74]Kamil Dudka, Lukás Holík, Petr Peringer, Marek Trtík, Tomás Vojnar:
From Low-Level Pointers to High-Level Containers. VMCAI 2016: 431-452 - [c73]Lukás Charvát, Ales Smrcka, Tomás Vojnar:
HADES: Microprocessor Hazard Analysis via Formal Verification of Parameterized Systems. MEMICS 2016: 87-93 - [e6]Jan Kofron, Tomás Vojnar:
Mathematical and Engineering Methods in Computer Science - 10th International Doctoral Workshop, MEMICS 2015, Telč, Czech Republic, October 23-25, 2015, Revised Selected Papers. Lecture Notes in Computer Science 9548, Springer 2016, ISBN 978-3-319-29816-0 [contents] - 2015
- [j16]Jan Fiedor, Vendula Hrubá, Bohuslav Krena, Zdenek Letko, Shmuel Ur, Tomás Vojnar:
Advances in noise-based testing of concurrent software. Softw. Test. Verification Reliab. 25(3): 272-309 (2015) - [c72]Jan Fiedor, Zdenek Letko, João Lourenço, Tomás Vojnar:
Dynamic Validation of Contracts in Concurrent Code. EUROCAST 2015: 555-564 - [c71]Lukás Charvát, Ales Smrcka, Tomás Vojnar:
Microprocessor Hazard Analysis Via Formal Verification of Parameterized Systems. EUROCAST 2015: 605-614 - [c70]Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar:
Forester: Shape Analysis Using Tree Automata - (Competition Contribution). TACAS 2015: 432-435 - [c69]Petr Müller, Petr Peringer, Tomás Vojnar:
Predator Hunting Party (Competition Contribution). TACAS 2015: 443-446 - [c68]Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Nested Antichains for WS1S. TACAS 2015: 658-674 - [i5]Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Nested Antichains for WS1S. CoRR abs/1501.03849 (2015) - [i4]Kamil Dudka, Lukás Holík, Petr Peringer, Marek Trtík, Tomás Vojnar:
From Low-Level Pointers to High-Level Containers. CoRR abs/1510.07995 (2015) - 2014
- [j15]Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Tomás Vojnar:
Mediating for reduction (on minimizing alternating Büchi automata). Theor. Comput. Sci. 552: 26-43 (2014) - [c67]Constantin Enea, Ondrej Lengál, Mihaela Sighireanu, Tomás Vojnar:
Compositional Entailment Checking for a Fragment of Separation Logic. APLAS 2014: 314-333 - [c66]Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Deciding Entailments in Inductive Separation Logic with Tree Automata. ATVA 2014: 201-218 - [c65]Jan Fiedor, Zdenek Letko, João Lourenço, Tomás Vojnar:
On Monitoring C/C++ Transactional Memory Programs. MEMICS 2014: 73-87 - [c64]Lukás Charvát, Ales Smrcka, Tomás Vojnar:
Using Formal Verification of Parameterized Systems in RAW Hazard Analysis in Microprocessors. MTV 2014: 83-89 - [c63]Vendula Hrubá, Bohuslav Krena, Zdenek Letko, Hana Pluhácková, Tomás Vojnar:
Multi-objective Genetic Optimization for Noise-Based Testing of Concurrent Software. SSBSE 2014: 107-122 - [c62]Petr Müller, Tomás Vojnar:
CPAlien: Shape Analyzer for CPAChecker - (Competition Contribution). TACAS 2014: 395-397 - [c61]Kamil Dudka, Petr Peringer, Tomás Vojnar:
Predator: A Shape Analyzer Based on Symbolic Memory Graphs - (Competition Contribution). TACAS 2014: 412-414 - [i3]Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Deciding Entailments in Inductive Separation Logic with Tree Automata. CoRR abs/1402.2127 (2014) - [i2]Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Abstraction Refinement for Trace Inclusion of Data Automata. CoRR abs/1410.5056 (2014) - 2013
- [j14]Parosh Aziz Abdulla, Jonathan Cederberg, Tomás Vojnar:
Monotonic Abstraction for Programs with Multiply-Linked Structures. Int. J. Found. Comput. Sci. 24(2): 187-210 (2013) - [j13]Bohuslav Krena, Tomás Vojnar:
Automated formal analysis and verification: an overview. Int. J. Gen. Syst. 42(4): 335-365 (2013) - [c60]Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar:
Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. ATVA 2013: 224-239 - [c59]Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar:
Fully Automated Shape Analysis Based on Forest Automata. CAV 2013: 740-755 - [c58]Lukás Charvát, Ales Smrcka, Tomás Vojnar:
An Abstraction of Multi-port Memories with Arbitrary Addressable Units. EUROCAST (1) 2013: 460-468 - [c57]Kamil Dudka, Petr Peringer, Tomás Vojnar:
Byte-Precise Verification of Low-Level List Manipulation. SAS 2013: 215-237 - [c56]Kamil Dudka, Petr Müller, Petr Peringer, Tomás Vojnar:
Predator: A Tool for Verification of Low-Level List Manipulation - (Competition Contribution). TACAS 2013: 627-629 - [e5]Antonín Kucera, Thomas A. Henzinger, Jaroslav Nesetril, Tomás Vojnar, David Antos:
Mathematical and Engineering Methods in Computer Science, 8th International Doctoral Workshop, MEMICS 2012, Znojmo, Czech Republic, October 25-28, 2012, Revised Selected Papers. Lecture Notes in Computer Science 7721, Springer 2013, ISBN 978-3-642-36044-2 [contents] - [i1]Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar:
Fully Automated Shape Analysis Based on Forest Automata. CoRR abs/1304.5806 (2013) - 2012
- [j12]Zdenek Kotásek, Lukás Sekanina, Tomás Vojnar, Jan Bouda, Ivana Cerná:
pecial CAI Section Devoted to MEMICS '11: Preface. Comput. Informatics 31(3): 481- (2012) - [j11]Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar:
Forest automata for verification of heap manipulation. Formal Methods Syst. Des. 41(1): 83-106 (2012) - [j10]Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar:
Abstract regular (tree) model checking. Int. J. Softw. Tools Technol. Transf. 14(2): 167-191 (2012) - [c55]Jan Fiedor, Tomás Vojnar:
Noise-based testing and analysis of multi-threaded C/C++ programs on the binary level. PADTAD 2012: 36-46 - [c54]Lukás Charvát, Ales Smrcka, Tomás Vojnar:
Automatic Formal Correspondence Checking of ISA and RTL Microprocessor Description. MTV 2012: 6-12 - [c53]Jan Fiedor, Tomás Vojnar:
ANaConDA: A Framework for Analysing Multi-threaded C/C++ Programs on the Binary Level. RV 2012: 35-41 - [c52]Vendula Hrubá, Bohuslav Krena, Zdenek Letko, Shmuel Ur, Tomás Vojnar:
Testing of Concurrent Programs Using Genetic Algorithms. SSBSE 2012: 152-167 - [c51]Ondrej Lengál, Jirí Simácek, Tomás Vojnar:
VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata. TACAS 2012: 79-94 - [c50]Kamil Dudka, Petr Müller, Petr Peringer, Tomás Vojnar:
Predator: A Verification Tool for Programs with Dynamic Linked Data Structures - (Competition Contribution). TACAS 2012: 545-548 - [e4]Zdenek Kotásek, Jan Bouda, Ivana Cerná, Lukás Sekanina, Tomás Vojnar, David Antos:
Mathematical and Engineering Methods in Computer Science - 7th International Doctoral Workshop, MEMICS 2011, Lednice, Czech Republic, October 14-16, 2011, Revised Selected Papers. Lecture Notes in Computer Science 7119, Springer 2012, ISBN 978-3-642-25928-9 [contents] - 2011
- [j9]Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás Vojnar:
Programs with lists are counter automata. Formal Methods Syst. Des. 38(2): 158-192 (2011) - [c49]Lukás Holík, Ondrej Lengál, Jirí Simácek, Tomás Vojnar:
Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata. ATVA 2011: 243-258 - [c48]Kamil Dudka, Petr Peringer, Tomás Vojnar:
Predator: A Practical Tool for Checking Manipulation of Dynamic Data Structures Using Separation Logic. CAV 2011: 372-378 - [c47]Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar:
Forest Automata for Verification of Heap Manipulation. CAV 2011: 424-440 - [c46]Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar:
Advanced Ramsey-Based Büchi Automata Inclusion Testing. CONCUR 2011: 187-202 - [c45]Jan Fiedor, Bohuslav Krena, Zdenek Letko, Tomás Vojnar:
A Uniform Classification of Common Concurrency Errors. EUROCAST (1) 2011: 519-526 - [c44]Kamil Dudka, Petr Peringer, Tomás Vojnar:
An Easy to Use Infrastructure for Building Static Analysis Tools. EUROCAST (1) 2011: 527-534 - [c43]Bohuslav Krena, Zdenek Letko, Tomás Vojnar:
Noise Injection Heuristics for Concurrency Testing. MEMICS 2011: 123-135 - [c42]Parosh Aziz Abdulla, Jonathan Cederberg, Tomás Vojnar:
Monotonic Abstraction for Programs with Multiply-Linked Structures. RP 2011: 125-138 - [c41]Bohuslav Krena, Zdenek Letko, Tomás Vojnar:
Coverage Metrics for Saturation-Based and Search-Based Testing of Concurrent Software. RV 2011: 177-192 - [c40]Jan Fiedor, Vendula Hrubá, Bohuslav Krena, Tomás Vojnar:
DA-BMC: A Tool Chain Combining Dynamic Analysis and Bounded Model Checking. RV 2011: 375-380 - [c39]Tomás Vojnar:
Efficient Algorithms for Handling Nondeterministic Automata. SOFSEM 2011: 73 - [e3]Ludek Matyska, Michal Kozubek, Tomás Vojnar, Pavel Zemcík, David Antos:
Sixth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, MEMICS 2010, Selected Papers, October 22-24, 2010, Mikulov, Czech Republic. OASICS 16, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany 2011, ISBN 978-3-939897-22-4 [contents] - 2010
- [j8]Peter Habermehl, Radu Iosif, Tomás Vojnar:
Automata-based verification of programs with tree updates. Acta Informatica 47(1): 1-31 (2010) - [c38]Marius Bozga, Radu Iosif, Filip Konecný, Tomás Vojnar:
Tool Demonstration of the FLATA Counter Automata Toolset. WING@ETAPS/IJCAR 2010: 75 - [c37]Parosh Aziz Abdulla, Yu-Fang Chen, Lorenzo Clemente, Lukás Holík, Chih-Duo Hong, Richard Mayr, Tomás Vojnar:
Simulation Subsumption in Ramsey-Based Büchi Automata Universality and Inclusion Testing. CAV 2010: 132-147 - [c36]Bohuslav Krena, Zdenek Letko, Tomás Vojnar, Shmuel Ur:
A platform for search-based testing of concurrent software. PDATAD 2010: 48-58 - [c35]Boris Prochazka, Tomás Vojnar, Martin Drahanský:
Hijacking the Linux Kernel. MEMICS 2010: 85-92 - [c34]Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Richard Mayr, Tomás Vojnar:
When Simulation Meets Antichains. TACAS 2010: 158-174
2000 – 2009
- 2009
- [j7]Milan Ceska, Zdenek Kotásek, Mojmír Kretínský, Ludek Matyska, Tomás Vojnar:
Preface. Electron. Notes Theor. Comput. Sci. 251: 1-3 (2009) - [j6]Parosh Aziz Abdulla, Lukás Holík, Lisa Kaati, Tomás Vojnar:
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata. Electron. Notes Theor. Comput. Sci. 251: 27-48 (2009) - [j5]Parosh Aziz Abdulla, Ahmed Bouajjani, Lukás Holík, Lisa Kaati, Tomás Vojnar:
Composed Bisimulation for Tree Automata. Int. J. Found. Comput. Sci. 20(4): 685-700 (2009) - [c33]Marius Bozga, Peter Habermehl, Radu Iosif, Filip Konecný, Tomás Vojnar:
Automatic Verification of Integer Array Programs. CAV 2009: 157-172 - [c32]Vendula Hrubá, Bohuslav Krena, Tomás Vojnar:
Self-healing Assurance Based on Bounded Model Checking. EUROCAST 2009: 295-303 - [c31]Parosh Aziz Abdulla, Yu-Fang Chen, Lukás Holík, Tomás Vojnar:
Mediating for Reduction (on Minimizing Alternating Büchi Automata). FSTTCS 2009: 1-12 - [c30]Petr Hlinený, Václav Matyás, Tomás Vojnar:
Preface -- Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS'09). MEMICS 2009 - [c29]