Analysis of linear definite iterative loops
From MaRDI portal
Publication:289808
DOI10.1007/s10559-016-9806-5zbMath1356.68045OpenAlexW2273710723MaRDI QIDQ289808
Publication date: 31 May 2016
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-016-9806-5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonlinear invariants for linear loops and eigenpolynomials of linear operators
- Discovery of invariant equalities in programs over data fields
- A method of proving the invariance of linear inequalities for linear loops
- Computing polynomial program invariants
- Polynomial invariants for linear loops
- Non-linear loop invariant generation using Gröbner bases
- Precise interprocedural analysis through linear algebra
- Search for invariant linear relationships in programs
- Invariant inequalities in programs interpreted over an ordered field
- Iterative methods of program analysis
- Iterative methods of program analysis: Equalities and inequalities
- Automatic Generation of Polynomial Loop Invariants
- An axiomatic basis for computer programming
This page was built for publication: Analysis of linear definite iterative loops