1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.PL2021★ 1 cited
On Lexicographic Proof Rules for Probabilistic Termination
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný +2
We consider the almost-sure (a.s.) termination problem for probabilistic programs, which are a stochastic extension of classical imperative programs. Lexicographic ranking function…
cs.PL2020
Proving Almost-Sure Termination of Probabilistic Programs via Incremental Pruning
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný +2
The extension of classical imperative programs with real-valued random variables and random branching gives rise to probabilistic programs. The termination problem is one of the mo…