Abstract regular model checking. Zbl 1103.68071
Bouajjani, Ahmed; Habermehl, Peter; Vojnar, Tomáš |
|
2004
|
Programs with lists are counter automata. Zbl 1188.68181
Bouajjani, Ahmed; Bozga, Marius; Habermehl, Peter; Iosif, Radu; Moro, Pierre; Vojnar, Tomáš |
|
2006
|
Abstract regular tree model checking of complex dynamic data structures. Zbl 1225.68067
Bouajjani, Ahmed; Habermehl, Peter; Rogalewicz, Adam; Vojnar, Tomáš |
|
2006
|
Deciding entailments in inductive separation logic with tree automata. Zbl 1448.68266
Iosif, Radu; Rogalewicz, Adam; Vojnar, Tomáš |
|
2014
|
When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata). Zbl 1284.68337
Abdulla, Parosh Aziz; Chen, Yu-Fang; Holík, Lukáš; Mayr, Richard; Vojnar, Tomáš |
|
2010
|
Abstract regular tree model checking. Zbl 1273.68221
Bouajjani, Ahmed; Habermehl, Peter; Rogalewicz, Adam; Vojnar, Tomáš |
|
2006
|
Advanced Ramsey-based Büchi automata inclusion testing. Zbl 1343.68130
Abdulla, Parosh Aziz; Chen, Yu-Fang; Clemente, Lorenzo; Holík, Lukáš; Hong, Chih-Duo; Mayr, Richard; Vojnar, Tomáš |
|
2011
|
Regular model checking using inference of regular languages. Zbl 1272.68256
Habermehl, Peter; Vojnar, Tomáš |
|
2005
|
Verifying programs with dynamic 1-selector-linked structures in regular model checking. Zbl 1087.68585
Bouajjani, Ahmed; Habermehl, Peter; Moro, Pierre; Vojnar, Tomáš |
|
2005
|
Forest automata for verification of heap manipulation. Zbl 1284.68398
Habermehl, Peter; Holík, Lukáš; Rogalewicz, Adam; Šimáček, Jiří; Vojnar, Tomáš |
|
2012
|
What else is decidable about integer arrays? Zbl 1139.03007
Habermehl, Peter; Iosif, Radu; Vojnar, Tomáš |
|
2008
|
Computing simulations over tree automata. Efficient techniques for reducing tree automata. Zbl 1134.68391
Abdulla, Parosh A.; Bouajjani, Ahmed; Holík, Lukáš; Kaati, Lisa; Vojnar, Tomáš |
|
2008
|
Antichain-based universality and inclusion testing over nondeterministic finite tree automata. Zbl 1172.68493
Bouajjani, Ahmed; Habermehl, Peter; Holík, Lukáš; Touili, Tayssir; Vojnar, Tomáš |
|
2008
|
Programs with lists are counter automata. Zbl 1217.68059
Bouajjani, Ahmed; Bozga, Marius; Habermehl, Peter; Iosif, Radu; Moro, Pierre; Vojnar, Tomáš |
|
2011
|
VATA: a library for efficient manipulation of non-deterministic tree automata. Zbl 1352.68135
Lengál, Ondřej; Šimáček, Jiří; Vojnar, Tomáš |
|
2012
|
Compositional entailment checking for a fragment of separation logic. Zbl 1453.68046
Enea, Constantin; Lengál, Ondřej; Sighireanu, Mihaela; Vojnar, Tomáš |
|
2014
|
A uniform (bi-)simulation-based framework for reducing tree automata. Zbl 1291.68223
Abdulla, Parosh A.; Holík, Lukáš; Kaati, Lisa; Vojnar, Tomáš |
|
2009
|
Verification of parametric concurrent systems with prioritised FIFO resource management. Zbl 1138.68464
Bouajjani, Ahmed; Habermehl, Peter; Vojnar, Tomáš |
|
2008
|
A logic of singly indexed arrays. Zbl 1182.03032
Habermehl, Peter; Iosif, Radu; Vojnar, Tomáš |
|
2008
|
Nested antichains for WS1S. Zbl 1420.68186
Fiedor, Tomáš; Holík, Lukáš; Lengál, Ondřej; Vojnar, Tomáš |
|
2015
|
Compositional entailment checking for a fragment of separation logic. Zbl 1377.68073
Enea, Constantin; Lengál, Ondřej; Sighireanu, Mihaela; Vojnar, Tomáš |
|
2017
|
Mediating for reduction (on minimizing alternating Büchi automata). Zbl 1248.68280
Abdulla, Parosh A.; Chen, Yu-Fang; Holik, Lukáš; Vojnar, Tomáš |
|
2009
|
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. Zbl 1408.68024
|
|
2019
|
Proving termination of tree manipulating programs. Zbl 1141.68469
Habermehl, Peter; Iosif, Radu; Rogalewicz, Adam; Vojnar, Tomáš |
|
2007
|
Automatic verification of integer array programs. Zbl 1242.68063
Bozga, Marius; Habermehl, Peter; Iosif, Radu; Konečný, Filip; Vojnar, Tomáš |
|
2009
|
Verification of heap manipulating programs with ordered data by extended forest automata. Zbl 1344.68135
Abdulla, Parosh Aziz; Holík, Lukáš; Jonsson, Bengt; Lengál, Ondřej; Trinh, Cong Quy; Vojnar, Tomáš |
|
2013
|
From shapes to amortized complexity. Zbl 1446.68030
Fiedor, Tomáš; Holík, Lukáš; Rogalewicz, Adam; Sinn, Moritz; Vojnar, Tomáš; Zuleger, Florian |
|
2018
|
Composed bisimulation for tree automata. Zbl 1172.68487
Abdulla, Parosh A.; Bouajjani, Ahmed; Holík, Lukáš; Kaati, Lisa; Vojnar, Tomáš |
|
2008
|
Lazy automata techniques for WS1S. Zbl 1452.03090
Fiedor, Tomáš; Holík, Lukáš; Janků, Petr; Lengál, Ondřej; Vojnar, Tomáš |
|
2017
|
Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure. Zbl 1535.03056
Havlena, Vojtěch; Holík, Lukáš; Lengál, Ondřej; Vojnar, Tomáš |
|
2019
|
Monotonic abstraction for programs with multiply-linked structures. Zbl 1286.68304
Abdulla, Parosh Aziz; Cederberg, Jonathan; Vojnar, Tomáš |
|
2013
|
Automated formal analysis and verification: an overview. Zbl 1286.68318
Křena, Bohuslav; Vojnar, Tomáš |
|
2013
|
Counterexample validation and interpolation-based refinement for forest automata. Zbl 1484.68103
Holík, Lukáš; Hruška, Martin; Lengál, Ondřej; Rogalewicz, Adam; Vojnar, Tomáš |
|
2017
|
Verification of heap manipulating programs with ordered data by extended forest automata. Zbl 1344.68136
Abdulla, Parosh Aziz; Holík, Lukáš; Jonsson, Bengt; Lengál, Ondřej; Trinh, Cong Quy; Vojnar, Tomáš |
|
2016
|
Mediating for reduction (on minimizing alternating Büchi automata). Zbl 1360.68536
Abdulla, Parosh Aziz; Chen, Yu-Fang; Holík, Lukáš; Vojnar, Tomáš |
|
2014
|
Efficient inclusion checking on explicit and semi-symbolic tree automata. Zbl 1348.68105
Holík, Lukáš; Lengál, Ondřej; Šimáček, Jiří; Vojnar, Tomáš |
|
2011
|
Generalised multi-pattern-based verification of programs with linear linked structures. Zbl 1125.68072
Češka, Milan; Erlebach, Pavel; Vojnar, Tomáš |
|
2007
|
Mathematical and engineering methods in computer science. 7th international doctoral workshop, MEMICS 2011, Lednice, Czech Republic, October 14–16, 2011. Revised selected papers. Zbl 1234.68009
|
|
2012
|
From low-level pointers to high-level containers. Zbl 1475.68084
Dudka, Kamil; Holík, Lukáš; Peringer, Petr; Trtík, Marek; Vojnar, Tomáš |
|
2016
|
Nested antichains for WS1S. Zbl 1417.68182
Fiedor, Tomáš; Holík, Lukáš; Lengál, Ondřej; Vojnar, Tomáš |
|
2019
|
Automata-based verification of programs with tree updates. Zbl 1185.68414
Habermehl, Peter; Iosif, Radu; Vojnar, Tomáš |
|
2010
|
Composed bisimulation for tree automata. Zbl 1176.68098
Abdulla, Parosh Aziz; Bouajjani, Ahmed; Holík, Lukáš; Kaati, Lisa; Vojnar, Tomáš |
|
2009
|
Succinct determinisation of counting automata via sphere construction. Zbl 07834989
Holík, Lukáš; Lengál, Ondřej; Saarikivi, Olli; Turoňová, Lenka; Veanes, Margus; Vojnar, Tomáš |
|
2019
|
Pattern-based verification of programs with extended linear linked data structures. Zbl 1276.68055
Češka, Milan; Erlebach, Pavel; Vojnar, Tomáš |
|
2006
|
Abstraction refinement and antichains for trace inclusion of infinite state systems. Zbl 1420.68107
Iosif, Radu; Rogalewicz, Adam; Vojnar, Tomáš |
|
2016
|
Simulation algorithms for symbolic automata. Zbl 1517.68196
Holík, Lukáš; Lengál, Ondřej; Síč, Juraj; Veanes, Margus; Vojnar, Tomáš |
|
2018
|
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. Zbl 1408.68024
|
|
2019
|
Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure. Zbl 1535.03056
Havlena, Vojtěch; Holík, Lukáš; Lengál, Ondřej; Vojnar, Tomáš |
|
2019
|
Nested antichains for WS1S. Zbl 1417.68182
Fiedor, Tomáš; Holík, Lukáš; Lengál, Ondřej; Vojnar, Tomáš |
|
2019
|
Succinct determinisation of counting automata via sphere construction. Zbl 07834989
Holík, Lukáš; Lengál, Ondřej; Saarikivi, Olli; Turoňová, Lenka; Veanes, Margus; Vojnar, Tomáš |
|
2019
|
From shapes to amortized complexity. Zbl 1446.68030
Fiedor, Tomáš; Holík, Lukáš; Rogalewicz, Adam; Sinn, Moritz; Vojnar, Tomáš; Zuleger, Florian |
|
2018
|
Simulation algorithms for symbolic automata. Zbl 1517.68196
Holík, Lukáš; Lengál, Ondřej; Síč, Juraj; Veanes, Margus; Vojnar, Tomáš |
|
2018
|
Compositional entailment checking for a fragment of separation logic. Zbl 1377.68073
Enea, Constantin; Lengál, Ondřej; Sighireanu, Mihaela; Vojnar, Tomáš |
|
2017
|
Lazy automata techniques for WS1S. Zbl 1452.03090
Fiedor, Tomáš; Holík, Lukáš; Janků, Petr; Lengál, Ondřej; Vojnar, Tomáš |
|
2017
|
Counterexample validation and interpolation-based refinement for forest automata. Zbl 1484.68103
Holík, Lukáš; Hruška, Martin; Lengál, Ondřej; Rogalewicz, Adam; Vojnar, Tomáš |
|
2017
|
Verification of heap manipulating programs with ordered data by extended forest automata. Zbl 1344.68136
Abdulla, Parosh Aziz; Holík, Lukáš; Jonsson, Bengt; Lengál, Ondřej; Trinh, Cong Quy; Vojnar, Tomáš |
|
2016
|
From low-level pointers to high-level containers. Zbl 1475.68084
Dudka, Kamil; Holík, Lukáš; Peringer, Petr; Trtík, Marek; Vojnar, Tomáš |
|
2016
|
Abstraction refinement and antichains for trace inclusion of infinite state systems. Zbl 1420.68107
Iosif, Radu; Rogalewicz, Adam; Vojnar, Tomáš |
|
2016
|
Nested antichains for WS1S. Zbl 1420.68186
Fiedor, Tomáš; Holík, Lukáš; Lengál, Ondřej; Vojnar, Tomáš |
|
2015
|
Deciding entailments in inductive separation logic with tree automata. Zbl 1448.68266
Iosif, Radu; Rogalewicz, Adam; Vojnar, Tomáš |
|
2014
|
Compositional entailment checking for a fragment of separation logic. Zbl 1453.68046
Enea, Constantin; Lengál, Ondřej; Sighireanu, Mihaela; Vojnar, Tomáš |
|
2014
|
Mediating for reduction (on minimizing alternating Büchi automata). Zbl 1360.68536
Abdulla, Parosh Aziz; Chen, Yu-Fang; Holík, Lukáš; Vojnar, Tomáš |
|
2014
|
Verification of heap manipulating programs with ordered data by extended forest automata. Zbl 1344.68135
Abdulla, Parosh Aziz; Holík, Lukáš; Jonsson, Bengt; Lengál, Ondřej; Trinh, Cong Quy; Vojnar, Tomáš |
|
2013
|
Monotonic abstraction for programs with multiply-linked structures. Zbl 1286.68304
Abdulla, Parosh Aziz; Cederberg, Jonathan; Vojnar, Tomáš |
|
2013
|
Automated formal analysis and verification: an overview. Zbl 1286.68318
Křena, Bohuslav; Vojnar, Tomáš |
|
2013
|
Forest automata for verification of heap manipulation. Zbl 1284.68398
Habermehl, Peter; Holík, Lukáš; Rogalewicz, Adam; Šimáček, Jiří; Vojnar, Tomáš |
|
2012
|
VATA: a library for efficient manipulation of non-deterministic tree automata. Zbl 1352.68135
Lengál, Ondřej; Šimáček, Jiří; Vojnar, Tomáš |
|
2012
|
Mathematical and engineering methods in computer science. 7th international doctoral workshop, MEMICS 2011, Lednice, Czech Republic, October 14–16, 2011. Revised selected papers. Zbl 1234.68009
|
|
2012
|
Advanced Ramsey-based Büchi automata inclusion testing. Zbl 1343.68130
Abdulla, Parosh Aziz; Chen, Yu-Fang; Clemente, Lorenzo; Holík, Lukáš; Hong, Chih-Duo; Mayr, Richard; Vojnar, Tomáš |
|
2011
|
Programs with lists are counter automata. Zbl 1217.68059
Bouajjani, Ahmed; Bozga, Marius; Habermehl, Peter; Iosif, Radu; Moro, Pierre; Vojnar, Tomáš |
|
2011
|
Efficient inclusion checking on explicit and semi-symbolic tree automata. Zbl 1348.68105
Holík, Lukáš; Lengál, Ondřej; Šimáček, Jiří; Vojnar, Tomáš |
|
2011
|
When simulation meets antichains. (On checking language inclusion of nondeterministic finite (tree) automata). Zbl 1284.68337
Abdulla, Parosh Aziz; Chen, Yu-Fang; Holík, Lukáš; Mayr, Richard; Vojnar, Tomáš |
|
2010
|
Automata-based verification of programs with tree updates. Zbl 1185.68414
Habermehl, Peter; Iosif, Radu; Vojnar, Tomáš |
|
2010
|
A uniform (bi-)simulation-based framework for reducing tree automata. Zbl 1291.68223
Abdulla, Parosh A.; Holík, Lukáš; Kaati, Lisa; Vojnar, Tomáš |
|
2009
|
Mediating for reduction (on minimizing alternating Büchi automata). Zbl 1248.68280
Abdulla, Parosh A.; Chen, Yu-Fang; Holik, Lukáš; Vojnar, Tomáš |
|
2009
|
Automatic verification of integer array programs. Zbl 1242.68063
Bozga, Marius; Habermehl, Peter; Iosif, Radu; Konečný, Filip; Vojnar, Tomáš |
|
2009
|
Composed bisimulation for tree automata. Zbl 1176.68098
Abdulla, Parosh Aziz; Bouajjani, Ahmed; Holík, Lukáš; Kaati, Lisa; Vojnar, Tomáš |
|
2009
|
What else is decidable about integer arrays? Zbl 1139.03007
Habermehl, Peter; Iosif, Radu; Vojnar, Tomáš |
|
2008
|
Computing simulations over tree automata. Efficient techniques for reducing tree automata. Zbl 1134.68391
Abdulla, Parosh A.; Bouajjani, Ahmed; Holík, Lukáš; Kaati, Lisa; Vojnar, Tomáš |
|
2008
|
Antichain-based universality and inclusion testing over nondeterministic finite tree automata. Zbl 1172.68493
Bouajjani, Ahmed; Habermehl, Peter; Holík, Lukáš; Touili, Tayssir; Vojnar, Tomáš |
|
2008
|
Verification of parametric concurrent systems with prioritised FIFO resource management. Zbl 1138.68464
Bouajjani, Ahmed; Habermehl, Peter; Vojnar, Tomáš |
|
2008
|
A logic of singly indexed arrays. Zbl 1182.03032
Habermehl, Peter; Iosif, Radu; Vojnar, Tomáš |
|
2008
|
Composed bisimulation for tree automata. Zbl 1172.68487
Abdulla, Parosh A.; Bouajjani, Ahmed; Holík, Lukáš; Kaati, Lisa; Vojnar, Tomáš |
|
2008
|
Proving termination of tree manipulating programs. Zbl 1141.68469
Habermehl, Peter; Iosif, Radu; Rogalewicz, Adam; Vojnar, Tomáš |
|
2007
|
Generalised multi-pattern-based verification of programs with linear linked structures. Zbl 1125.68072
Češka, Milan; Erlebach, Pavel; Vojnar, Tomáš |
|
2007
|
Programs with lists are counter automata. Zbl 1188.68181
Bouajjani, Ahmed; Bozga, Marius; Habermehl, Peter; Iosif, Radu; Moro, Pierre; Vojnar, Tomáš |
|
2006
|
Abstract regular tree model checking of complex dynamic data structures. Zbl 1225.68067
Bouajjani, Ahmed; Habermehl, Peter; Rogalewicz, Adam; Vojnar, Tomáš |
|
2006
|
Abstract regular tree model checking. Zbl 1273.68221
Bouajjani, Ahmed; Habermehl, Peter; Rogalewicz, Adam; Vojnar, Tomáš |
|
2006
|
Pattern-based verification of programs with extended linear linked data structures. Zbl 1276.68055
Češka, Milan; Erlebach, Pavel; Vojnar, Tomáš |
|
2006
|
Regular model checking using inference of regular languages. Zbl 1272.68256
Habermehl, Peter; Vojnar, Tomáš |
|
2005
|
Verifying programs with dynamic 1-selector-linked structures in regular model checking. Zbl 1087.68585
Bouajjani, Ahmed; Habermehl, Peter; Moro, Pierre; Vojnar, Tomáš |
|
2005
|
Abstract regular model checking. Zbl 1103.68071
Bouajjani, Ahmed; Habermehl, Peter; Vojnar, Tomáš |
|
2004
|
