메뉴 건너뛰기




Volumn , Issue , 2002, Pages 974-982

Finding a small set of longest testable paths that cover every gate

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL CIRCUITS; ELECTRIC NETWORK TOPOLOGY; GRAPH THEORY; HEURISTIC METHODS; LOGIC GATES; SEQUENTIAL CIRCUITS;

EID: 0036443068     PISSN: 10893539     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (63)

References (19)
  • 7
    • 0028734911 scopus 로고
    • Resist: A recursive test pattern generation algorithm for path delay faults considering various test classes
    • Dec.
    • K. Fuchs, M. Pabst, and T. Rossel, "Resist: A recursive test pattern generation algorithm for path delay faults considering various test classes", IEEE Transactions on Computer-Aided Design of Integrated Circuits & Systems, vol. 13, pp. 1550-1562, Dec. 1994.
    • (1994) IEEE Transactions on Computer-Aided Design of Integrated Circuits & Systems , vol.13 , pp. 1550-1562
    • Fuchs, K.1    Pabst, M.2    Rossel, T.3
  • 12
    • 0028481803 scopus 로고
    • An incremental algorithm for identification of longest (shortest) paths
    • S. Kundu, "An incremental algorithm for identification of longest (shortest) paths", Integration, the VLSI Journal, vol. 17, pp. 25-31, 1994.
    • (1994) Integration, the VLSI Journal , vol.17 , pp. 25-31
    • Kundu, S.1
  • 16
    • 0033322163 scopus 로고    scopus 로고
    • New techniques for deterministic test pattern generation
    • Aug.-Oct.
    • I. Hamzaoglu, and J. H. Patel, "New techniques for deterministic test pattern generation", Journal of Electronic Testing: Theory & Applications, vol. 15, no. 1-2, pp. 63-73, Aug.-Oct. 1999.
    • (1999) Journal of Electronic Testing: Theory & Applications , vol.15 , Issue.1-2 , pp. 63-73
    • Hamzaoglu, I.1    Patel, J.H.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.