default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVojtech Havlena
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c19]Peter Habermehl
, Vojtech Havlena, Michal Hecko, Lukás Holík, Ondrej Lengál:
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. CAV (1) 2024: 42-67- [c18]Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc:
Cooking String-Integer Conversions with Noodles. SAT 2024: 14:1-14:19 - [c17]Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc:
Z3-Noodler: An Automata-based String Solver. TACAS (1) 2024: 24-33 - [c16]David Chocholatý, Tomás Fiedor, Vojtech Havlena, Lukás Holík, Martin Hruska, Ondrej Lengál, Juraj Síc:
Mata: A Fast and Simple Finite Automata Library. TACAS (2) 2024: 130-151 - [i14]Peter Habermehl, Michal Hecko, Vojtech Havlena, Lukás Holík, Ondrej Lengál:
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. CoRR abs/2403.18995 (2024) - [i13]Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková:
Complementation of Emerson-Lei Automata (Technical Report). CoRR abs/2410.11644 (2024) - 2023
- [j6]Yu-Fang Chen, Vojtech Havlena, Ondrej Lengál, Andrea Turrini:
A symbolic algorithm for the case-split rule in solving word constraints with extensions. J. Syst. Softw. 201: 111673 (2023) - [j5]Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc:
Solving String Constraints with Lengths by Stabilization. Proc. ACM Program. Lang. 7(OOPSLA2): 2112-2141 (2023) - [j4]Vojtech Havlena, Petr Matousek, Ondrej Rysavý, Lukás Holík:
Accurate Automata-Based Detection of Cyber Threats in Smart Grid Communication. IEEE Trans. Smart Grid 14(3): 2352-2366 (2023) - [c15]Frantisek Blahoudek, Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc:
Word Equations in Synergy with Regular Constraints. FM 2023: 403-423 - [c14]Vojtech Havlena, Ondrej Lengál, Yong Li, Barbora Smahlíková, Andrea Turrini:
Modular Mix-and-Match Complementation of Büchi Automata. TACAS (1) 2023: 249-270 - [i12]Vojtech Havlena, Ondrej Lengál, Yong Li, Barbora Smahlíková, Andrea Turrini:
Modular Mix-and-Match Complementation of Büchi Automata (Technical Report). CoRR abs/2301.01890 (2023) - [i11]Yu-Fang Chen, Vojtech Havlena, Ondrej Lengál, Andrea Turrini:
A Symbolic Algorithm for the Case-Split Rule in Solving Word Constraints with Extensions (Technical Report). CoRR abs/2303.01142 (2023) - [i10]Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc:
Z3-Noodler: An Automata-based String Solver (Technical Report). CoRR abs/2310.08327 (2023) - [i9]David Chocholatý, Tomás Fiedor, Vojtech Havlena, Lukás Holík, Martin Hruska, Ondrej Lengál, Juraj Síc:
Mata, a Fast and Simple Finite Automata Library (Technical Report). CoRR abs/2310.10136 (2023) - 2022
- [c13]Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková:
Complementing Büchi Automata with Ranker. CAV (2) 2022: 188-201 - [c12]Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková:
Sky Is Not the Limit - Tighter Rank Bounds for Elevator Automata in Büchi Automata Complementation. TACAS (2) 2022: 118-136 - [i8]Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková:
Complementing Büchi Automata with Ranker (Technical Report). CoRR abs/2206.01946 (2022) - [i7]Frantisek Blahoudek, Yu-Fang Chen, David Chocholatý, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc:
Word Equations in Synergy with Regular Constraints (Technical Report). CoRR abs/2212.02317 (2022) - 2021
- [j3]Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Automata Terms in a Lazy WSkS Decision Procedure. J. Autom. Reason. 65(7): 971-999 (2021) - [c11]Vojtech Havlena, Ondrej Lengál:
Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation. CONCUR 2021: 2:1-2:19 - [c10]Petr Matousek, Vojtech Havlena, Lukás Holík:
Efficient Modelling of ICS Communication For Anomaly Detection Using Probabilistic Automata. IM 2021: 81-89 - [c9]Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková:
Deciding S1S: Down the Rabbit Hole and Through the Looking Glass. NETYS 2021: 215-222 - [i6]Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková:
Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in Büchi Automata Complementation (Technical Report). CoRR abs/2110.10187 (2021) - 2020
- [j2]Petr Matousek, Ondrej Rysavý, Matej Grégr, Vojtech Havlena:
Flow based monitoring of ICS communication in the smart grid. J. Inf. Secur. Appl. 54: 102535 (2020) - [j1]Milan Ceska, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Approximate reduction of finite automata for high-speed network intrusion detection. Int. J. Softw. Tools Technol. Transf. 22(5): 523-539 (2020) - [c8]Yu-Fang Chen, Vojtech Havlena, Ondrej Lengál, Andrea Turrini:
A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving. APLAS 2020: 343-363 - [c7]Vojtech Havlena, Lukás Holík, Ondrej Lengál, Ondrej Vales, Tomás Vojnar:
Antiprenexing for WSkS: A Little Goes a Long Way. LPAR 2020: 298-316 - [i5]Vojtech Havlena, Ondrej Lengál:
Reducing (to) the Ranks: Efficient Rank-based Büchi Automata Complementation (Technical Report). CoRR abs/2010.07834 (2020)
2010 – 2019
- 2019
- [c6]Yu-Fang Chen, Vojtech Havlena, Ondrej Lengál:
Simulations in Rank-Based Büchi Automata Complementation. APLAS 2019: 447-467 - [c5]Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Automata Terms in a Lazy WSkS Decision Procedure. CADE 2019: 300-318 - [c4]Milan Ceska, Vojtech Havlena, Lukás Holík, Jan Korenek, Ondrej Lengál, Denis Matousek, Jirí Matousek, Jakub Semric, Tomás Vojnar:
Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata. FCCM 2019: 109-117 - [i4]Milan Ceska, Vojtech Havlena, Lukás Holík, Jan Korenek, Ondrej Lengál, Denis Matousek, Jirí Matousek, Jakub Semric, Tomás Vojnar:
Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata. CoRR abs/1904.10786 (2019) - [i3]Yu-Fang Chen, Vojtech Havlena, Ondrej Lengál:
Simulations in Rank-Based Büchi Automata Complementation. CoRR abs/1905.07139 (2019) - [i2]Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Automata Terms in a Lazy WSkS Decision Procedure (Technical Report). CoRR abs/1905.08697 (2019) - 2018
- [c3]Milan Ceska, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. TACAS (2) 2018: 155-175 - 2017
- [i1]Milan Ceska, Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. CoRR abs/1710.08647 (2017) - 2016
- [c2]Vojtech Havlena, Dana Hlinená:
A Note on One Less Known Class of Generated Residual Implications. MEMICS 2016: 13-22 - 2015
- [c1]Vojtech Havlena, Dana Hlinená:
Fitting Aggregation Operators. MEMICS 2015: 42-53
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
