Yulei Sui
where else to find them
what they talk about
where they keep going back
- OOPSLA5 editions2020–2024
- PLDI Workshop Honoring Andreas Podelski2 editions2023–2024
on a stage with
all 16 in the filters
who talks about the same things
- Yuxiang Lei4 talks
- Qirun Zhang16 talks
- Jingling Xue13 talks
- Dongjie He3 talks
- Thomas Reps20 talks
- Jie Lu3 talks
| title | conference | date |
|---|---|---|
| Iterative-Epoch Online Cycle Elimination for Context-Free Language Reachability | OOPSLA 2024 | 2024-10-20 |
An iterative-epoch framework identifies grammar transitive symbols and collapses on-the-fly cycles in CFL-reachability graphs, reducing worklist blowup and… | ||
| 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… | ||
| A Container-Usage-Pattern-Based Context Debloating Approach for Object-Sensitiv... | OOPSLA 2023 | 2023-10-23 |
A new preanalysis called DebloaterX uses three container-usage patterns and a limited field sensitive DFA to mark container objects as context dependent or… | ||
| 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… | ||
| 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… | ||
| Hash Consed Points-To Sets | SAS 2021 | 2021-10-17 |
Implements hash-consed, interned points-to sets and operation tables inside the LLVM/SVF framework, changing only the data structure not the algorithm… | ||
| Compacting Points-To Sets Through Object Clustering | OOPSLA 2021 | 2021-10-17 |
Maps memory objects to integers so bit-vector points-to sets shrink; formulates an optimal mapping as an integer linear program but falls back to fast… | ||
| Flow2Vec: Value-Flow-Based Precise Code Embedding | OOPSLA 2020 | 2020-11-15 |
Builds an interprocedural value-flow graph from LLVM IR (IVFG) and uses CFL-reachability to filter only realizable call/return paths, formulates reachability… | ||
| nothing matches | ||