Analysis of linear definite iterative loops
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 600607 (Why is no real title available?)
- scientific article; zbMATH DE number 2012129 (Why is no real title available?)
- scientific article; zbMATH DE number 4113989 (Why is no real title available?)
- scientific article; zbMATH DE number 3246235 (Why is no real title available?)
- scientific article; zbMATH DE number 3302923 (Why is no real title available?)
- A method of proving the invariance of linear inequalities for linear loops
- An axiomatic basis for computer programming
- Automatic Generation of Polynomial Loop Invariants
- Computing polynomial program invariants
- Discovery of invariant equalities in programs over data fields
- Invariant inequalities in programs interpreted over an ordered field
- Iterative methods of program analysis
- Iterative methods of program analysis: Equalities and inequalities
- 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
- Search for invariant linear relationships in programs
Cited in
(2)
This page was built for publication: Analysis of linear definite iterative loops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q289808)