Hongfei Fu

Orcid: 0000-0002-7947-3446

Affiliations:
  • Shanghai Jiao Tong University, John Hopcroft Center for Computer Science, China
  • IST Austria, Klosterneuburg, Austria (former)
  • Chinese Academy of Sciences, Institute of Software, Beijing, China (former)
  • RWTH Aachen University, Germany (PhD 2014)


According to our database1, Hongfei Fu authored at least 40 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial Solving.
Proc. ACM Program. Lang., 2024

Piecewise Linear Expectation Analysis via k-Induction for Probabilistic Programs.
CoRR, 2024

Equational Bit-Vector Solving via Strong Gröbner Bases.
CoRR, 2024

2023
Affine Disjunctive Invariant Generation with Farkas' Lemma.
CoRR, 2023

Template-Based Static Posterior Inference for Bayesian Probabilistic Programming.
CoRR, 2023

Demystifying Template-Based Invariant Generation for Bit-Vector Programs.
Proceedings of the 38th IEEE/ACM International Conference on Automated Software Engineering, 2023

Automated Tail Bound Analysis for Probabilistic Recurrence Relations.
Proceedings of the Computer Aided Verification - 35th International Conference, 2023

2022
Scalable linear invariant generation with Farkas' lemma.
Proc. ACM Program. Lang., 2022

Guided Diffusion Model for Adversarial Purification.
CoRR, 2022

Repo4QA: Answering Coding Questions via Dense Retrieval on GitHub Repositories.
Proceedings of the 29th International Conference on Computational Linguistics, 2022

Affine Loop Invariant Generation via Matrix Algebra.
Proceedings of the Computer Aided Verification - 34th International Conference, 2022

2021
Quantitative analysis of assertion violations in probabilistic programs.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Polynomial reachability witnesses via Stellensätze.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

2020
Proving expected sensitivity of probabilistic programs with randomized variable-dependent termination time.
Proc. ACM Program. Lang., 2020

Concentration-Bound Analysis for Probabilistic Programs and Probabilistic Recurrence Relations.
CoRR, 2020

Inductive Reachability Witnesses.
CoRR, 2020

Polynomial invariant generation for non-deterministic recursive programs.
Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

2019
Non-polynomial Worst-Case Analysis of Recursive Programs.
ACM Trans. Program. Lang. Syst., 2019

Modular verification for almost-sure termination of probabilistic programs.
Proc. ACM Program. Lang., 2019

Deciding probabilistic simulation between probabilistic pushdown automata and finite-state systems.
Inf. Comput., 2019

Proving Expected Sensitivity of Probabilistic Programs with Randomized Execution Time.
CoRR, 2019

Compositional Analysis for Almost-Sure Termination of Probabilistic Programs.
CoRR, 2019

Termination of Nondeterministic Probabilistic Programs.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2019

Cost analysis of nondeterministic probabilistic programs.
Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

2018
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs.
ACM Trans. Program. Lang. Syst., 2018

Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties.
Proceedings of the Quantitative Evaluation of Systems - 15th International Conference, 2018

Computational Approaches for Stochastic Shortest Path on Succinct MDPs.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

New Approaches for Almost-Sure Termination of Probabilistic Programs.
Proceedings of the Programming Languages and Systems - 16th Asian Symposium, 2018

2017
Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties.
CoRR, 2017

Termination of Nondeterministic Recursive Probabilistic Programs.
CoRR, 2017

Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds.
Proceedings of the Computer Aided Verification - 29th International Conference, 2017

2016
Termination Analysis of Probabilistic Programs Through Positivstellensatz's.
Proceedings of the Computer Aided Verification - 28th International Conference, 2016

2014
Verifying probabilistic systems: new algorithms and complexity results.
PhD thesis, 2014

Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013
Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata.
Proceedings of the 16th international conference on Hybrid systems: computation and control, 2013

2012
Computing Game Metrics on Markov Decision Processes.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

Decidability of Behavioral Equivalences in Process Calculi with Name Scoping.
Proceedings of the Fundamentals of Software Engineering - 4th IPM International Conference, 2011

Model Checking EGF on Basic Parallel Processes.
Proceedings of the Automated Technology for Verification and Analysis, 2011

2009
Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable.
Proceedings of the Programming Languages and Systems, 7th Asian Symposium, 2009


  Loading...