-
On Lexicographic Proof Rules for Probabilistic Termination
We consider the almost-sure (a.s.) termination problem for probabilistic...
08/04/2021 ∙ by Krishnendu Chatterjee, et al. ∙
0
∙
share
read it
-
Proving Non-termination by Program Reversal
We present a new approach to proving non-termination of non-deterministi...
04/02/2021 ∙ by Krishnendu Chatterjee, et al. ∙
0
∙
share
read it
-
Proving Almost-Sure Termination of Probabilistic Programs via Incremental Pruning
The extension of classical imperative programs with real-valued random v...
08/14/2020 ∙ by Krishnendu Chatterjee, et al. ∙
0
∙
share
read it
-
Polynomial Invariant Generation for Non-deterministic Recursive Programs
We present a sound and complete method to generate inductive invariants ...
02/12/2019 ∙ by Krishnendu Chatterjee, et al. ∙
0
∙
share
read it
