Hongfei Fu
Title
Cited by
Cited by
Year
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
882018
Termination analysis of probabilistic programs through Positivstellensatz’s
K Chatterjee, H Fu, AK Goharshady
International Conference on Computer Aided Verification, 3-22, 2016
702016
Termination of nondeterministic probabilistic programs
H Fu, K Chatterjee
International Conference on Verification, Model Checking, and Abstract …, 2019
33*2019
Automated recurrence analysis for almost-linear expected-runtime bounds
K Chatterjee, H Fu, A Murhekar
International Conference on Computer Aided Verification, 118-139, 2017
212017
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
192019
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
182019
Maximal cost-bounded reachability probability on continuous-time Markov decision processes
H Fu
International Conference on Foundations of Software Science and Computation …, 2014
162014
Computing game metrics on Markov decision processes
H Fu
International Colloquium on Automata, Languages, and Programming, 227-238, 2012
15*2012
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
122019
New approaches for almost-sure termination of probabilistic programs
M Huang, H Fu, K Chatterjee
Asian Symposium on Programming Languages and Systems, 181-201, 2018
122018
Computational approaches for stochastic shortest path on succinct MDPs
K Chatterjee, H Fu, AK Goharshady, N Okati
arXiv preprint arXiv:1804.08984, 2018
112018
Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata
H Fu
Proceedings of the 16th international conference on Hybrid systems …, 2013
92013
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
72020
Verifying probabilistic systems: new algorithms and complexity results
H Fu
Hochschulbibliothek der Rheinisch-Westfälischen Technischen Hochschule Aachen, 2014
72014
Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems
M Huang, H Fu, JP Katoen
Information and Computation 268, 104431, 2019
5*2019
Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time
P Wang, H Fu, K Chatterjee, Y Deng, M Xu
arXiv preprint arXiv:1902.04744, 2019
22019
Decidability of behavioral equivalences in process calculi with name scoping
C He, Y Fu, H Fu
Fundamentals of Software Engineering, 284-298, 2012
22012
Model checking EGF on basic parallel processes
H Fu
International Symposium on Automated Technology for Verification and …, 2011
22011
Inductive Reachability Witnesses
A Asadi, K Chatterjee, H Fu, AK Goharshady, M Mahdavi
arXiv preprint arXiv:2007.14259, 2020
12020
Polynomial Reachability Witnesses via Stellensätze
A Asadi, K Chatterjee, H Fu, A Goharshady, M Mahdavi
42nd ACM Conference on Programming Language Design and Implementation, PLDI 2021, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–20