Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHongfei Fu 0001
Person information
- unicode name: 符鸿飞
- affiliation: Shanghai Jiao Tong University, John Hopcroft Center for Computer Science, China
- affiliation (former): IST Austria, Klosterneuburg, Austria
- affiliation (former): Chinese Academy of Sciences, Institute of Software, Beijing, China
- affiliation (PhD 2014): RWTH Aachen University, Germany
Other persons with the same name
- Hongfei Fu 0002
![[0000-0002-8294-8086]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-8294-8086")
— China University of Petroleum , College of Science, Qingdao, China (and 1 more) - Hongfei Fu 0003 — Northwest A&F University, College of Food Science and Engineering / Sino-US Joint Research Center for Food Safety, Yangling, China
- Hongfei Fu 0004 — Ocean University of China, Qingdao, Shandong, China
- Hongfei Fu 0005 — Beijing Jiaotong University, School of Mechanical, Electronic and Control Engineering, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i23]Jiaxin Song, Hongfei Fu, Charles Zhang:
Equational Bit-Vector Solving via Strong Gröbner Bases. CoRR abs/2402.16314 (2024)- [i22]Tengshun Yang, Hongfei Fu, Jingyu Ke, Naijun Zhan, Shiyang Wu:
Piecewise Linear Expectation Analysis via k-Induction for Probabilistic Programs. CoRR abs/2403.17567 (2024) - 2023
- [c23]Yican Sun, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Automated Tail Bound Analysis for Probabilistic Recurrence Relations. CAV (3) 2023: 16-39 - [c22]Peisen Yao, Jingyu Ke, Jiahui Sun, Hongfei Fu, Rongxin Wu, Kui Ren:
Demystifying Template-Based Invariant Generation for Bit-Vector Programs. ASE 2023: 673-685 - [i21]Yican Sun, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Automated Tail Bound Analysis for Probabilistic Recurrence Relations. CoRR abs/2305.15104 (2023) - [i20]Peixin Wang, Hongfei Fu, Tengshun Yang, Guanyan Li, Luke Ong:
Template-Based Static Posterior Inference for Bayesian Probabilistic Programming. CoRR abs/2307.13160 (2023) - [i19]Hongming Liu, Jingyu Ke, Hongfei Fu, Liqian Chen, Guoqiang Li:
Affine Disjunctive Invariant Generation with Farkas' Lemma. CoRR abs/2307.13318 (2023) - 2022
- [j6]Hongming Liu, Hongfei Fu, Zhiyong Yu, Jiaxin Song, Guoqiang Li:
Scalable linear invariant generation with Farkas' lemma. Proc. ACM Program. Lang. 6(OOPSLA2): 204-232 (2022) - [c21]Yucheng Ji, Hongfei Fu, Bin Fang, Haibo Chen:
Affine Loop Invariant Generation via Matrix Algebra. CAV (1) 2022: 257-281 - [c20]Minyu Chen, Guoqiang Li, Chen Ma, Jingyang Li, Hongfei Fu:
Repo4QA: Answering Coding Questions via Dense Retrieval on GitHub Repositories. COLING 2022: 1580-1592 - [i18]Jinyi Wang, Zhaoyang Lyu, Dahua Lin, Bo Dai, Hongfei Fu:
Guided Diffusion Model for Adversarial Purification. CoRR abs/2205.14969 (2022) - 2021
- [c19]Ali Asadi, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Mohammad Mahdavi:
Polynomial reachability witnesses via Stellensätze. PLDI 2021: 772-787 - [c18]Jinyi Wang, Yican Sun, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Quantitative analysis of assertion violations in probabilistic programs. PLDI 2021: 1171-1186 - 2020
- [j5]Peixin Wang, Hongfei Fu, Krishnendu Chatterjee, Yuxin Deng, Ming Xu:
Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time. Proc. ACM Program. Lang. 4(POPL): 25:1-25:30 (2020) - [c17]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady:
Polynomial invariant generation for non-deterministic recursive programs. PLDI 2020: 672-687 - [i17]Ali Asadi, Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Mohammad Mahdavi:
Inductive Reachability Witnesses. CoRR abs/2007.14259 (2020) - [i16]Jinyi Wang, Yican Sun, Hongfei Fu, Mingzhang Huang, Amir Kafshdar Goharshady, Krishnendu Chatterjee:
Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations. CoRR abs/2008.00425 (2020) - [i15]Jinyi Wang, Yican Sun, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee:
Quantitative Analysis of Assertion Violations in Probabilistic Programs. CoRR abs/2011.14617 (2020)
2010 – 2019
- 2019
- [j4]Mingzhang Huang, Hongfei Fu, Joost-Pieter Katoen:
Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems. Inf. Comput. 268 (2019) - [j3]Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Modular verification for almost-sure termination of probabilistic programs. Proc. ACM Program. Lang. 3(OOPSLA): 129:1-129:29 (2019) - [j2]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Non-polynomial Worst-Case Analysis of Recursive Programs. ACM Trans. Program. Lang. Syst. 41(4): 20:1-20:52 (2019) - [c16]Peixin Wang, Hongfei Fu, Amir Kafshdar Goharshady, Krishnendu Chatterjee, Xudong Qin, Wenjun Shi:
Cost analysis of nondeterministic probabilistic programs. PLDI 2019: 204-220 - [c15]Hongfei Fu, Krishnendu Chatterjee:
Termination of Nondeterministic Probabilistic Programs. VMCAI 2019: 468-490 - [i14]Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee, Amir Kafshdar Goharshady:
Compositional Analysis for Almost-Sure Termination of Probabilistic Programs. CoRR abs/1901.06087 (2019) - [i13]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady:
Polynomial Invariant Generation for Non-deterministic Recursive Programs. CoRR abs/1902.04373 (2019) - [i12]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Peixin Wang, Xudong Qin, Wenjun Shi:
Cost Analysis of Nondeterministic Probabilistic Programs. CoRR abs/1902.04659 (2019) - [i11]Peixin Wang, Hongfei Fu, Krishnendu Chatterjee, Kangli He, Ming Xu:
Proving Expected Sensitivity of Probabilistic Programs with Randomized Execution Time. CoRR abs/1902.04744 (2019) - 2018
- [j1]Krishnendu Chatterjee, Hongfei Fu, Petr Novotný, Rouzbeh Hasheminezhad:
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. ACM Trans. Program. Lang. Syst. 40(2): 7:1-7:45 (2018) - [c14]Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee:
New Approaches for Almost-Sure Termination of Probabilistic Programs. APLAS 2018: 181-201 - [c13]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Nastaran Okati:
Computational Approaches for Stochastic Shortest Path on Succinct MDPs. IJCAI 2018: 4700-4707 - [c12]Hongfei Fu, Yi Li, Jianlin Li:
Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties. QEST 2018: 122-139 - [i10]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady, Nastaran Okati:
Computational Approaches for Stochastic Shortest Path on Succinct MDPs. CoRR abs/1804.08984 (2018) - [i9]Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee:
New Approaches for Almost-Sure Termination of Probabilistic Programs. CoRR abs/1806.06683 (2018) - 2017
- [c11]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Non-polynomial Worst-Case Analysis of Recursive Programs. CAV (2) 2017: 41-63 - [c10]Krishnendu Chatterjee, Hongfei Fu, Aniket Murhekar:
Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds. CAV (1) 2017: 118-139 - [i8]Krishnendu Chatterjee, Hongfei Fu:
Termination of Nondeterministic Recursive Probabilistic Programs. CoRR abs/1701.02944 (2017) - [i7]Krishnendu Chatterjee, Hongfei Fu, Aniket Murhekar:
Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds. CoRR abs/1705.00314 (2017) - [i6]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Non-polynomial Worst-Case Analysis of Recursive Programs. CoRR abs/1705.00317 (2017) - [i5]Hongfei Fu, Yi Li, Jianlin Li, Lijun Zhang:
Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties. CoRR abs/1712.00275 (2017) - 2016
- [c9]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Termination Analysis of Probabilistic Programs Through Positivstellensatz's. CAV (1) 2016: 3-22 - [c8]Krishnendu Chatterjee, Hongfei Fu, Petr Novotný, Rouzbeh Hasheminezhad:
Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. POPL 2016: 327-342 - [i4]Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady:
Termination Analysis of Probabilistic Programs through Positivstellensatz's. CoRR abs/1604.07169 (2016) - 2015
- [i3]Krishnendu Chatterjee, Hongfei Fu, Petr Novotný, Rouzbeh Hasheminezhad:
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs. CoRR abs/1510.08517 (2015) - 2014
- [b1]Hongfei Fu:
Verifying probabilistic systems: new algorithms and complexity results. RWTH Aachen University, 2014 - [c7]Hongfei Fu:
Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes. FoSSaCS 2014: 73-87 - 2013
- [c6]Hongfei Fu:
Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata. HSCC 2013: 323-332 - [i2]Hongfei Fu:
Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes. CoRR abs/1310.2514 (2013) - 2012
- [c5]Hongfei Fu:
Computing Game Metrics on Markov Decision Processes. ICALP (2) 2012: 227-238 - [i1]Hongfei Fu:
Approximating Acceptance Probabilities of CTMC-Paths on Multi-Clock Deterministic Timed Automata. CoRR abs/1210.4787 (2012) - 2011
- [c4]Hongfei Fu:
Model Checking EGF on Basic Parallel Processes. ATVA 2011: 120-134 - [c3]Chaodong He, Yuxi Fu, Hongfei Fu:
Decidability of Behavioral Equivalences in Process Calculi with Name Scoping. FSEN 2011: 284-298 - [c2]Hongfei Fu, Joost-Pieter Katoen:
Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems. FSTTCS 2011: 445-456
2000 – 2009
- 2009
- [c1]Hongfei Fu:
Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable. APLAS 2009: 327-342
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-25 23:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
