Collaborated with:
K.Chatterjee A.K.Goharshady Peixin Wang A.Murhekar M.Huang Petr Novotný 0001 Rouzbeh Hasheminezhad Y.Deng Ming Xu Xudong Qin Wenjun Shi
Talks about:
program (6) probabilist (5) analysi (5) termin (4) expect (2) almost (2) positivstellensatz (1) nondeterminist (1) algorithm (1) polynomi (1)
Person: Hongfei Fu 0001
DBLP: 0001:Hongfei_Fu
Contributed to:
Wrote 7 papers:
- CAV-2016-ChatterjeeFG #analysis #probability #source code #termination
- Termination Analysis of Probabilistic Programs Through Positivstellensatz's (KC, HF0, AKG), pp. 3–22.
- CAV-2017-ChatterjeeFM #analysis #automation #bound
- Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds (KC, HF0, AM), pp. 118–139.
- CAV-2017-ChatterjeeFG #analysis #recursion #source code #worst-case
- Non-polynomial Worst-Case Analysis of Recursive Programs (KC, HF0, AKG), pp. 41–63.
- OOPSLA-2019-Huang0CG #composition #probability #source code #termination #verification
- Modular verification for almost-sure termination of probabilistic programs (MH, HF0, KC, AKG), p. 29.
- POPL-2016-ChatterjeeFNH #algorithm #analysis #probability #problem #source code #termination
- Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs (KC, HF0, PN0, RH), pp. 327–342.
- PLDI-2019-Wang0GCQS #cost analysis #nondeterminism #probability #source code
- Cost analysis of nondeterministic probabilistic programs (PW, HF0, AKG, KC, XQ, WS), pp. 204–220.
- POPL-2020-WangFCDX #probability #proving #random #source code #termination
- Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time (PW, HF0, KC, YD, MX), p. 30.