RANDOM TESTING OF THE DATA PROCESSING SECTION OF A MICROPROCESSOR

The principle of random testing is as follows : a random input sequence is applied s imultaneously to both a circuit under test and a reference circuit. The outputs are compared. In t he case of microprocessors, we apply a sequence of random instructions with random data. The research aim is to calculate the test length (i.e. the number of instructions) for given instruction probabilities. The paper deals with the faults in the data processing section, which is modeled by a qraph containing registers and operators. We consider functional level fault models in registers and operators. We use the notion of Minimal Detectinq Transition Sequences (MDTS) .

[1]  Shedletsky,et al.  The Error Latency of a Fault in a Sequential Digital Circuit , 1976, IEEE Transactions on Computers.

[2]  René David,et al.  Minimal Detecting Transition Sequences: Application to Random Testing , 1980, IEEE Transactions on Computers.

[3]  W. Luciw Can a User Test LSI Microprocessors Effectively , 1976 .

[4]  Jacob A. Abraham,et al.  TEST GENERATION FOR GENERAL MICROPROCESSOR ARCHITECTURES. , 1979 .

[5]  P. Thévenod-Fosse,et al.  Random testing of integrated circuits , 1981, IEEE Transactions on Instrumentation and Measurement.