Loop invariants in floating point algorithms

It will be shown that by using directed roundings resp. enclosure sets for the exact values, the loop conditions and loop invariants of numerical algorithms can be generalized for computing in a discrete screen. On this way, in spite of rounding errors, it is possible to verify the received results. Thereby only inherent properties of the algorithms are used, which moreover guarantee that the loops terminate.