| Flow based monitoring of ICS communication in the smart grid P Matoušek, O Ryšavý, M Grégr, V Havlena Journal of Information Security and Applications 54, 102535, 2020 | 42 | 2020 |
| Z3-Noodler: An Automata-based String Solver YF Chen, D Chocholatý, V Havlena, L Holík, O Lengál, J Síč International Conference on Tools and Algorithms for the Construction and …, 2024 | 38 | 2024 |
| Deep packet inspection in FPGAs via approximate nondeterministic automata M Ceška, V Havlena, L Holík, J Korenek, O Lengál, D Matoušek, ... 2019 IEEE 27th Annual International Symposium on Field-Programmable Custom …, 2019 | 37 | 2019 |
| Efficient modelling of ICS communication for anomaly detection using probabilistic automata P Matoušek, V Havlena, L Holík 2021 IFIP/IEEE International Symposium on Integrated Network Management (IM …, 2021 | 33 | 2021 |
| Word equations in synergy with regular constraints F Blahoudek, YF Chen, D Chocholatý, V Havlena, L Holík, O Lengál, J Síč International Symposium on Formal Methods, 403-423, 2023 | 31 | 2023 |
| Approximate reduction of finite automata for high-speed network intrusion detection M Češka, V Havlena, L Holík, O Lengál, T Vojnar International Conference on Tools and Algorithms for the Construction and …, 2018 | 31 | 2018 |
| Mata: A Fast and Simple Finite Automata Library D Chocholatý, T Fiedor, V Havlena, L Holík, M Hruška, O Lengál, J Síč International conference on tools and algorithms for the construction and …, 2024 | 26 | 2024 |
| Solving string constraints with lengths by stabilization YF Chen, D Chocholatý, V Havlena, L Holík, O Lengál, J Síč Proceedings of the ACM on Programming Languages 7 (OOPSLA2), 2112-2141, 2023 | 25 | 2023 |
| Accurate automata-based detection of cyber threats in smart grid communication V Havlena, P Matoušek, O Ryšavý, L Holík IEEE Transactions on Smart Grid 14 (3), 2352-2366, 2022 | 22 | 2022 |
| Simulations in rank-based Büchi automata complementation YF Chen, V Havlena, O Lengál Asian Symposium on Programming Languages and Systems, 447-467, 2019 | 13 | 2019 |
| Reducing (to) the ranks: Efficient rank-based Büchi automata complementation V Havlena, O Lengál 32nd International Conference on Concurrency Theory (CONCUR 2021), 2: 1-2: 19, 2021 | 12 | 2021 |
| A symbolic algorithm for the case-split rule in string constraint solving YF Chen, V Havlena, O Lengál, A Turrini Asian Symposium on Programming Languages and Systems, 343-363, 2020 | 12 | 2020 |
| Sky is not the limit: Tighter rank bounds for elevator automata in Büchi automata complementation V Havlena, O Lengál, B Šmahlíková International Conference on Tools and Algorithms for the Construction and …, 2022 | 11 | 2022 |
| Cooking string-integer conversions with noodles V Havlena, L Holík, O Lengál, J Síč 27th International Conference on Theory and Applications of Satisfiability …, 2024 | 10 | 2024 |
| Complementing Büchi automata with ranker V Havlena, O Lengál, B Šmahlíková International Conference on Computer Aided Verification, 188-201, 2022 | 10 | 2022 |
| Algebraic reasoning meets automata in solving linear integer arithmetic P Habermehl, V Havlena, M Hečko, L Holík, O Lengál International Conference on Computer Aided Verification, 42-67, 2024 | 7 | 2024 |
| A symbolic algorithm for the case-split rule in solving word constraints with extensions YF Chen, V Havlena, O Lengál, A Turrini Journal of Systems and Software 201, 111673, 2023 | 7 | 2023 |
| Antiprenexing for WSkS: A Little Goes a Long Way. V Havlena, L Holík, O Lengál, O Vales, T Vojnar LPAR, 298-316, 2020 | 7 | 2020 |
| Automata Terms in a Lazy WSkS Decision Procedure V Havlena, L Holík, O Lengál, T Vojnar Journal of Automated Reasoning 65 (7), 971-999, 2021 | 6 | 2021 |
| Deciding S1S: down the rabbit hole and through the looking glass V Havlena, O Lengál, B Šmahlíková International Conference on Networked Systems, 215-222, 2021 | 6 | 2021 |
Ondřej LengálBrno University of TechnologyVerified email at fit.vutbr.cz
