Polynomial invariants for linear loops

Authors:
M. S. Lvov
Affiliations:
Research Institute of Information Technologies, Kherson State University, Kherson, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2010

Citing 8
Cited 0

An axiomatic basis for computer programming

Communications of the ACM
Finding Invariant assertions for proving programs

Proceedings of the international conference on Reliable software
Non-linear loop invariant generation using Gröbner bases

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Precise interprocedural analysis through linear algebra

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic Generation of Polynomial Loop Invariants: Algebraic Foundations

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Computing polynomial program invariants

Information Processing Letters
An Algorithm for Automated Generation of Invariants for Loops with Conditionals

SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Automatic generation of polynomial invariants of bounded degree using abstract interpretation

Science of Computer Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of generating polynomial invariants of special type for iterative loops with a linear mapping in the loop body is considered. A technique is proposed to generate such invariants based on the analysis of characteristic polynomials of linear mappings.