Naijun Zhan
where else to find them
no profile links on file
what they talk about
where they keep going back
no series more than once — all 2 in the filters
on a stage with
all 9 in the filters
who talks about the same things
- Shenghua Feng2 talks
- Tengshun Yang3 talks
- Mingshuai Chen4 talks
- Hongfei Fu6 talks
- Peixin Wang5 talks
- Guanyan Li3 talks
| title | conference | date |
|---|---|---|
| Piecewise Analysis of Probabilistic Programs via k-Induction | POPL 2026 | 2026-01-11 |
Proposes a method that extracts region splits from k-induction operators and combines them with the Optional Stopping Theorem to synthesize piecewise… | ||
| 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… | ||
| nothing matches | ||