DeepAI AI Chat
Log In Sign Up

Synthesising a Database of Parameterised Linear and Non-Linear Invariants for Time-Series Constraints

by   Ekaterina Arafailova, et al.

Many constraints restricting the result of some computations over an integer sequence can be compactly represented by register automata. We improve the propagation of the conjunction of such constraints on the same sequence by synthesising a database of linear and non-linear invariants using their register-automaton representation. The obtained invariants are formulae parameterised by a function of the sequence length and proven to be true for any long enough sequence. To assess the quality of such linear invariants, we developed a method to verify whether a generated linear invariant is a facet of the convex hull of the feasible points. This method, as well as the proof of non-linear invariants, are based on the systematic generation of constant-size deterministic finite automata that accept all integer sequences whose result verifies some simple condition. We apply such methodology to a set of 44 time-series constraints and obtain 1400 linear invariants from which 70 facet defining, and 600 non-linear invariants, which were tested on short-term electricity production problems.


Undecidability of Inferring Linear Integer Invariants

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

Templates and Recurrences: Better Together

This paper is the confluence of two streams of ideas in the literature o...

Algebraic Invariants for Linear Hybrid Automata

We exhibit an algorithm to compute the strongest algebraic (or polynomia...

Beyond the Elementary Representations of Program Invariants over Algebraic Data Types

First-order logic is a natural way of expressing properties of computati...

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...

Constructive Non-Linear Polynomial Cryptanalysis of a Historical Block Cipher

One of the major open problems in symmetric cryptanalysis is to discover...

PHOEG Helps Obtaining Extremal Graphs

Extremal Graph Theory aims to determine bounds for graph invariants as w...