Lukáš Holík
where else to find them
no profile links on file
what they talk about
where they keep going back
all 5 in the filters
on a stage with
all 23 in the filters
who talks about the same things
- Ondřej Lengál8 talks
- Yu-Fang Chen10 talks
- Vojtěch Havlena2 talks
- Tomáš Vojnar4 talks
- Anthony W. Lin8 talks
- Michal Hečko2 talks
| title | conference | date |
|---|---|---|
| Parameterized Verification of Quantum Circuits | POPL 2026 | 2026-01-11 |
Presents a fully automatic framework that verifies relational properties of size‑parameterized quantum programs by modeling infinite families of quantum states… | ||
| A Uniform Framework for Handling Position Constraints in String Solving | PLDI 2025 | 2025-06-16 |
Introduces a decision procedure that avoids encoding to word equations and instead reduces position constraints to integer constraints extracted from the… | ||
| An Automata-based Framework for Quantum Circuit Verification | PLanQC 2025 | 2025-01-25 |
Framework encodes sets of quantum basis trees as tree automata (BDD-like tries) and implements gate updates symbolically — X swaps left/right branches, S… | ||
| Verifying Quantum Circuits with Level-Synchronized Tree Automata | POPL 2025 | 2025-01-19 |
Introduces level-synchronized tree automata that label transitions with joint choices to synchronize different tree branches, enabling a symbolic encoding of… | ||
| Solving String Constraints with Lengths by Stabilization | OOPSLA 2023 | 2023-10-23 |
Combines a fast automata-based stabilization solver for equations+regular constraints with an align-and-split module to extract lengths, implements both in Z3… | ||
| Solving Not-Substring with Flat Abstraction | APLAS 2021 | 2021-10-17 |
Proposes a concrete CEGAR-based method using flat abstraction that encodes non-substring into linear integer (Presburger) constraints and implements it in a… | ||
| Preprocessing of Alternating Automata for Language Emptiness Testing | APLAS 2021 | 2021-10-17 |
Preprocessing implements boolean simplifications plus two novel rewrites: basic simplification (structural hashing, absorption, removal of empty-state… | ||
| Regex Matching with Counting-Set Automata | OOPSLA 2020 | 2020-11-15 |
Paper builds a counting-set automata implementation (a CA prototype in Microsoft’s automata library) that determinises regexes with counters without exploding… | ||
| nothing matches | ||