 | 2011 |
| 11 |  | 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 |
| 10 |  | 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 |
| 9 |  | 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 |
| 2010 |
| 8 |  | 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 |
| 7 |  | Parosh Aziz Abdulla,
Yu-Fang Chen,
Lukás Holík,
Richard Mayr,
Tomás Vojnar:
When Simulation Meets Antichains.
TACAS 2010: 158-174 |
| 2009 |
| 6 |  | 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 |
| 5 |  | Parosh Aziz Abdulla,
Lukás Holík,
Lisa Kaati,
Tomás Vojnar:
A Uniform (Bi-)Simulation-Based Framework for Reducing Tree Automata.
Electr. Notes Theor. Comput. Sci. 251: 27-48 (2009) |
| 4 |  | 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) |
| 2008 |
| 3 |  | Parosh Aziz Abdulla,
Ahmed Bouajjani,
Lukás Holík,
Lisa Kaati,
Tomás Vojnar:
Composed Bisimulation for Tree Automata.
CIAA 2008: 212-222 |
| 2 |  | Ahmed Bouajjani,
Peter Habermehl,
Lukás Holík,
Tayssir Touili,
Tomás Vojnar:
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata.
CIAA 2008: 57-67 |
| 1 |  | Parosh Aziz Abdulla,
Ahmed Bouajjani,
Lukás Holík,
Lisa Kaati,
Tomás Vojnar:
Computing Simulations over Tree Automata.
TACAS 2008: 93-108 |