Di Wang
where else to find them
no profile links on file
what they talk about
all 9 in the filters
where they keep going back
- OOPSLA2 editions2024–2025
all 8 in the filters
on a stage with
all 29 in the filters
who talks about the same things
- Jan Hoffmann9 talks
- Yizhou Zhang13 talks
- Nadia Polikarpova24 talks
- Deepak Garg18 talks
- Tiark Rompf24 talks
- Joost-Pieter Katoen14 talks
| title | conference | date |
|---|---|---|
| Denotation-based Compositional Compiler Verification | PLDI 2026 | 2026-06-15 |
Proposes a denotational framework that represents each statement by three behavior sets (normal, error, divergence) enriched with traces and distinguishes… | ||
| Inferring Typing Rules for Contextual Sugars | PEPM 2026 | 2026-01-11 |
Algorithm infers typing rules for a class of contextual sugars by fusing sugaring rules with core-language typing and by performing early typing of templates… | ||
| Automatic Linear Resource Bound Analysis for Rust via Prophecy Potentials | OOPSLA 2025 | 2025-10-16 |
Claims an automatic, type-based AARA for Rust that infers symbolic linear cost bounds and proves soundness via a new Resource-Aware Borrow Calculus (RABC)… | ||
| Composable Effect Handling for Programming LLM-integrated Scripts | LMPL 2025 | 2025-10-12 |
Claim: treating LLM calls, I/O and concurrency as abstract operations discharged by handlers separates workflow from effects and yields real gains. Prototype… | ||
| Towards Lifecycle Unlearning Commitment Management: Measuring Sample-level... | USENIX Security '25 | 2025-08-13 |
Proposes Interpolated Approximate Measurement (IAM), a sample-level unlearning metric that interpolates model outputs via a bounded logit map and fits those… | ||
| Programmable MCMC with Soundly Composed Guide Programs | OOPSLA 2024 | 2024-10-20 |
Implements a coroutine-based framework and a type system that encodes the message protocol between a model program and a sequence of block-wise guide programs… | ||
| Newtonian Program Analysis of Probabilistic Programs | OOPSLA 2024 | 2024-10-20 |
Presents NPA-PMA, an interprocedural framework that generalizes Newtonian Program Analysis to probabilistic, nondeterministic, and conditional branching by… | ||
| Semantics Lifting for Syntactic Sugar | OOPSLA 2024 | 2024-10-20 |
Presents an algorithm that derives host-independent evaluation rules from host semantics and desugaring rules and implements it as Osazone, a tool that lifts… | ||
| Probabilistic Resource-Aware Session Types | POPL 2023 | 2023-01-15 |
Extends binary session types to describe message probability distributions and to infer expected-resource bounds automatically, using a type reconstruction… | ||
| Geno: A Developer Tool for Authoring Multimodal Interaction on Existing Web Applications | UIST 2020 | 2020-10-20 |
Geno is a JavaScript/Electron IDE that trains a Rasa-backed language model and uses the WebSpeech API to add voice commands to existing web apps by mapping… | ||
| Liquid Resource Types | ICFP 2020 | 2020-08-23 |
Liquid Resource Types claims an automated refinement-type system that proves precise, value-dependent resource bounds (polynomial, exponential and fine-grained… | ||
| Raising Expectations: Automating Expected Cost Analysis with Types | ICFP 2020 | 2020-08-23 |
A type-based tool called PRaML automatically infers upper bounds on expected execution cost for probabilistic OCaml-like programs by extending RaML’s AARA… | ||
| nothing matches | ||