All possible computed results in correct floating-point summation

On a computer, any entry or elementary operation has two legitimate results, one by default and one by excess. Thus, a given algebraic algorithm with a single result is able, when processed on a computer, to generate a large set of floating-point results, all representative of the exact algebraic result. The aim of this paper is to characterize such sets in the particular case of summation.