Invariant inequalities in programs interpreted over an ordered field

DOI10.1007/BF01068351zbMath0637.68020MaRDI QIDQ3777432

M. S. Lvov

Publication date: 1986

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

polynomial ringsinvariant relationsfiniteness problemalgorithmically undecidablealgebra of dataapproximating sequences of idealsinvariant inequalitiesreal closure of a linearly ordered fieldU-Y model of programs

Mathematics Subject Classification ID

Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15) Specification and verification (program logics, model checking, etc.) (68Q60) Ordered fields (12J15)

Related Items (3)

Analysis of linear definite iterative loops ⋮ Iterative methods of program analysis: Equalities and inequalities ⋮ A method of proving the invariance of linear inequalities for linear loops

Cites Work

• Decision procedures for real and p‐adic fields

This page was built for publication: Invariant inequalities in programs interpreted over an ordered field