skip to main content
10.1145/123186.123436acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
Article
Free access

The influences of fault type and topology on fault model performance and the implications to test and testable design

Published: 03 January 1991 Publication History

Abstract

A new method, Difference Propagation, is proposed to analyze fault models in combinational circuits. It propagates Boolean functional information represented by ordered binary decision diagrams. Results are presented concerning exact detectabilities and syndromes for a set of benchmark circuits. The data suggest answers to open questions in CAD and represent the first data of this type for bridging faults. The information is shown to affect testable design as well as test generation.

References

[1]
J. P. Shen, W. Maly and F. J. Ferguson, "Inductive fault analysis of MOS integrated circuits," IEEE Design and Test of Comput., vo}. 2, no. 6, pp. 13-26, Dec. 1985.
[2]
J. L. A. Hughes and E. J. McCluskey, "Multiple stuck-at fault coverage of single stuck-at fault test sets," in Proc. 1986 IEEE Int. Test Conf., Sept. 1986, pp. 368-374.
[3]
S. D. Millman and E. J. McCluskey, "Detecting bridging faults with stuck-at test sets," in Proc. 1988 IEEE Int. Test Conf., Sept. 1988, pp. 773- 783.
[4]
F. Brglez and H. Fujiwara, "A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN," in Proc. IEEE int. Syrup. on Circ. Syst. (ISCAS), June 1985, pp. 695-698.
[5]
R. D. Eldred, "Test routines based on symbolic logical statements," J. Assoc. Comput. Mach., vol. 6, no. 1, pp. 33-36, 1959.
[6]
D. C. Bossen arid S. J. Hong, "Cause-effect analysis for multiple fault detection in combinational networks," tEEE Trans. Compu$., vol. C-20, no. 11, pp. 1252-1257, Nov. 1971.
[7]
E. J. McCluskey and F. W. Clegg, "Fault equivalence in combinational logic networks," IEEE Trans. Cornput., vol. C-20, no. 11, pp. 1286-1293, July 1971.
[8]
J. Galiay, Y. Crouzet and M. Vergniault, "Physical versus logical fault models MOS LSI circuits: impact on their testability," IEEE Trans. Cornput., vol. C-29, no. 6, pp. 527-531, June 1980.
[9]
K. C. Y. Mei, "Bridging and stuck-at faults," IEEE Trans. Comput., vol. C-23, no. 7, pp. 720- 727, July 1974.
[10]
M. Abramovici and P. R. Menon, "A practical approach to fault simulation and test generation for bridging faults," in Proc. 1983 IEEE In~. Test Conf., Oct. 1983, pp. 138-142.
[11]
J. Savir, "Syndrome-testable design of combinational circuits," IEEE Trans. Comput., vol. C-29, no. 6, pp. 442-451, June 1980.
[12]
J. A. Waicukauski, E. B. Eichelberger, D. Forlenza, E. Lindbloom and T. McCarthy, "Fault simulation for structured VLSI design," VLSI Systems Design, vol. 6, no. 12, pp. 20--32, Dec. 1985.
[13]
R. K. Gaede, D. E. Ross, M. R. Mercer and K. M. Butler, "CATAPULT: Concurrent automatic testing allowing parallelization and using limited topology," in Proc. ACM-IEEE 25th Design Automation Conf., June 1988, pp. 597-600.
[14]
D. Stannard and B. Kaminska, "Detection of hard faults in a combinational circuit using budget constraints," in Proc. 1988 IEEE Int. Test Conf., Sept. 1988, p. 999.
[15]
R. E. Bryant, "Graph-based algorithms for boolean function manipulation," IEEE Trans. Comput., vol. C-35, no. 8, pp. 677-692, Aug. 1986.
[16]
K. Cho and R. E. Bryant, "Test pattern generation for sequential MOS circuits by symbolic fault, simulation," in Proc. ACM-IEEE 26th Design Automation Conf., June 1989, pp. 418-423.
[17]
S. B. Akers, "On a theory of Boolean functions," J. Soc. Indust. Appl. Math., vol. 7, no. 4, pp. 487- 498, Dec. 1959.
[18]
P.R. Menon, "A simulation program for logic networks," Bell Telephone Labs. Internal Technical Memorandum, No. MM65-1271-3, Mar. 1965.
[19]
V. D. Agrawal, S. C. Seth and C. C. Chuang, "Probabilistically guided test generation," in Proc. IEEE Int. Syrup. on Circ. Syst. (ISCAS), June 1985, pp. 687-690.
[20]
D. E. Ross, personal communication, Aug. 1989.
[21]
C-T. Hung, K. M. Butler and M. R. Mercer, unpublished manuscript, Apr. 1989.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
DAC '90: Proceedings of the 27th ACM/IEEE Design Automation Conference
January 1991
742 pages
ISBN:0897913639
DOI:10.1145/123186
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 January 1991

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

DAC90
Sponsor:
DAC90: The 27th ACM/IEEE-CS Design Automation Conference
June 24 - 27, 1990
Florida, Orlando, USA

Acceptance Rates

DAC '90 Paper Acceptance Rate 125 of 427 submissions, 29%;
Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25
62nd ACM/IEEE Design Automation Conference
June 22 - 26, 2025
San Francisco , CA , USA

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)22
  • Downloads (Last 6 weeks)3
Reflects downloads up to 03 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media