scispace - formally typeset
Search or ask a question

Showing papers by "Dong Xiang published in 1994"


Proceedings ArticleDOI
15 Nov 1994
TL;DR: A new test scheduling algorithm is given after the test subsession partitioning scheme is combined, which has learning ability by recording the previous conflict information, which prunes the searching space of the test scheduling problem effectively.
Abstract: The tester time is expensive, which should be reduced as much as possible. Considering the fact that test response observation and test application only use a fraction of the whole testing time, a test subsession partitioning scheme is offered. Therefore, some further sources of the test scheduling problem are used. Subcircuits in conflict according to the definition are only partially in conflict now. A new test scheduling algorithm is given after the test subsession partitioning scheme is combined. This algorithm has learning ability by recording the previous conflict information, which prunes the searching space of the test scheduling problem effectively. >

1 citations


Journal ArticleDOI
TL;DR: A global design for testability algorithm is offered in this paper, where the principle of selective tracing is offered to get a sequential test point placement solution, which is used as the initial solution of the global algorithm.
Abstract: A global design for testability algorithm is offered in this paper. First, a test point candidate set is obtained to simplify the test point placement problem; the principle of selective tracing is offered to get a sequential test point placement solution, which is used as the initial solution of the global algorithm. Using this initial value, abranch & bound algorithm is then offered to obtain a global design for testability solution. Finally, a new test length analyser is offered to evaluate the global design for testability.