Ruyi Ji
where else to find them
no profile links on file
what they talk about
all 6 in the filters
where they keep going back
- OOPSLA4 editions2020–2025
- PLDI Workshop Honoring Andreas Podelski2 editions2024–2026
all 4 in the filters
on a stage with
all 17 in the filters
who talks about the same things
- Yingfei Xiong9 talks
- Zhenjiang Hu15 talks
- Xinyu Wang14 talks
- Rui Dong6 talks
- Xiaokang Qiu6 talks
- Işıl Dillig21 talks
| title | conference | date |
|---|---|---|
| Presynthesis: Towards Scaling Up Program Synthesis with Finer-Grained Abstract Semantics | PLDI 2026 | 2026-06-15 |
Proposes offline presynthesis that builds a semantics tree automaton and a reachability oracle so online synthesis reduces to fast graph reachability queries… | ||
| Accelerating Syntax-Guided Program Synthesis by Optimizing Domain-Specific Languages | POPL 2026 | 2026-01-11 |
AMaze automatically refines DSLs to cut synthesis time by estimating enumeration cost instead of running the solver, computing a feature component rank for… | ||
| Tunneling Through the Hill: Multi-Way Intersection for Version-Space Algebras in(…) | OOPSLA 2025 | 2025-10-16 |
Claims a new multi-way intersection algorithm that directly intersects many small VSAs to avoid huge intermediate structures, plus a bottom-up intersection… | ||
| Equality Saturation Guided by Large Language Models | EGRAPHS 2025 | 2025-06-16 |
Introduces LLM-guided equality saturation (LGuess): LLMs propose sparse, high‑level rewrite checkpoints while e‑graphs supply the low‑level rewrite chains; a… | ||
| Superfusion: Eliminating Intermediate Data Structures via Inductive Synthesis | PLDI 2024 | 2024-06-24 |
Superfusion uses inductive program synthesis to remove intermediate collections by synthesizing a small compression function that maps packed structures to… | ||
| Improving Oracle-Guided Inductive Synthesis by Efficient Question Selection | OOPSLA 2023 | 2023-10-23 |
Proposes LearnSy, a question selector that models complex operator behavior as simple random events and computes the expected number of program pairs that… | ||
| Generalizable Synthesis Through Unification | OOPSLA 2021 | 2021-10-17 |
Defines an Occam solver with PAC-style guarantees and proves Eusolver fails that criterion, then builds PolyGen, an Occam STUN solver that decomposes CLIA… | ||
| Guiding Dynamic Programing via Structural Probability for Accelerating Programming by Example | OOPSLA 2020 | 2020-11-15 |
MaxFlash combines dynamic programming (PROSE-style witness functions and caching) with structural probability from Euphony, using a topdown prediction model to… | ||
| nothing matches | ||