Hongfei Fu
where else to find them
what they talk about
where they keep going back
no series more than once — all 4 in the filters
on a stage with
all 11 in the filters
who talks about the same things
- Guanyan Li3 talks
- Peixin Wang5 talks
- Fei He5 talks
- Tengshun Yang3 talks
- Amir Kafshdar Goharshady10 talks
- Shenghua Feng2 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… | ||
| Structural Abstraction and Refinement for Probabilistic Programs | OOPSLA 2025 | 2025-10-16 |
Framework treats a Probabilistic Control‑Flow Automaton as an MDP whose actions drop semantics, so the structural upper bound is the MDP’s maximum reachability… | ||
| Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial Solving | PLDI 2024 | 2024-06-24 |
Derives guaranteed upper and lower bounds for normalized posteriors by reducing inference to polynomial solving over templates guided by a new fixed‑point… | ||
| Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial ... | LAFI 2024 | 2024-01-14 |
Automated method derives guaranteed upper and lower bounds on a probabilistic program’s normalized posterior by reducing NPD bounding to bounds on the… | ||
| nothing matches | ||