The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros of a linear
recurrence sequence is the union of a finite set and finitely many arithmetic progressions …

We study discrete probabilistic programs with potentially unbounded looping behaviors over
an infinite state space. We present, to the best of our knowledge, the first decidability result …

It is a longstanding open problem whether there is an algorithm to decide the Skolem
Problem for linear recurrence sequences (LRS) over the integers, namely whether a given …

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 …

The Skolem Problem asks to determine whether a given integer linear recurrence sequence
has a zero term. This problem arises across a wide range of topics in computer science …

For almost a century, the decidability of the Skolem Problem-that is, the problem of finding
whether a given linear recurrence sequence (LRS) has a zero term-has remained open. A …

We improve the algorithms of Lauder-Wan [11] and Harvey [8] to compute the zeta function
of a system of m polynomial equations in n variables, over the q element finite field F q, for …