Abstract
Present approaches for non-linear loop invariant generation are limited to linear (affine) systems, or they relay on non scalable methods which have high complexity. Moreover, for programs with nested loops and conditional statements that describe multivariate polynomials or multivariate fractional systems, no applicable method is known to lend itself to non-trivialnon-linear invariants generation. We demonstrate a powerful computational completemethod to solve this problem. Our approach avoids first-order quantifier elimination, cylindrical algebraic decomposition and Grobner bases computation, hereby circumventing difficulties met by recent methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
