The structure of polynomial invariants of linear loops
From MaRDI portal
Publication:891730
Recommendations
Cites work
- scientific article; zbMATH DE number 3159536 (Why is no real title available?)
- scientific article; zbMATH DE number 3736994 (Why is no real title available?)
- scientific article; zbMATH DE number 3302325 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- An axiomatic basis for computer programming
- Automatic Generation of Polynomial Loop Invariants
- Automatic generation of polynomial invariants of bounded degree using abstract interpretation
- Computing polynomial program invariants
- Discovery of invariant equalities in programs over data fields
- Iterative methods of program analysis
- Non-linear loop invariant generation using Gröbner bases
- Nonlinear invariants for linear loops and eigenpolynomials of linear operators
- Polynomial invariants for linear loops
- Precise interprocedural analysis through linear algebra
Cited in
(12)- Nonlinear invariants for linear loops and eigenpolynomials of linear operators
- Automatic Generation of Polynomial Loop Invariants
- scientific article; zbMATH DE number 1304271 (Why is no real title available?)
- scientific article; zbMATH DE number 4146075 (Why is no real title available?)
- A fast algorithm for computing multiplicative relations between the roots of a generic polynomial
- Polynomial invariants for linear loops
- Generating all polynomial invariants in simple loops
- Degree and dimension estimates for invariant ideals of \(P\)-solvable recurrences
- Polynomial Invariants for Affine Programs
- A method of proving the invariance of linear inequalities for linear loops
- Analysis of linear definite iterative loops
- Polynomial invariants by linear algebra
This page was built for publication: The structure of polynomial invariants of linear loops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q891730)