Qirun Zhang
where else to find them
no profile links on file
what they talk about
where they keep going back
- PLDI Workshop Honoring Andreas Podelski3 editions2023–2025
- POPL3 editions2021–2023
- OOPSLA2 editions2022–2025
all 8 in the filters
on a stage with
all 13 in the filters
who talks about the same things
- Yuanbo Li3 talks
- Yulei Sui8 talks
- Shuo Ding7 talks
- Thomas Reps20 talks
- Yuxiang Lei4 talks
- Guannan Wei21 talks
| title | conference | date |
|---|---|---|
| Compiler-assisted Translation Validation | SOAP 2026 | 2026-06-16 |
LLVM is instrumented to emit translation records (per-instruction actions and instruction manipulation events) and a validator uses those traces plus static… | ||
| Fast Constraint Synthesis for C++ Function Templates | OOPSLA 2025 | 2025-10-16 |
A Clang frontend implements a lightweight interprocedural static analysis that encodes uses in a function body as constraints, composes them with conjunctions… | ||
| From Within: Compiler Testing and Validation via Compilers | SAS 2025 | 2025-10-13 |
Claims a compiler-centric workflow that instruments LLVM APIs to record instruction manipulations and debug-location updates, then compares those traces to a… | ||
| Robustifying Debug Information Updates in LLVM via Control-Flow Conformance Analysis | PLDI 2025 | 2025-06-16 |
Tool MetaLoc instruments LLVM optimization passes, uses control-flow conformance analysis to infer correct debug-location updates, and emits patch skeletons… | ||
| The Normalization Barrier Revisited | JENSFEST 2024 | 2024-10-22 |
Revisits Brown and Palsberg’s POPL 2016 result and shows that if the interpreter embeds type checking and accepts untyped representations (Church numerals… | ||
| Retrieving Unknown SMT Formulas via Structural Mutations | VIVEKFEST 2024 | 2024-10-21 |
Claim: unknown SMT formulas often become decidable by simple syntactic edits and running the same solver on those variants in parallel. Method mutates formulas… | ||
| Context-Free Language Reachability via Skewed Tabulation | PLDI 2024 | 2024-06-24 |
Proposes skewed tabulation that rewrites grammars and treats certain summary edges as propagating edges so the solver avoids generating intermediary summary… | ||
| Loop Saturation for Scalable High-Level Synthesis | EGRAPHS 2024 | 2024-06-24 |
Prototype Python tooling uses egg based equality saturation to perform loop saturation via array injection, IR detection, loop rerolling and code extraction on… | ||
| SMT Theory Arbitrage: Approximating Unbounded Constraints using Bounded Theories | PLDI 2024 | 2024-06-24 |
Transforms expensive unbounded integer and real constraints into bounded bitvector/fp versions by inferring per-constraint widths via abstract interpretation… | ||
| Mutual Refinements of Context-Free Language Reachability | SAS 2023 | 2023-10-22 |
Proposes a modified CFL-reachability algorithm that traces contributing edges per grammar and iteratively removes noncontributing edges across multiple CFL… | ||
| Recursive State Machine Guided Graph Folding for Context-Free Language Reachability | PLDI 2023 | 2023-06-17 |
An algorithm called graph folding GF identifies adjacent node pairs that are provably removable for CFL‑reachability by examining only their incoming and… | ||
| Single-Source-Single-Target Interleaved-Dyck Reachability via Integer Linear Pro... | POPL 2023 | 2023-01-15 |
Presents a single-source–single-target algorithm that summarizes all source→target paths as path expressions and reduces InterDyck reachability to a… | ||
| Witnessability of Undecidable Problems | POPL 2023 | 2023-01-15 |
Claim: for a wide class of undecidable problems there is a computable transformation that, given the code of any decidable approximation, outputs a concrete… | ||
| Taming Transitive Redundancy for Context-Free Language Reachability | OOPSLA 2022 | 2022-12-05 |
CFL-reachability uses on-the-fly edge derivation; this work introduces POCR running on a hybrid spanning-tree + adjacency-list representation to enforce a… | ||
| Efficient Algorithms for Dynamic Bidirected Dyck-Reachability | POPL 2022 | 2022-01-16 |
Presents a dynamic algorithm that maintains all-pairs bidirected Dyck-reachability with O(n α(n)) update time per edge and O(1) queries, using a merged-graph… | ||
| On the Complexity of Bidirected Interleaved Dyck-Reachability | POPL 2021 | 2021-01-17 |
Shows that bidirected InterDyck reachability is decidable for D1 ⊙ D1 and gives a concrete polynomial-time algorithm that computes all pairs reachable by… | ||
| nothing matches | ||