Graphs and Hypergraphs
Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing
IEEE Transactions on Computers
Multiple Fault Testing of Large Circuits by Single Fault Test Sets
IEEE Transactions on Computers
IEEE Transactions on Computers
IEEE Transactions on Computers
Condensed Linear Feedback Shift Register (LFSR) Testing A Pseudoexhaustive Test Technique
IEEE Transactions on Computers - The MIT Press scientific computation series
Linear Dependencies in Linear Feedback Shift Registers
IEEE Transactions on Computers
Built in self testing for detection of coupling faults in semiconductor memories
MTDT '96 Proceedings of the 1996 IEEE International Workshop on Memory Technology, Design and Testing (MTDT '96)
Covering Arrays Avoiding Forbidden Edges
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Merging covering arrays and compressing multiple sequence alignments
Discrete Applied Mathematics
Binary Covering Arrays and Existentially Closed Graphs
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Algorithms to locate errors using covering arrays
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Advances in Software Engineering - Special issue on software test automation
Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms
SIAM Journal on Discrete Mathematics
Constraint-Based approaches to the covering test problem
CSCLP'04 Proceedings of the 2004 joint ERCIM/CoLOGNET international conference on Recent Advances in Constraints
Randomized post-optimization of covering arrays
European Journal of Combinatorics
Automation and Remote Control
| Hi-index | 0.01 |
Exhaustive pattern logic testing schemes provide all possible input patterns with respect to an output in the set of test patterns. This paper is concerned with the problem that arises when this is to be done simultaneously with respect to a number of outputs, using a single test set. More specifically, in this paper we describe an iterative procedure for generating a test set consisting of n- dimensional vectors which exhaustively covers all k-subspaces simultaneously, i.e., the projections of n-dimensional vectors in the test set onto any input subset of a specified size k contain all possible patterns of k-tuples. For any given k, we first find an appropriate N (N k) and generate an efficient N-dimensional test set for exhaustive coverage of all k-subspaces. We next develop a constructive procedure to expand the corresponding test matrix (formed by taking test vectors as its rows) such that a test set of N2-dimensional vectors exhaustively covering the same k-subspaces is obtained. This procedure may be repeated to cover arbitrarily large n (n = N2i after i iterations), while keeping the same k. It is shown that the size of the test set obtained this way grows in size which becomes proportional to (log n) raised to the power of [log (q + 1)], where q is a function of k only, and is approximated (bounded closely below) by k2/4 in binary cases. This approach applies to nonbinary cases as well except that the value of q in an r-ary case is approximated by a number lying between k2/4 and k2/2.