Hongfei Fu


Assistant Professor (tenure-track)
John Hopcroft Center for Computer Science
Shanghai Jiao Tong University

Research Interests

Formal Verification of Probabilistic Systems, Program Verification

Selected Publications
  • New Approaches for Almost-Sure Termination of Probabilistic Programs (with Mingzhang Huang and Krishnendu Chatterjee). Programming Languages and Systems - 16th Asian Symposium, APLAS 2018. (CCF C)

  • Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties (with Yi Li and Jianlin Li). Quantitative Evaluation of Systems - 15th International Conference,  QEST 2018

  • Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs (with Krishnendu Chatterjee, Petr Novotný and Rouzbeh Hasheminezhad). ACM Trans. Program. Lang. Syst. 40(2): 7:1-7:45 (2018) (CCF A)
  • Computational Approaches for Stochastic Shortest Path on Succinct MDPs (with Krishnendu Chatterjee, Amir Kafshdar Goharshady and Nastaran Okati). IJCAI-ECAI 2018, the 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence, to appear.   (CCF A)

  • Non-polynomial Worst-case Analysis of Recursive Programs (with Prof. Krishnendu Chatterjee and Amir Kafshdar Goharshady). Computer Aided Verification, 29th International Conference, CAV 2017.   (CCF A)
  • Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds (with Prof. Krishnendu Chatterjee and Aniket Murhekar). Computer Aided Verification, 29th International Conference, CAV 2017.    (CCF A)
  • Termination Analysis of Probabilistic Programs Through Positivstellensatz’s. (with Prof. Krishnendu Chatterjee and Amir Kafshdar Goharshady). Computer Aided Verification, 28th International Conference, CAV 2016.    (CCF A)
  • Algorithmic analysis of qualitative and quantitative termination problems for affine probabilistic programs. (with Petr Novotny, Prof. Krishnendu Chatterjee and Rouzbeh Hasheminezhad). Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2016.    (CCF A)
  • Maximal Cost-Bounded Reachability Probability on Continuous-Time Markov Decision Processes. Foundations of Software Science and Computation Structures, 17th International Conference, FOSSACS 2014, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2014.     (CCF B)
  • Approximating acceptance probabilities of CTMC-paths on multi-clock deterministic timed automata. Proceedings of the 16th international conference on Hybrid systems: computation and control, HSCC 2013.   Best Student  Paper    (CCF B)
  • Computing Game Metrics on Markov Decision Processes. Automata, Languages, and Programming, 39th International Colloquium, ICALP 2012.    (CCF B)
  • Model Checking EGF on Basic Parallel Processes. Automated Technology for Verification and Analysis, 9th International Symposium, ATVA 2011.    (CCF C)
  • Deciding Probabilistic Simulation between Probabilistic Pushdown Automata and Finite-State Systems (with Prof. Joost-Pieter Katoen). IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011.   (CCF C)
  • Decidability of Behavioral Equivalences in Process Calculi with Name Scoping (with Chaodong He and Prof. Yuxi Fu). Fundamentals of Software Engineering - 4th IPM International Conference, FSEN 2011. Branching Bisimilarity between Finite-State Systems and BPA or Normed BPP Is Polynomial-Time Decidable. Programming Languages and Systems, 7th Asian Symposium, APLAS 2009.    (CCF C)
© John Hopcroft Center for Computer Science, Shanghai Jiao Tong University

邮箱:jhc@sjtu.edu.cn 电话:021-54740299