Ondrej Lengál

Affiliations:
  • Brno University of Technology, Czech Republic


According to our database1, Ondrej Lengál authored at least 59 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Solving String Constraints with Lengths by Stabilization.
Proc. ACM Program. Lang., October, 2023

A symbolic algorithm for the case-split rule in solving word constraints with extensions.
J. Syst. Softw., July, 2023

An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits.
Proc. ACM Program. Lang., 2023

Mata, a Fast and Simple Finite Automata Library (Technical Report).
CoRR, 2023

Z3-Noodler: An Automata-based String Solver (Technical Report).
CoRR, 2023

A Symbolic Algorithm for the Case-Split Rule in Solving Word Constraints with Extensions (Technical Report).
CoRR, 2023

An Automata-based Framework for Verification and Bug Hunting in Quantum Circuits (Technical Report).
CoRR, 2023

Modular Mix-and-Match Complementation of Büchi Automata (Technical Report).
CoRR, 2023

Modular Mix-and-Match Complementation of Büchi Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Word Equations in Synergy with Regular Constraints.
Proceedings of the Formal Methods - 25th International Symposium, 2023

AutoQ: An Automata-Based Quantum Circuit Verifier.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
Word Equations in Synergy with Regular Constraints (Technical Report).
CoRR, 2022

Complementing Büchi Automata with Ranker (Technical Report).
CoRR, 2022

Register Set Automata (Technical Report).
CoRR, 2022

Counting in Regexes Considered Harmful: Exposing ReDoS Vulnerability of Nonbacktracking Matchers.
Proceedings of the 31st USENIX Security Symposium, 2022

Sky Is Not the Limit - Tighter Rank Bounds for Elevator Automata in Büchi Automata Complementation.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2022

Complementing Büchi Automata with Ranker.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021
Automata Terms in a Lazy WSkS Decision Procedure.
J. Autom. Reason., 2021

Sky Is Not the Limit: Tighter Rank Bounds for Elevator Automata in Büchi Automata Complementation (Technical Report).
CoRR, 2021

Deciding S1S: Down the Rabbit Hole and Through the Looking Glass.
Proceedings of the Networked Systems - 9th International Conference, 2021

Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Approximate reduction of finite automata for high-speed network intrusion detection.
Int. J. Softw. Tools Technol. Transf., 2020

Regex matching with counting-set automata.
Proc. ACM Program. Lang., 2020

Reducing (to) the Ranks: Efficient Rank-based Büchi Automata Complementation (Technical Report).
CoRR, 2020

Antiprenexing for WSkS: A Little Goes a Long Way.
Proceedings of the LPAR 2020: 23rd International Conference on Logic for Programming, 2020

A Symbolic Algorithm for the Case-Split Rule in String Constraint Solving.
Proceedings of the Programming Languages and Systems - 18th Asian Symposium, 2020

2019
Succinct Determinisation of Counting Automata via Sphere Construction (Technical Report).
CoRR, 2019

Automata Terms in a Lazy WSkS Decision Procedure (Technical Report).
CoRR, 2019

Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata.
CoRR, 2019

Nested antichains for WS1S.
Acta Informatica, 2019


Deep Packet Inspection in FPGAs via Approximate Nondeterministic Automata.
Proceedings of the 27th IEEE Annual International Symposium on Field-Programmable Custom Computing Machines, 2019

Succinct Determinisation of Counting Automata via Sphere Construction.
Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

Simulations in Rank-Based Büchi Automata Complementation.
Proceedings of the Programming Languages and Systems - 17th Asian Symposium, 2019

2018
Simulation Algorithms for Symbolic Automata (Technical Report).
CoRR, 2018

Advanced automata-based algorithms for program termination checking.
Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2018

Simulation Algorithms for Symbolic Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2018

2017
Compositional entailment checking for a fragment of separation logic.
Formal Methods Syst. Des., 2017

Fair Termination for Parameterized Probabilistic Concurrent Systems (Technical Report).
CoRR, 2017

Counterexample Validation and Interpolation-Based Refinement for Forest Automata.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2017

Fair Termination for Parameterized Probabilistic Concurrent Systems.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Forester: From Heap Shapes to Automata Predicates - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

Lazy Automata Techniques for WS1S.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2017

SPEN: A Solver for Separation Logic.
Proceedings of the NASA Formal Methods - 9th International Symposium, 2017

An Executable Sequential Specification for Spark Aggregation.
Proceedings of the Networked Systems - 5th International Conference, 2017

Register automata with linear arithmetic.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Verification of heap manipulating programs with ordered data by extended forest automata.
Acta Informatica, 2016

Run Forester, Run Backwards! - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2016

PAC learning-based verification and model synthesis.
Proceedings of the 38th International Conference on Software Engineering, 2016

2015
Automaty v nekonečně stavové formální verifikaci ; Automata in Infinite-state Formal Verification.
PhD thesis, 2015

Forester: Shape Analysis Using Tree Automata - (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2015

2013
Fully Automated Shape Analysis Based on Forest Automata.
Proceedings of the Computer Aided Verification - 25th International Conference, 2013

2012
An Efficient Finite Tree Automata Library
CoRR, 2012

VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Towards Beneficial Hardware Acceleration in HAVEN: Evaluation of Testbed Architectures.
Proceedings of the Hardware and Software: Verification and Testing, 2012

2011
HAVEN: An Open Framework for FPGA-Accelerated Functional Verification of Hardware.
Proceedings of the Hardware and Software: Verification and Testing, 2011

Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata.
Proceedings of the Automated Technology for Verification and Analysis, 2011

2009
Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing.
Proceedings of the 12th Euromicro Conference on Digital System Design, 2009

2008
Network Probe for Flexible Flow Monitoring.
Proceedings of the 11th IEEE Workshop on Design & Diagnostics of Electronic Circuits & Systems (DDECS 2008), 2008


  Loading...