“…[19,40]). Alternatively, for restricted classes of probabilistic loops with polynomial updates, symbolic methods from algorithmic combinatorics can be used to compute the exact (higherorder) moments of random program variables x by expressing these moments as closed-form expressions over loop iterations and some initial values [2,31]. That is, [2,31] derive the expected value of the kth moment of variable x at loop iteration n, denoted as E(x k (n)), in closed form, where x k (n) specifies the value of x k at loop iteration n, and k, n ∈ N.…”