Deciding ω-Regular Properties on Linear Recurrence Sequences

10/27/2020
by   Shaull Almagor, et al.
0

We consider the problem of deciding ω-regular properties on infinite traces produced by linear loops. Here we think of a given loop as producing a single infinite trace that encodes information about the signs of program variables at each time step. Formally, our main result is a procedure that inputs a prefix-independent ω-regular property and a sequence of numbers satisfying a linear recurrence, and determines whether the sign description of the sequence (obtained by replacing each positive entry with "+", each negative entry with "-", and each zero entry with "0") satisfies the given property. Our procedure requires that the recurrence be simple, , that the update matrix of the underlying loop be diagonalisable. This assumption is instrumental in proving our key technical lemma: namely that the sign description of a simple linear recurrence sequence is almost periodic in the sense of Muchnik, Semënov, and Ushakov. To complement this lemma, we give an example of a linear recurrence sequence whose sign description fails to be almost periodic. Generalising from sign descriptions, we also consider the verification of properties involving semi-algebraic predicates on program variables.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/23/2020

On Positivity and Minimality for Second-Order Holonomic Sequences

An infinite sequence ⟨u_n⟩_n∈ℕ of real numbers is holonomic (also known ...
research
04/01/2022

Reachability Analysis of Linear System

In this paper, we propose a decision procedure of reachability for linea...
research
06/23/2022

Algebra-Based Reasoning for Loop Synthesis

Provably correct software is one of the key challenges of our software-d...
research
04/24/2020

Algebra-based Loop Synthesis

We present an algorithm for synthesizing program loops satisfying a give...
research
04/17/2021

A Timecop's Chase Around the Table

We consider the cops and robber game variant consisting of one cop and o...
research
05/02/2021

Extremal values of semi-regular continuants and codings of interval exchange transformations

Given a set A consisting of positive integers a_1<a_2<⋯<a_k and a k-term...

Please sign up or login with your details

Forgot password? Click here to reset