Mingshuai Chen
where else to find them
linkedin:mingshuai-chen-481838aa
what they talk about
where they keep going back
- OOPSLA2 editions2023–2024
on a stage with
all 16 in the filters
who talks about the same things
- Shenghua Feng2 talks
- Naijun Zhan2 talks
- Joost-Pieter Katoen14 talks
- Guanyan Li3 talks
- Peixin Wang5 talks
- Hongfei Fu6 talks
| title | conference | date |
|---|---|---|
| Preguss: It Analyzes, It Specifies, It Verifies | LMPL 2025 | 2025-10-12 |
Preguss decomposes large verification tasks into small VUnits that contain only a guard assertion and minimal context, uses static analysis (RTE alarms) to… | ||
| Exact Bayesian Inference for Loopy Probabilistic Programs Using Generating Functions | OOPSLA 2024 | 2024-10-20 |
Claims exact Bayesian posteriors for probabilistic programs with unbounded loops and conditioning by giving a denotational semantics based on extended… | ||
| Lower Bounds for Possibly Divergent Probabilistic Programs | OOPSLA 2023 | 2023-10-23 |
A proof rule called guard strengthening gives sound lower bounds for weakest preexpectations of possibly divergent probabilistic loops by replacing loop guards… | ||
| Exact Probabilistic Inference Using Generating Functions | LAFI 2023 | 2023-01-15 |
Generative-function semantics represent discrete program distributions as formal power series and use multiplicative inverses to get closed-form fractions… | ||
| nothing matches | ||