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 consider the MSO model-checking problem for simple linear loops, or equivalently
discrete-time linear dynamical systems, with semialgebraic predicates (ie, Boolean …

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 …

The Positivity Problem for linear recurrence sequences over a ring R of real algebraic
numbers is to determine, given an LRS \left(u_n\right)_n∈N over R, whether un≥ 0 for all n …

What’s Decidable About Discrete Linear Dynamical Systems? | SpringerLink Skip to main
content Advertisement SpringerLink Account Menu Find a journal Publish with us Track your …

Loop invariant generation, which automates the generation of assertions that always hold at
the entry of a while loop, has many important applications in program analysis and formal …

It is widely known that the precision of a program analyzer is closely related to intensional
program properties, namely, properties concerning how the program is written. This …

Abstract Model checking infinite-state systems is one of the central challenges in automated
verification. In this survey we focus on an important and fundamental subclass of infinite …

For which unary predicates P 1,…, P m is the MSO theory of the structure< N;<, P 1,…, P m>
decidable? We survey the state of the art, leading us to investigate combinatorial properties …

In discrete-time linear dynamical systems (LDSs), a linear map is repeatedly applied to an
initial vector yielding a sequence of vectors called the orbit of the system. A weight function …