Abstract
Models of algorithms of floating-point addition are designed for chopping, correctly rounding and augmentation rounding arithmetics with finite-length accumulators. The chopping arithmetic is shown to match with the simplest software, which calculates round-off errors. The effective length of digits of the accumulator is detected theoretically to this software.
