Seguir
Hongfei Fu
Hongfei Fu
Dirección de correo verificada de cs.sjtu.edu.cn - Página principal
Título
Citado por
Citado por
Año
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs
K Chatterjee, H Fu, P Novotný, R Hasheminezhad
ACM Transactions on Programming Languages and Systems (TOPLAS) 40 (2), 1-45, 2018
1352018
Termination analysis of probabilistic programs through Positivstellensatz’s
K Chatterjee, H Fu, AK Goharshady
Computer Aided Verification: 28th International Conference, CAV 2016 …, 2016
1262016
Termination of nondeterministic probabilistic programs
H Fu, K Chatterjee
Verification, Model Checking, and Abstract Interpretation: 20th …, 2019
67*2019
Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time
P Wang, H Fu, K Chatterjee, Y Deng, M Xu
Proceedings of the ACM on Programming Languages 4 (POPL), 1-30, 2019
622019
Cost analysis of nondeterministic probabilistic programs
P Wang, H Fu, AK Goharshady, K Chatterjee, X Qin, W Shi
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language …, 2019
542019
Guided diffusion model for adversarial purification
J Wang, Z Lyu, D Lin, B Dai, H Fu
arXiv preprint arXiv:2205.14969, 2022
472022
Polynomial invariant generation for non-deterministic recursive programs
K Chatterjee, H Fu, AK Goharshady, EK Goharshady
Proceedings of the 41st ACM SIGPLAN Conference on Programming Language …, 2020
422020
Non-polynomial worst-case analysis of recursive programs
K Chatterjee, H Fu, AK Goharshady
ACM Transactions on Programming Languages and Systems (TOPLAS) 41 (4), 1-52, 2019
412019
Modular verification for almost-sure termination of probabilistic programs
M Huang, H Fu, K Chatterjee, AK Goharshady
Proceedings of the ACM on Programming Languages 3 (OOPSLA), 1-29, 2019
412019
New approaches for almost-sure termination of probabilistic programs
M Huang, H Fu, K Chatterjee
Programming Languages and Systems: 16th Asian Symposium, APLAS 2018 …, 2018
302018
Automated recurrence analysis for almost-linear expected-runtime bounds
K Chatterjee, H Fu, A Murhekar
International Conference on Computer Aided Verification, 118-139, 2017
302017
Polynomial reachability witnesses via Stellensätze
A Asadi, K Chatterjee, H Fu, AK Goharshady, M Mahdavi
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming …, 2021
282021
Quantitative analysis of assertion violations in probabilistic programs
J Wang, Y Sun, H Fu, K Chatterjee, AK Goharshady
Proceedings of the 42nd ACM SIGPLAN International Conference on Programming …, 2021
272021
Computational approaches for stochastic shortest path on succinct MDPs
K Chatterjee, H Fu, AK Goharshady, N Okati
arXiv preprint arXiv:1804.08984, 2018
212018
Termination analysis of probabilistic programs with martingales
K Chatterjee, H Fu, P Novotný
Foundations of Probabilistic Programming, 221-258, 2020
172020
Maximal cost-bounded reachability probability on continuous-time Markov decision processes
H Fu
Foundations of Software Science and Computation Structures: 17th …, 2014
172014
Computing game metrics on Markov decision processes
H Fu
Automata, Languages, and Programming: 39th International Colloquium, ICALP …, 2012
17*2012
Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata
H Fu
Proceedings of the 16th international conference on Hybrid systems …, 2013
102013
Scalable linear invariant generation with Farkas’ lemma
H Liu, H Fu, Z Yu, J Song, G Li
Proceedings of the ACM on Programming Languages 6 (OOPSLA2), 204-232, 2022
82022
Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
M Huang, H Fu, JP Katoen
Information and Computation 268, 104431, 2019
8*2019
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20