1 citations · 1 across the 4 of their papers we have counts for
1 paper · 1 filter
Éléanore Meyer, Jürgen Giesl
We show that universal positive almost sure termination (UPAST) is decidable for a class of simple randomized programs, i.e., it is decidable whether the expected runtime of such a…