Yu-Fang Chen
where else to find them
no profile links on file
what they talk about
all 4 in the filters
where they keep going back
- PLanQC2 editions2025–2026
- POPL2 editions2025–2026
- PLDI Workshop Honoring Andreas Podelski2 editions2023–2025
all 6 in the filters
on a stage with
all 21 in the filters
who talks about the same things
- Ondřej Lengál8 talks
- Lukáš Holík9 talks
- Michal Hečko2 talks
- Vojtěch Havlena2 talks
- Jyun-Ao Lin5 talks
- Wei-Lun Tsai6 talks
| title | conference | date |
|---|---|---|
| Verifying Repeat-Until-Success Circuits with AutoQ | PLanQC 2026 | 2026-01-12 |
A new characterization theorem pins exactly which two‑qubit Repeat‑Until‑Success (RUS) circuits implement single‑qubit unitaries, and AutoQ is extended into an… | ||
| 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… | ||
| Automating Quantum Hoare Logic with Automata (Work-In-Progress) | WQS 2025 | 2025-06-16 |
Framework automates applied Quantum Hoare Logic by encoding projector assertions as sets of eigenvectors and eigenvalues using level-synchronized tree… | ||
| 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… | ||
| An Automata-Based Framework for Verification and Bug Hunting in Quantum Circuits | PLDI 2023 | 2023-06-17 |
Introduces an automata-based verification engine that encodes sets of quantum states as tree automata and implements gate semantics as automata transformers… | ||
| 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… | ||
| PyCT: A Python Concolic Tester | APLAS 2021 | 2021-10-17 |
PyCT is a Python concolic tester that implements many more integer, string and range type member functions, adds automatic handling for exceptions (inserting a… | ||
| nothing matches | ||