| Full text | |
| Author(s): |
Total Authors: 3
|
| Affiliation: | [1] Univ Estadual Campinas, Inst Comp, Campinas, SP - Brazil
[2] Univ Poitiers, LMA, Poitiers - France
Total Affiliations: 2
|
| Document type: | Journal article |
| Source: | FORMAL ASPECTS OF COMPUTING; v. 27, n. 5-6, p. 805-829, NOV 2015. |
| Web of Science Citations: | 1 |
| 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 Grobner 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. (AU) | |
| FAPESP's process: | 11/08947-1 - Algebraic Formal Methods for Invariant Generation. |
| Grantee: | Rachid Rebiha |
| Support Opportunities: | Scholarships in Brazil - Post-Doctoral |
| FAPESP's process: | 13/04734-9 - Algebraic formal methods for program verification |
| Grantee: | Rachid Rebiha |
| Support Opportunities: | Scholarships abroad - Research Internship - Post-doctor |