1618 search results - page 27 / 324 » Testing random number generators |
DATE
2003
IEEE
14 years 3 months ago
2003
IEEE
Test pattern decompression techniques are bounded with the algorithm of test pattern ordering and test data flow controlling. Some of the methods could have more sophisticated sor...
AADEBUG
2005
Springer
13 years 12 months ago
2005
Springer
In a C compiler, function calls are difficult to implement correctly because they must respect a platform-specific calling convention. But they are governed by a simple invariant...
ICCD
2004
IEEE
14 years 6 months ago
2004
IEEE
Many test data compression schemes are based on LFSR reseeding. A drawback of these schemes is that the unspecified bits are filled with random values resulting in a large number ...
ASE
2010
13 years 10 months ago
2010
Given a finite state machine M, a checking sequence is an input sequence that is guaranteed to lead to a failure if the implementation under test is faulty and has no more states t...
APCCAS
2006
IEEE
14 years 1 months ago
2006
IEEE
This paper considers z-domain transfer functions whose denominator polynomial possesses the property that the coefficient of zi is greater than the coefficient of zi-1 . Such trans...