Publikace

• 2024

  HAVLENA, V.; HEČKO, M.; HOLÍK, L.; LENGÁL, O.; HABERMEHL, P. Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. Proceedings of CAV'24. Lecture Notes in Computer Science. Montreal: Springer Verlag, 2024. s. 42-67. ISSN: 0302-9743.
  Detail

• 2023

  HAVLENA, V.; MATOUŠEK, P.; RYŠAVÝ, O.; HOLÍK, L. Accurate Automata-Based Detection of Cyber Threats in Smart Grid Communication. IEEE Transactions on Smart Grid, 2023, roč. 2023, č. 14, s. 2352-2366. ISSN: 1949-3053.
  Detail | WWW

  HAVLENA, V.; LENGÁL, O.; CHEN, Y.; TURRINI, A. A symbolic algorithm for the case-split rule in solving word constraints with extensions (technical report). Ithaca: Cornell University Library, 2023. s. 0-0.
  Detail

  HAVLENA, V.; CHOCHOLATÝ, D.; LENGÁL, O.; HOLÍK, L.; SÍČ, J.; BLAHOUDEK, F.; CHEN, Y. Word Equations in Synergy with Regular Constraints. In Proceedings of FM'23. Lecture Notes in Computer Science. Lübeck: Springer Verlag, 2023. s. 403-423. ISSN: 0302-9743.
  Detail

  HAVLENA, V.; LENGÁL, O.; CHEN, Y.; TURRINI, A. A symbolic algorithm for the case-split rule in solving word constraints with extensions. JOURNAL OF SYSTEMS AND SOFTWARE, 2023, roč. 201, č. 201, s. 111673-111693. ISSN: 0164-1212.
  Detail | WWW

  HAVLENA, V.; ŠMAHLÍKOVÁ, B.; LENGÁL, O.; LI, Y.; TURRINI, A. Modular Mix-and-Match Complementation of Büchi Automata (Technical Report). Ithaca: Cornell University Library, 2023. s. 1-37.
  Detail

  HAVLENA, V.; ŠMAHLÍKOVÁ, B.; LENGÁL, O.; LI, Y.; TURRINI, A. Modular Mix-and-Match Complementation of Büchi Automata. In Proceedings of TACAS'23. Lecture Notes in Computer Science. Paris: Springer Verlag, 2023. s. 249-270. ISSN: 0302-9743.
  Detail

  CHEN, Y.; CHOCHOLATÝ, D.; HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; SÍČ, J. Solving String Constraints with Lengths by Stabilization. Proceedings of the ACM on Programming Languages, 2023, roč. 7, č. 10, s. 2112-2141. ISSN: 2475-1421.
  Detail | WWW

• 2022

  HAVLENA, V.; LENGÁL, O.; ŠMAHLÍKOVÁ, B. Complementing Büchi Automata with Ranker (Technical Report). Ithaca: Cornell University Library, 2022. s. 0-0.
  Detail | WWW

  HAVLENA, V.; LENGÁL, O.; ŠMAHLÍKOVÁ, B. Complementing Büchi Automata with Ranker. In Proceedings of the 34th International Conference on Computer Aided Verification. Lecture Notes in Computer Science. Haifa: Springer Verlag, 2022. s. 188-201. ISBN: 978-3-031-13187-5. ISSN: 0302-9743.
  Detail

  HAVLENA, V.; LENGÁL, O.; ŠMAHLÍKOVÁ, B. Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in Buchi Automata Complementation (Technical Report). Ithaca: 2022. s. 0-0.
  Detail | WWW

  HAVLENA, V.; LENGÁL, O.; ŠMAHLÍKOVÁ, B. Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in Buchi Automata Complementation. In Proceedings of TACAS'22. Lecture Notes in Computer Science. Munich: Springer Verlag, 2022. s. 118-136. ISBN: 978-3-030-99526-3. ISSN: 0302-9743.
  Detail

• 2021

  HAVLENA, V.; LENGÁL, O. Reducing (to) the Ranks: Efficient Rank-based Büchi Automata Complementation. In 32nd International Conference on Concurrency Theory (CONCUR 2021). Leibniz International Proceedings in Informatics, LIPIcs. Paris: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2021. s. 1-19. ISSN: 1868-8969.
  Detail | WWW

  HAVLENA, V.; LENGÁL, O. Reducing (to) the Ranks: Efficient Rank-based Büchi Automata Complementation (Technical Report). Ithaca: 2021. s. 1-28.
  Detail | WWW

  HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; VOJNAR, T. Automata Terms in a Lazy WSkS Decision Procedure. JOURNAL OF AUTOMATED REASONING, 2021, roč. 65, č. 7, s. 971-999. ISSN: 0168-7433.
  Detail | WWW

  ŠMAHLÍKOVÁ, B.; HAVLENA, V.; LENGÁL, O. Deciding S1S: Down the Rabbit Hole and Through the Looking Glass. In Proceedings of NETYS'21. Lecture Notes in Computer Science. Lecture notes in Computer Science. Cham: Springer Verlag, 2021. s. 215-222. ISSN: 0302-9743.
  Detail

  MATOUŠEK, P.; HAVLENA, V.; HOLÍK, L. Efficient Modelling of ICS Communication For Anomaly Detection Using Probabilistic Automata. In Proceedings of IFIP/IEEE International Symposium on Integrated Network Management. Bordeaux: International Federation for Information Processing, 2021. s. 81-89. ISBN: 978-3-903176-32-4.
  Detail | WWW

• 2020

  HAVLENA, V.; HOLÍK, L.; MATOUŠEK, P. Learning Probabilistic Automata in the Context of IEC 104. IT-TR-2020-01, Brno: Faculty of Information Technology BUT, 2020. s. 0-0.
  Detail | WWW

  MATOUŠEK, P.; RYŠAVÝ, O.; HAVLENA, V.; GRÉGR, M. Flow based monitoring of ICS communication in the smart grid. Journal of Information Security and Applications, 2020, roč. 2020, č. 54, s. 102535-102535. ISSN: 2214-2126.
  Detail | WWW

  HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; VALEŠ, O.; VOJNAR, T. Antiprenexing for WSkS: A Little Goes a Long Way. In EPiC Series in Computing. Proceedings of LPAR-23. Manchester: EasyChair, 2020. s. 298-316. ISSN: 2398-7340.
  Detail | WWW

  HAVLENA, V.; LENGÁL, O.; CHEN, Y.; TURRINI, A. A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving. In Proceedings of APLAS'20. Lecture Notes in Computer Science. Heidelberg: Springer Verlag, 2020. s. 343-363. ISSN: 0302-9743.
  Detail | WWW

  ČEŠKA, M.; HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; VOJNAR, T. Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. International Journal on Software Tools for Technology Transfer, 2020, roč. 22, č. 5, s. 523-539. ISSN: 1433-2779.
  Detail | WWW

• 2019

  CHEN, Y.; HAVLENA, V.; LENGÁL, O. Simulations in Rank-Based Büchi Automata Complementation. In Proceedings of 17th Asian Symposium on Programming Languages and Systems (APLAS). Lecture Notes in Computer Science. Nusa Dua: Springer International Publishing, 2019. s. 447-467. ISSN: 0302-9743.
  Detail | WWW

  HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; VOJNAR, T. Automata Terms in a Lazy WSkS Decision Procedure. In Proceedings of 27th International Conference on Automated Deduction (CADE-27). Lecture Notes in Computer Science. Natal: Springer Verlag, 2019. s. 300-318. ISSN: 0302-9743.
  Detail | WWW

  HAVLENA, V.; ČEŠKA, M.; HOLÍK, L.; KOŘENEK, J.; LENGÁL, O.; MATOUŠEK, D.; MATOUŠEK, J.; SEMRIČ, J.; VOJNAR, T. Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata. In Proceedings - 27th IEEE International Symposium on Field-Programmable Custom Computing Machines, FCCM 2019. San Diego, CA: Institute of Electrical and Electronics Engineers, 2019. s. 109-117. ISBN: 978-1-7281-1131-5.
  Detail | WWW

  HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; VOJNAR, T. Automata Terms in a Lazy WSkS Decision Procedure (Technical Report). Ithaca: 2019. s. 1-25.
  Detail | WWW

• 2018

  ČEŠKA, M.; HAVLENA, V.; HOLÍK, L.; LENGÁL, O.; VOJNAR, T. Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. In Proceedings of TACAS'18. Lecture Notes in Computer Science. Thessaloniki: Springer Verlag, 2018. s. 155-175. ISSN: 0302-9743.
  Detail | WWW | Plný text v Digitální knihovně

• 2016

  HLINĚNÁ, D.; HAVLENA, V. Fitting Aggregation Operators. In Mathematical and Engineering Methods in Computer Science, Lecture Notes in Computer Science, Vol. 9548. Springer International Publishing, 2016. s. 42-53. ISBN: 978-3-319-29816-0.
  Detail

  HLINĚNÁ, D.; HAVLENA, V. Invariants of φ-transformations of uninorms and t- norms. In Uncertainty Modelling 2015. Bratislava: Jednota slovenských matematikov a fyzikov, 2016. s. 41-48. ISBN: 978-80-89829-03- 3.
  Detail

  HLINĚNÁ, D.; HAVLENA, V. A Note on One Less Known Class of Generated Residual Implications. In MEMICS 2016 - 11th Doctoral Workshop on Mathematical and Engineering Methods in Computer Science. Electronic Proceedings in Theoretical Computer Science, EPTCS. Brno: Masarykova univerzita, 2016. s. 13-22. ISSN: 2075-2180.
  Detail | WWW

*) Citace publikací se generují jednou za 24 hodin.