Using a constraint satisfaction formulation and solution techniques for random test program generation

Eyal Bin, R. Emek, Gil Shurek, Avi Ziv

IBM Systems Journal · 2002 · 88 citations · 23 references

Concepts

Abstract

Automatic generation of test programs plays a major role in the verification of modern processors and hardware systems. In this paper, we formulate the generation of test programs as a constraint satisfaction problem and develop techniques for dealing with the challenges we face, most notably: huge variable domains (e.g., magnitude of 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">64</sup> ) and the need to randomly generate “well distributed” samplings of the solution space. We describe several applications of our method, which include specific test generators targeted at various parts of a design or stages of the verification process.

References

23