papers
Publications (10)
cs.PL2016
Termination Analysis of Probabilistic Programs through Positivstellensatz's
Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady
cs.PL2017
Termination of Nondeterministic Recursive Probabilistic Programs
Krishnendu Chatterjee, Hongfei Fu
cs.LO2015
Algorithmic Analysis of Qualitative and Quantitative Termination Problems for Affine Probabilistic Programs
Krishnendu Chatterjee, Hongfei Fu, Petr Novotny +1
cs.PL2018
Computational Approaches for Stochastic Shortest Path on Succinct MDPs
Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady +1
cs.LO2019
Modular Verification for Almost-Sure Termination of Probabilistic Programs
Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee +1
The paper identifies flaws in a previous modular rule for proving almost‑sure termination of probabilistic programs and introduces a sound modular rule based on descent supermartin…
#probabilistic programs#almost-sure termination#modular verification#supermartingales
cs.PL2019
Cost Analysis of Nondeterministic Probabilistic Programs
Peixin Wang, Hongfei Fu, Amir Kafshdar Goharshady +3
cs.LO2018
New Approaches for Almost-Sure Termination of Probabilistic Programs
Mingzhang Huang, Hongfei Fu, Krishnendu Chatterjee
cs.FL2018
Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties
Hongfei Fu, Yi Li, Jianlin Li +1
cs.PL2017
Non-polynomial Worst-Case Analysis of Recursive Programs
Krishnendu Chatterjee, Hongfei Fu, Amir Kafshdar Goharshady
cs.PL2017
Automated Recurrence Analysis for Almost-Linear Expected-Runtime Bounds
Krishnendu Chatterjee, Hongfei Fu, Aniket Murhekar