Software testing techniques (2nd ed.)
Software testing techniques (2nd ed.)
The craft of software testing: subsystem testing including object-based and object-oriented testing
The craft of software testing: subsystem testing including object-based and object-oriented testing
Test program generation for functional verification of PowerPC processors in IBM
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
User defined coverage—a tool supported methodology for design verification
DAC '98 Proceedings of the 35th annual Design Automation Conference
Functional verification methodology for microprocessors using the Genesys test-program generator
DATE '99 Proceedings of the conference on Design, automation and test in Europe
Formal verification of iterative algorithms in microprocessors
Proceedings of the 37th Annual Design Automation Conference
Computer Architecture: Complexity and Correctness
Computer Architecture: Complexity and Correctness
Verifying the SRT Division Algorithm Using Theorem Proving Techniques
Formal Methods in System Design
A Mechanically Checked Proof of Correctness of the AMD K5 Floating Point Square Root Microcode
Formal Methods in System Design
Number-Theoretic Test Generation for Directed Rounding
ARITH '99 Proceedings of the 14th IEEE Symposium on Computer Arithmetic
Computing the minimum DNF representation of boolean functions defined by intervals
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
FPgen - a test generation framework for datapath floating-point verification
HLDVT '03 Proceedings of the Eighth IEEE International Workshop on High-Level Design Validation and Test Workshop
Computing the minimum DNF representation of Boolean functions defined by intervals
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
| Hi-index | 0.00 |
The mathematical problem discussed is important for generating test cases in order to debug floating point adders designs.Floating point numbers are assumed to be written as strings of {0, 1} bits, in a format compatible with IEEE standard 754. A mask is a string of characters, composed of {'0', '1', 'x'}. A number and a mask are compatible if they have the same length and each numerical character of the mask ('0' or '1') is equal, numerically, to the bit of the number, in the same position. The problem discussed is: Given masks Ma, Mb, Mc, of identical lengths, generate three floating point numbers a,b,c which are compatible with the masks and satisfy c=round(a±b)). If there are many solutions, choose one at random. A fast algorithm is given which solves the problem for all IEEE floating point data types and all rounding modes.