DeepAI AI Chat
Log In Sign Up

Reflections on Termination of Linear Loops

by   Shaowei Zhu, et al.

This paper shows how techniques for linear dynamical systems can be used to reason about the behavior of general loops. We present two main results. First, we show that every loop that can be expressed as a transition formula in linear integer arithmetic has a best model as a deterministic affine transition system. Second, we show that for any linear dynamical system f with integer eigenvalues and any integer arithmetic formula G, there is a linear integer arithmetic formula that holds exactly for the states of f for which G is eventually invariant. Combining the two, we develop a monotone conditional termination analysis for general loops.


page 1

page 2

page 3

page 4


Undecidability of Inferring Linear Integer Invariants

We show that the problem of determining the existence of an inductive in...

When Less Is More: Consequence-Finding in a Weak Theory of Arithmetic

This paper presents a theory of non-linear integer/real arithmetic and a...

Termination of Triangular Integer Loops is Decidable

We consider the problem whether termination of affine integer loops is d...

Monitoring of Traffic Manoeuvres with Imprecise Information

In monitoring, we algorithmically check if a single behavior satisfies a...

On Termination of Integer Linear Loops

We consider the problem of determining termination of single-path loops ...

Termination of Linear Loops over the Integers

We consider the problem of deciding termination of single-path while loo...

Branch-Well-Structured Transition Systems and Extensions

We propose a relaxation to the definition of a well-structured transitio...