Polynomial Invariants for Affine Programs

by   Ehud Hrushovski, et al.
University of Oxford
Max Planck Institute for Software Systems

We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose assignments are given by affine expressions). Our main tool is an algebraic result of independent interest: given a finite set of rational square matrices of the same dimension, we show how to compute the Zariski closure of the semigroup that they generate.


page 1

page 2

page 3

page 4


Algebraic Invariants for Linear Hybrid Automata

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

Affine Disjunctive Invariant Generation with Farkas' Lemma

Invariant generation is the classical problem that aims at automated gen...

Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs

We show that computing the strongest polynomial invariant for single-pat...

Algebra-based Synthesis of Loops and their Invariants (Invited Paper)

Provably correct software is one of the key challenges in our softwaredr...

Minimal codewords in Norm-Trace codes

In this paper, we consider the affine variety codes obtained evaluating ...

When is a polynomial ideal binomial after an ambient automorphism?

Can an ideal I in a polynomial ring k[x] over a field be moved by a chan...

Some interesting birational morphisms of smooth affine quadric 3-folds

We study a family of birational maps of smooth affine quadric 3-folds x_...

Please sign up or login with your details

Forgot password? Click here to reset