Invariant inequalities in programs interpreted over an ordered field
From MaRDI portal
Recommendations
- Publication:4729341
- scientific article; zbMATH DE number 3911682
- Discovery of invariant equalities in programs over data fields
- Invariants and well-foundedness in program algebra
- scientific article; zbMATH DE number 4131671
- scientific article; zbMATH DE number 3934388
- Order-invariant types and their applications
- scientific article; zbMATH DE number 806754
- Computing polynomial program invariants
- Generalizations of algorithms that find invariant relationships in programs over algebra of terms
Cited in
(8)- Iterative methods of program analysis: Equalities and inequalities
- Analysis of linear definite iterative loops
- scientific article; zbMATH DE number 4113989 (Why is no real title available?)
- Discovery of invariant equalities in programs over data fields
- scientific article; zbMATH DE number 4131671 (Why is no real title available?)
- scientific article; zbMATH DE number 3934388 (Why is no real title available?)
- A method of proving the invariance of linear inequalities for linear loops
- scientific article; zbMATH DE number 3911682 (Why is no real title available?)
This page was built for publication: Invariant inequalities in programs interpreted over an ordered field
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777432)