Ondrej Lengál

ORCID

Publication Activity (10 Years)

Years Active: 2008-2023
Publications (10 Years): 60

Top Venues

Brno University of Technology, Czech Republic (PHD)

Education History

Brno University of Technology, Czech Republic

PHD

Publications

Vojtech Havlena, Ondrej Lengál, Yong Li, Barbora Smahlíková, Andrea Turrini
Modular Mix-and-Match Complementation of Büchi Automata (Technical Report). CoRR (2023)
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. Proc. ACM Program. Lang. 7 (PLDI) (2023)
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 (2023)
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) (2023)
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 (2023)
Vojtech Havlena, Ondrej Lengál, Yong Li, Barbora Smahlíková, Andrea Turrini
Modular Mix-and-Match Complementation of Büchi Automata. TACAS (1) (2023)
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 (2023)
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 (2023)
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 (2023)
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)
Yu-Fang Chen, Kai-Min Chung, Ondrej Lengál, Jyun-Ao Lin, Wei-Lun Tsai
AutoQ: An Automata-Based Quantum Circuit Verifier. CAV (3) (2023)
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 (2022)
Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková
Complementing Büchi Automata with Ranker (Technical Report). CoRR (2022)
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)
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)
Sabína Gulcíková, Ondrej Lengál
Register Set Automata (Technical Report). CoRR (2022)
Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková
Complementing Büchi Automata with Ranker. CAV (2) (2022)
Vojtech Havlena, Ondrej Lengál
Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation. CONCUR (2021)
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) (2021)
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 (2021)
Vojtech Havlena, Ondrej Lengál, Barbora Smahlíková
Deciding S1S: Down the Rabbit Hole and Through the Looking Glass. NETYS (2021)
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)
Vojtech Havlena, Ondrej Lengál
Reducing (to) the Ranks: Efficient Rank-based Büchi Automata Complementation (Technical Report). CoRR (2020)
Yu-Fang Chen, Vojtech Havlena, Ondrej Lengál, Andrea Turrini
A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving. APLAS (2020)
Lenka Turonová, Lukás Holík, Ondrej Lengál, Olli Saarikivi, Margus Veanes, Tomás Vojnar
Regex matching with counting-set automata. Proc. ACM Program. Lang. 4 (OOPSLA) (2020)
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) (2020)
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 (2019)
Yu-Fang Chen, Vojtech Havlena, Ondrej Lengál
Simulations in Rank-Based Büchi Automata Complementation. APLAS (2019)
Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar
Automata Terms in a Lazy WSkS Decision Procedure (Technical Report). CoRR (2019)
Vojtech Havlena, Lukás Holík, Ondrej Lengál, Tomás Vojnar
Automata Terms in a Lazy WSkS Decision Procedure. CADE (2019)
Lukás Holík, Ondrej Lengál, Olli Saarikivi, Lenka Turonová, Margus Veanes, Tomás Vojnar
Succinct Determinisation of Counting Automata via Sphere Construction. APLAS (2019)
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 (2019)
Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar
Nested antichains for WS1S. Acta Informatica 56 (3) (2019)
Mihaela Sighireanu, Juan Antonio Navarro Pérez, Andrey Rybalchenko, Nikos Gorogiannis, Radu Iosif, Andrew Reynolds, Cristina Serban, Jens Katelaan, Christoph Matheja, Thomas Noll, Florian Zuleger, Wei-Ngan Chin, Quang Loc Le, Quang-Trung Ta, Ton-Chanh Le, Thanh-Toan Nguyen, Siau-Cheng Khoo, Michal Cyprian, Adam Rogalewicz, Tomás Vojnar, Constantin Enea, Ondrej Lengál, Chong Gao, Zhilin Wu
SL-COMP: Competition of Solvers for Separation Logic. TACAS (3) (2019)
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)
Yu-Fang Chen, Vojtech Havlena, Ondrej Lengál
Simulations in Rank-Based Büchi Automata Complementation. CoRR (2019)
Lukás Holík, Ondrej Lengál, Juraj Síc, Margus Veanes, Tomás Vojnar
Simulation Algorithms for Symbolic Automata. ATVA (2018)
Yu-Fang Chen, Matthias Heizmann, Ondrej Lengál, Yong Li, Ming-Hsien Tsai, Andrea Turrini, Lijun Zhang
Advanced automata-based algorithms for program termination checking. PLDI (2018)
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)
Lukás Holík, Ondrej Lengál, Juraj Síc, Margus Veanes, Tomás Vojnar
Simulation Algorithms for Symbolic Automata (Technical Report). CoRR (2018)
Yu-Fang Chen, Ondrej Lengál, Tony Tan, Zhilin Wu
Register automata with linear arithmetic. LICS (2017)
Constantin Enea, Ondrej Lengál, Mihaela Sighireanu, Tomás Vojnar
Compositional entailment checking for a fragment of separation logic. Formal Methods Syst. Des. 51 (3) (2017)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Tomás Vojnar
Counterexample Validation and Interpolation-Based Refinement for Forest Automata. VMCAI (2017)
Yu-Fang Chen, Ondrej Lengál, Tony Tan, Zhilin Wu
Register automata with linear arithmetic. CoRR (2017)
Ondrej Lengál, Anthony Widjaja Lin, Rupak Majumdar, Philipp Rümmer
Fair Termination for Parameterized Probabilistic Concurrent Systems. TACAS (1) (2017)
Constantin Enea, Ondrej Lengál, Mihaela Sighireanu, Tomás Vojnar
SPEN: A Solver for Separation Logic. NFM (2017)
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 (2017)
Tomás Fiedor, Lukás Holík, Petr Janku, Ondrej Lengál, Tomás Vojnar
Lazy Automata Techniques for WS1S. CoRR (2017)
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 (2017)
Ondrej Lengál, Anthony W. Lin, Rupak Majumdar, Philipp Rümmer
Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report). CoRR (2017)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Forester: From Heap Shapes to Automata Predicates - (Competition Contribution). TACAS (2) (2017)
Tomás Fiedor, Lukás Holík, Petr Janku, Ondrej Lengál, Tomás Vojnar
Lazy Automata Techniques for WS1S. TACAS (1) (2017)
Yu-Fang Chen, Chih-Duo Hong, Ondrej Lengál, Shin-Cheng Mu, Nishant Sinha, Bow-Yaw Wang
An Executable Sequential Specification for Spark Aggregation. NETYS (2017)
Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar
Verification of heap manipulating programs with ordered data by extended forest automata. Acta Informatica 53 (4) (2016)
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. ICSE (2016)
Lukás Holík, Martin Hruska, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Run Forester, Run Backwards! - (Competition Contribution). TACAS (2016)
Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar
Nested Antichains for WS1S. TACAS (2015)
Tomás Fiedor, Lukás Holík, Ondrej Lengál, Tomás Vojnar
Nested Antichains for WS1S. CoRR (2015)
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)
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 (2015)
Constantin Enea, Ondrej Lengál, Mihaela Sighireanu, Tomás Vojnar
Compositional Entailment Checking for a Fragment of Separation Logic. APLAS (2014)
Parosh Aziz Abdulla, Lukás Holík, Bengt Jonsson, Ondrej Lengál, Cong Quy Trinh, Tomás Vojnar
Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata. ATVA (2013)
Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Fully Automated Shape Analysis Based on Forest Automata CoRR (2013)
Lukás Holík, Ondrej Lengál, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Fully Automated Shape Analysis Based on Forest Automata. CAV (2013)
Ondrej Lengál
An Efficient Finite Tree Automata Library CoRR (2012)
Marcela Simková, Ondrej Lengál
Towards Beneficial Hardware Acceleration in HAVEN: Evaluation of Testbed Architectures. Haifa Verification Conference (2012)
Ondrej Lengál, Jirí Simácek, Tomás Vojnar
VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata. TACAS (2012)
Marcela Simková, Ondrej Lengál, Michal Kajan
HAVEN: An Open Framework for FPGA-Accelerated Functional Verification of Hardware. Haifa Verification Conference (2011)
Lukás Holík, Ondrej Lengál, Jirí Simácek, Tomás Vojnar
Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata. ATVA (2011)
Jan Kastil, Jan Korenek, Ondrej Lengál
Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing. DSD (2009)
Martin Zádník, Jan Korenek, Petr Kobierský, Ondrej Lengál
Network Probe for Flexible Flow Monitoring. DDECS (2008)

Ondrej Lengál.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ondrej Lengál