default search action
Ondrej Lengál
Person information
- affiliation: Brno University of Technology, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c42]Peter Habermehl
, Vojtech Havlena
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. CAV (1) 2024: 42-67 - [c41]Vojtech Havlena, Lukás Holík, Ondrej Lengál, Juraj Síc:
Cooking String-Integer Conversions with Noodles. SAT 2024: 14:1-14:19 - [c40]Yu-Fang Chen
Z3-Noodler: An Automata-based String Solver. TACAS (1) 2024: 24-33 - [c39]David Chocholatý
Mata: A Fast and Simple Finite Automata Library. TACAS (2) 2024: 130-151 - [i27]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) - [i26]Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková:
Complementation of Emerson-Lei Automata (Technical Report). CoRR abs/2410.11644 (2024) - [i25]Parosh Aziz Abdulla, Yo-Ga Chen, Yu-Fang Chen, Lukás Holík, Ondrej Lengál, Jyun-Ao Lin, Fang-Yi Lo, Wei-Lun Tsai:
Verifying Quantum Circuits with Level-Synchronized Tree Automata (Technical Report). CoRR abs/2410.18540 (2024) - 2023
- [j9]Yu-Fang Chen
A symbolic algorithm for the case-split rule in solving word constraints with extensions. J. Syst. Softw. 201: 111673 (2023) - [j8]Yu-Fang Chen
Solving String Constraints with Lengths by Stabilization. Proc. ACM Program. Lang. 7(OOPSLA2): 2112-2141 (2023) - [j7]Yu-Fang Chen
An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits. Proc. ACM Program. Lang. 7(PLDI): 1218-1243 (2023) - [c38]Yu-Fang Chen
AutoQ: An Automata-Based Quantum Circuit Verifier. CAV (3) 2023: 139-153 - [c37]Frantisek Blahoudek, Yu-Fang Chen, David Chocholatý
Word Equations in Synergy with Regular Constraints. FM 2023: 403-423 - [c36]Vojtech Havlena
Modular Mix-and-Match Complementation of Büchi Automata. TACAS (1) 2023: 249-270 - [i24]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) - [i23]Yu-Fang Chen, Kai-Min Chung, Ondrej Lengál, Jyun-Ao Lin, Wei-Lun Tsai, Di-De Yen:
An Automata-based Framework for Verification and Bug Hunting in Quantum Circuits (Technical Report). CoRR abs/2301.07747 (2023) - [i22]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) - [i21]Yu-Fang Chen, David Chocholatý
Z3-Noodler: An Automata-based String Solver (Technical Report). CoRR abs/2310.08327 (2023) - [i20]David Chocholatý
Mata, a Fast and Simple Finite Automata Library (Technical Report). CoRR abs/2310.10136 (2023) - 2022
- [c35]Vojtech Havlena
Complementing Büchi Automata with Ranker. CAV (2) 2022: 188-201 - [c34]Vojtech Havlena
Sky Is Not the Limit - Tighter Rank Bounds for Elevator Automata in Büchi Automata Complementation. TACAS (2) 2022: 118-136 - [c33]Lenka Turonová, Lukás Holík, Ivan Homoliak, Ondrej Lengál, Margus Veanes, Tomás Vojnar:
Counting in Regexes Considered Harmful: Exposing ReDoS Vulnerability of Nonbacktracking Matchers. USENIX Security Symposium 2022: 4165-4182 - [i19]Sabína Gulcíková, Ondrej Lengál:
Register Set Automata (Technical Report). CoRR abs/2205.12114 (2022) - [i18]Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková:
Complementing Büchi Automata with Ranker (Technical Report). CoRR abs/2206.01946 (2022) - [i17]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
- [j6]Vojtech Havlena
Automata Terms in a Lazy WSkS Decision Procedure. J. Autom. Reason. 65(7): 971-999 (2021) - [c32]Vojtech Havlena, Ondrej Lengál:
Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation. CONCUR 2021: 2:1-2:19 - [c31]Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková:
Deciding S1S: Down the Rabbit Hole and Through the Looking Glass. NETYS 2021: 215-222 - [i16]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
- [j5]Lenka Turonová, Lukás Holík
Regex matching with counting-set automata. Proc. ACM Program. Lang. 4(OOPSLA): 218:1-218:30 (2020) - [j4]Milan Ceska
Approximate reduction of finite automata for high-speed network intrusion detection. Int. J. Softw. Tools Technol. Transf. 22(5): 523-539 (2020) - [c30]Yu-Fang Chen, Vojtech Havlena, Ondrej Lengál
A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving. APLAS 2020: 343-363 - [c29]Vojtech Havlena, Lukás Holík, Ondrej Lengál
Antiprenexing for WSkS: A Little Goes a Long Way. LPAR 2020: 298-316 - [d4]Lukás Holík
Dataset for the OOPSLA'20 paper "Regex Matching with Counting-Set Automata". Version 1. Zenodo, 2020 [all versions] - [d3]Lukás Holík
Dataset for the OOPSLA'20 paper "Regex Matching with Counting-Set Automata". Version 2. Zenodo, 2020 [all versions] - [d2]Lukás Holík
Artifact for the OOPSLA'20 paper "Regex Matching with Counting-Set Automata". Zenodo, 2020 - [i15]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
- [j3]Tomás Fiedor, Lukás Holík
Nested antichains for WS1S. Acta Informatica 56(3): 205-228 (2019) - [c28]Yu-Fang Chen, Vojtech Havlena, Ondrej Lengál
Simulations in Rank-Based Büchi Automata Complementation. APLAS 2019: 447-467 - [c27]Lukás Holík
Succinct Determinisation of Counting Automata via Sphere Construction. APLAS 2019: 468-489 - [c26]Vojtech Havlena, Lukás Holík
Automata Terms in a Lazy WSkS Decision Procedure. CADE 2019: 300-318 - [c25]Milan Ceska
Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata. FCCM 2019: 109-117 - [c24]Mihaela Sighireanu, Juan Antonio Navarro Pérez, Andrey Rybalchenko, Nikos Gorogiannis, Radu Iosif, Andrew Reynolds, Cristina Serban, Jens Katelaan
SL-COMP: Competition of Solvers for Separation Logic. TACAS (3) 2019: 116-132 - [d1]Ondrej Lengál
Forester Virtual Machine. Zenodo, 2019 - [i14]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) - [i13]Yu-Fang Chen, Vojtech Havlena, Ondrej Lengál:
Simulations in Rank-Based Büchi Automata Complementation. CoRR abs/1905.07139 (2019) - [i12]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) - [i11]Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar:
Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report). CoRR abs/1910.01996 (2019) - 2018
- [c23]Lukás Holík
Simulation Algorithms for Symbolic Automata. ATVA 2018: 109-125 - [c22]Yu-Fang Chen
Advanced automata-based algorithms for program termination checking. PLDI 2018: 135-150 - [c21]Milan Ceska
Approximate Reduction of Finite Automata for High-Speed Network Intrusion Detection. TACAS (2) 2018: 155-175 - [i10]Lukás Holík, Ondrej Lengál, Juraj Síc, Margus Veanes, Tomás Vojnar:
Simulation Algorithms for Symbolic Automata (Technical Report). CoRR abs/1807.08487 (2018) - 2017
- [j2]Constantin Enea, Ondrej Lengál
Compositional entailment checking for a fragment of separation logic. Formal Methods Syst. Des. 51(3): 575-607 (2017) - [c20]Yu-Fang Chen
Register automata with linear arithmetic. LICS 2017: 1-12 - [c19]Yu-Fang Chen, Chih-Duo Hong
An Executable Sequential Specification for Spark Aggregation. NETYS 2017: 421-438 - [c18]Constantin Enea, Ondrej Lengál
SPEN: A Solver for Separation Logic. NFM 2017: 302-309 - [c17]Lukás Holík
Forester: From Heap Shapes to Automata Predicates - (Competition Contribution). TACAS (2) 2017: 365-369 - [c16]Tomás Fiedor, Lukás Holík
Lazy Automata Techniques for WS1S. TACAS (1) 2017: 407-425 - [c15]Ondrej Lengál
Fair Termination for Parameterized Probabilistic Concurrent Systems. TACAS (1) 2017: 499-517 - [c14]Lukás Holík
Counterexample Validation and Interpolation-Based Refinement for Forest Automata. VMCAI 2017: 288-309 - [i9]Tomás Fiedor, Lukás Holík, Petr Janku, Ondrej Lengál, Tomás Vojnar:
Lazy Automata Techniques for WS1S. CoRR abs/1701.06282 (2017) - [i8]Yu-Fang Chen, Chih-Duo Hong, Ondrej Lengál, Shin-Cheng Mu, Nishant Sinha, Bow-Yaw Wang:
An Executable Sequential Specification for Spark Aggregation. CoRR abs/1702.02439 (2017) - [i7]Yu-Fang Chen, Ondrej Lengál, Tony Tan, Zhilin Wu:
Register automata with linear arithmetic. CoRR abs/1704.03972 (2017) - [i6]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) - [i5]Ondrej Lengál, Anthony W. Lin, Rupak Majumdar, Philipp Rümmer:
Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report). CoRR abs/1710.10756 (2017) - 2016
- [j1]Parosh Aziz Abdulla, Lukás Holík
Verification of heap manipulating programs with ordered data by extended forest automata. Acta Informatica 53(4): 357-385 (2016) - [c13]Yu-Fang Chen
PAC learning-based verification and model synthesis. ICSE 2016: 714-724 - [c12]Lukás Holík
Run Forester, Run Backwards! - (Competition Contribution). TACAS 2016: 923-926 - 2015
- [b1]Ondrej Lengál:
Automaty v nekonečně stavové formální verifikaci ; Automata in Infinite-state Formal Verification. Brno University of Technology, Czech Republic, 2015 - [c11]Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Forester: Shape Analysis Using Tree Automata - (Competition Contribution). TACAS 2015: 432-435 - [c10]Tomás Fiedor, Lukás Holík
Nested Antichains for WS1S. TACAS 2015: 658-674 - [i4]Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar:
Nested Antichains for WS1S. CoRR abs/1501.03849 (2015) - [i3]Yu-Fang Chen, Chiao Hsieh, Ondrej Lengál, Tsung-Ju Lii, Ming-Hsien Tsai, Bow-Yaw Wang, Farn Wang:
PAC Learning-Based Verification and Model Synthesis. CoRR abs/1511.00754 (2015) - 2014
- [c9]Constantin Enea, Ondrej Lengál, Mihaela Sighireanu, Tomás Vojnar:
Compositional Entailment Checking for a Fragment of Separation Logic. APLAS 2014: 314-333 - 2013
- [c8]Parosh Aziz Abdulla, Lukás Holík
Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. ATVA 2013: 224-239 - [c7]Lukás Holík
Fully Automated Shape Analysis Based on Forest Automata. CAV 2013: 740-755 - [i2]Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar:
Fully Automated Shape Analysis Based on Forest Automata. CoRR abs/1304.5806 (2013) - 2012
- [c6]Marcela Simková, Ondrej Lengál
Towards Beneficial Hardware Acceleration in HAVEN: Evaluation of Testbed Architectures. Haifa Verification Conference 2012: 266-273 - [c5]Ondrej Lengál
VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata. TACAS 2012: 79-94 - [i1]Ondrej Lengál:
An Efficient Finite Tree Automata Library. CoRR abs/1204.3240 (2012) - 2011
- [c4]Lukás Holík
Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata. ATVA 2011: 243-258 - [c3]Marcela Simková, Ondrej Lengál
HAVEN: An Open Framework for FPGA-Accelerated Functional Verification of Hardware. Haifa Verification Conference 2011: 247-253
2000 – 2009
- 2009
- [c2]Jan Kastil
Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing. DSD 2009: 823-829 - 2008
- [c1]Martin Zádník, Jan Korenek, Petr Kobierský, Ondrej Lengál
Network Probe for Flexible Flow Monitoring. DDECS 2008: 213-218
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 2024-12-13 19:12 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: