Shuo Ding
where else to find them
no profile links on file
what they talk about
where they keep going back
- OOPSLA3 editions2022–2025
all 5 in the filters
on a stage with
- Qirun Zhang6×
- Amit Goelonce
- Chungha Sungonce
all 8 in the filters
who talks about the same things
- Qirun Zhang16 talks
- Sharon Shoham13 talks
- Loris D'Antoni17 talks
- Thomas Reps20 talks
- Yingfei Xiong9 talks
- Yizhou Zhang13 talks
| title | conference | date |
|---|---|---|
| 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… | ||
| 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… | ||
| Automatically Reducing Privilege for Access Control Policies | OOPSLA 2024 | 2024-10-20 |
Tool named IAM-PolicyRefiner synthesizes tighter AWS IAM policies from three months of real access logs, removing on average 77% of allowed actions and 88% of… | ||
| 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… | ||
| 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… | ||
| nothing matches | ||