Left-eigenvectors are certificates of the Orbit Problem

This paper investigates the connexion between the Kannan-Lipton Orbit Problem and the polynomial invariant generator algorithm PILA based on eigenvectors computation. Namely, we reduce the problem of generating linear and polynomial certificates of non-reachability for the Orbit Problem for linear transformations with rational coefficients to the generalized eigenvector problem. Also, we prove the existence of such certificates for any transformation with integer coefficients, which is not the case with rational coefficients.

[1]  Richard J. Lipton,et al.  Polynomial-time algorithm for the orbit problem , 1986, JACM.

[2]  Laura Kovács,et al.  Reasoning Algebraically About P-Solvable Loops , 2008, TACAS.

[3]  Enric Rodríguez-Carbonell,et al.  Generating all polynomial invariants in simple loops , 2007, J. Symb. Comput..

[4]  Patrick Cousot,et al.  Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.

[5]  Joël Ouaknine,et al.  Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem , 2017, STACS.

[6]  Sandrine Blazy,et al.  Structuring Abstract Interpreters Through State and Value Abstractions , 2017, VMCAI.

[7]  Jean-Christophe Filliâtre,et al.  Why3 - Where Programs Meet Provers , 2013, ESOP.

[8]  Richard J. Lipton,et al.  The orbit problem is decidable , 1980, STOC '80.

[9]  Lucas C. Cordeiro,et al.  Model Checking Embedded C Software Using k-Induction and Invariants , 2015, 2015 Brazilian Symposium on Computing Systems Engineering (SBESC).

[10]  Marius Bozga,et al.  Fast Acceleration of Ultimately Periodic Relations , 2010, CAV.

[11]  Virgile Prevosto,et al.  Polynomial Invariants by Linear Algebra , 2016, ATVA.

[12]  Virgile Prevosto,et al.  Synthesizing Invariants by Solving Solvable Loops , 2016, ATVA.

[13]  William G. Griswold,et al.  Dynamically discovering likely program invariants to support program evolution , 1999, Proceedings of the 1999 International Conference on Software Engineering (IEEE Cat. No.99CB37002).

[14]  Andrzej Schinzel,et al.  A refinement of two theorems of Kronecker. , 1965 .