30 citations · 45 across the 20 of their papers we have counts for
6 papers · 1 filter
Refuting Equivalence in Probabilistic Programs with Conditioning
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný +1
We consider the problem of refuting equivalence of probabilistic programs, i.e., the problem of proving that two probabilistic programs induce different output distributions. We st…
Equivalence and Similarity Refutation for Probabilistic Programs
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný +1
We consider the problems of statically refuting equivalence and similarity of output distributions defined by a pair of probabilistic programs. Equivalence and similarity are two f…
Proving Non-termination by Program Reversal
Krishnendu Chatterjee, Ehsan Kafshdar Goharshady, Petr Novotný +1
We present a new approach to proving non-termination of non-deterministic integer programs. Our technique is rather simple but efficient. It relies on a purely syntactic reversal o…
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…
Lexicographic Ranking Supermartingales: An Efficient Approach to Termination of Probabilistic Programs
Sheshansh Agrawal, Krishnendu Chatterjee, Petr Novotný
Probabilistic programs extend classical imperative programs with real-valued random variables and random branching. The most basic liveness property for such programs is the termin…
Stochastic Invariants for Probabilistic Termination
Krishnendu Chatterjee, Petr Novotný, Đorđe Žikelić
Termination is one of the basic liveness properties, and we study the termination problem for probabilistic programs with real-valued variables. Previous works focused on the quali…