Ondřej Lengál

Available identifiers

zbMath Open lengal.ondrejMaRDI QIDQ300411

List of research outcomes

Publication	Date of Publication	Type
Simulations in rank-based Büchi automata complementation	2024-04-19	Paper
Succinct determinisation of counting automata via sphere construction	2024-04-19	Paper
Sky is not the limit. Tighter rank bounds for elevator automata in Büchi automata complementation	2024-02-01	Paper
Modular mix-and-match complementation of Büchi automata	2023-12-13	Paper
Reducing (To) the Ranks: Efficient Rank-Based Büchi Automata Complementation	2023-08-21	Paper
Word equations in synergy with regular constraints	2023-08-17	Paper
Simulation algorithms for symbolic automata	2023-07-28	Paper
Complementing Büchi Automata with Ranker	2022-12-07	Paper
Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure	2021-11-24	Paper
A symbolic algorithm for the case-split rule in string constraint solving	2021-07-08	Paper
https://portal.mardi4nfdi.de/entity/Q5144658	2021-01-19	Paper
Lazy Automata Techniques for WS1S	2020-08-05	Paper
Fair Termination for Parameterized Probabilistic Concurrent Systems	2020-08-05	Paper
Dataset for the OOPSLA'20 paper "Regex Matching with Counting-Set Automata"	2020-08-03	Dataset
Automata terms in a lazy \(\mathrm{WS}k\mathrm{S}\) decision procedure	2020-03-10	Paper
Nested Antichains for WS1S	2019-09-17	Paper
Nested antichains for WS1S	2019-03-21	Paper
Compositional entailment checking for a fragment of separation logic	2018-01-08	Paper
Counterexample Validation and Interpolation-Based Refinement for Forest Automata	2017-02-21	Paper
Verification of heap manipulating programs with ordered data by extended forest automata	2016-06-28	Paper
Compositional Entailment Checking for a Fragment of Separation Logic	2016-02-26	Paper
Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata	2014-07-08	Paper
VATA: A Library for Efficient Manipulation of Non-deterministic Tree Automata	2012-06-29	Paper
Efficient Inclusion Checking on Explicit and Semi-symbolic Tree Automata	2011-10-07	Paper

Research outcomes over time

This page was built for person: Ondřej Lengál