Number-theoretic test generation for directed rounding

M. Parks
Proceedings 14th IEEE Symposium on Computer Arithmetic (Cat. No.99CB36336)  
We present methods to generate systematically the hardest test cases for multiplication, division, and square root subject to directed rounding, essentially extending previous work on number-theoretic floating-point testing to rounding modes other than to-nearest. The algorithms focus upon the rounding boundaries of the modes truncate, to-minusinfinity, and to-infinity, and programs based on them require little beyond exact arithmetic in the working precision to create billions of edge cases.
more » ... ns of edge cases. We will show that the amount of work required to calculate trial multiplicands pays off in the form of free extra tests due to an interconnection among the operations considered herein. Although these tests do not replace proofs of correctness, they can be used to gain a high degree of confidence that the accuracy requirements as mandated by IEEE Standard 754 have been satisfied.
doi:10.1109/arith.1999.762850 dblp:conf/arith/Parks99 fatcat:fj7mf2zw6vafrjmnbcxpqevcay