2 citations · 3 across the 12 of their papers we have counts for
5 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…
Sound and Complete Witnesses for Template-based Verification of LTL Properties on Polynomial Programs
Krishnendu Chatterjee, Amir Kafshdar Goharshady, Ehsan Kafshdar Goharshady +2
We study the classical problem of verifying programs with respect to formal specifications given in the linear temporal logic (LTL). We first present novel sound and complete witne…
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…