This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Translation of the Problem of Complete Test Set Generation to Pseudo-Boolean Programming
July 1991 (vol. 40 no. 7)
pp. 864-867

An attempt is made to demonstrate that the problem of complete test set generation is amenable to the problem of pseudo-Boolean programming. For this purpose, various types of faults, viz., single faults, multiple faults, and bridging faults, are considered. The key issue is to obtain logical expressions for the primary output line in terms of different faulty internal nodes to find real transforms. Using standard rules, the real transforms of a Boolean function can be obtained directly without any algebraic manipulation.

[1] S. G. Papaioannou, "Optimal test generation in combinational networks by pseudo-Boolean programming,"IEEE Trans. Comput., vol. C-26, pp. 553-560, June 1977.
[2] S. G. Papaioannou, "The real transform method in fault diagnosis," Ph.D. dissertation, Leigh Univ., Bethlehem, PA, 1975.
[3] D. B. Armstrong, "On finding a nearly minimal set of fault detection tests for combinational logic nets,"IEEE Trans. Electron. Comput., vol. EC-15, pp. 66-73, Feb. 1966.
[4] F. F. Sellers, M. Y. Hsiao, and L. W. Bearnson, "Analyzing errors with Boolean difference,"IEEE Trans. Comput., vol. C-17, pp. 676-683, July 1968.
[5] S. S. Yau and Y. S. Tang, "An efficient algorithm for generating complete test set for combinational logic circuits,"IEEE Trans. Comput., vol. C- 20, pp. 1245-1251, Nov, 1971.
[6] C. T. Ku and G. M. Masson, "The Boolean difference and multiple fault analysis,"IEEE Trans. Comput., vol. C-24, pp. 62-71, Jan. 1975.
[7] J. P. Roth, "Diagnosis of automata failures: A calculus and a method,"IBM J. Res. Develop., vol. 10, pp. 278-291, July 1966.
[8] S. B. Akers, "Fault diagnosis as a graph coloring problem,"IEEE Trans. Comput., vol. C-23, no. 7, pp. 706-712, July 1974.
[9] S. K. Basu, J. C. Paul, and P. R. Bhattacharjee, "Complete test set generation for bridging faults in combinational logic circuits,"Inform. Sci., vol. 38, no. 3, pp. 257-269, June 1986.
[10] P. Goel, "An implicit enumeration algorithm to generate tests for combinational logic circuits,"IEEE Trans. Comput., vol. C-30, no. 3, pp. 215-222, Mar. 1981.
[11] H. Fujiwara and T. Shimono, "On the acceleration of test generation algorithms,"IEEE Trans. Comput., vol. C-32, no. 12, pp. 1137-1144, Dec. 1983.
[12] E. I. Muehldorf and A. D. Savakar, "LSI logic testing--An overview,"IEEE Trans. Comput., vol. C-30, no. 1, pp. 1-17, Jan, 1981.
[13] P. Hammer and S. Rudeanu,Boolean Methods in Operation Research. New York: Springer-Verlag, 1968.
[14] P. Hansen, "Un algorithme S. E. P. pour les programmes pseudo-Booleans nonlineares," Cah. du Centre d'Etude de Rech., Operationelle, vol. 11, pp. 26-44, 1969.
[15] I. Berman, "A branch-and-bound method for the maximization of a pseudo-Boolean function," Tech. Rep., Faculty of Math., Univ. of Waterloo, Ont., Canada, 1969.
[16] P. Hammer and U. Peled, "On the maximization of a pseudo-Boolean function,"J. ACM, vol. 19, pp. 265-282, Apr. 1972.
[17] R. Bellman,Dynamic Programming. Princeton, NJ: Princeton University Press, 1957.

Index Terms:
complete test set generation; pseudo-Boolean programming; logical expressions; real transforms; Boolean function; Boolean functions; formal logic; logic programming; logic testing.
Citation:
P.R. Bhattacharjee, S.K. Basu, J.C. Paul, "Translation of the Problem of Complete Test Set Generation to Pseudo-Boolean Programming," IEEE Transactions on Computers, vol. 40, no. 7, pp. 864-867, July 1991, doi:10.1109/12.83624
Usage of this product signifies your acceptance of the Terms of Use.