Generating invariants for non-linear loops by linear algebraic methods. (November 2015)

• Record Type: Journal Article
• Authors: Rebiha, Rachid; Moura, Arnaldo; Matringe, Nadir
• Is Part Of: Formal aspects of computing. Volume 27:Number 5(2015)
• Page Start: 805
• Page End: 829
• Publication Date: 2015-11
• Subjects: Formal methods -- Invariant generation -- Linear algebra; Computer science -- Periodicals; 004.05
• DOI: 10.1007/s00165-015-0333-3
• Languages: English
• ISSNs: 0934-5043

Abstract

Abstract We present new computational methods that can automate the discovery and the strengthening of non-linear interrelationships among the variables of programs containing non-linear loops, that is, that give rise to multivariate polynomial and fractional relationships. Our methods have complexities lower than the mathematical foundations of the previous approaches, which used Gröbner basis computations, quantifier eliminations or cylindrical algebraic decompositions. We show that the preconditions for discrete transitions can be viewed as morphisms over a vector space of degree bounded by polynomials. These morphisms can, thus, be suitably represented by matrices. We also introduce fractional and polynomial consecution, as more general forms for approximating consecution. The new relaxed consecution conditions are also encoded as morphisms represented by matrices. By so doing, we can reduce the non-linear loop invariant generation problem to the computation of eigenspaces of specific morphisms. Moreover, as one of the main results, we provide very general sufficient conditions allowing for the existence and computation of whole loop invariant ideals. As far as it is our knowledge, it is the first invariant generation methods that can handle multivariate fractional loops.