Seguir
Vojtěch Havlena
Vojtěch Havlena
Dirección de correo verificada de fit.vutbr.cz
Título
Citado por
Citado por
Año
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
312020
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 Journal on Software Tools for Technology Transfer 22 (5), 523-539, 2020
302020
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
282019
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
242021
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
132023
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
122022
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
122019
Reducing (to) the ranks: Efficient rank-based Büchi automata complementation
V Havlena, O Lengál
32nd International Conference on Concurrency Theory (CONCUR 2021), 2021
112021
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
102022
A symbolic algorithm for the case-split rule in string constraint solving
YF Chen, V Havlena, O Lengál, A Turrini
Programming Languages and Systems: 18th Asian Symposium, APLAS 2020, Fukuoka …, 2020
82020
Complementing Büchi automata with ranker
V Havlena, O Lengál, B Šmahlíková
International Conference on Computer Aided Verification, 188-201, 2022
72022
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
62024
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
62024
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
62023
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
62021
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
52020
Ranker, 2021
V Havlena, O Lengál, B Šmahlíková
URL: https://github. com/vhavlena/ba-inclusion, 0
5
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
42021
Reducing (to) the Ranks: Efficient Rank-based B\"{u} chi Automata Complementation (Technical Report)
V Havlena, O Lengál
arXiv preprint arXiv:2010.07834, 2020
42020
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
32023
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20