메뉴 건너뛰기




Volumn 16, Issue 1-2, 2000, Pages 107-120

Automatic vector generation using constraints and biasing

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER SIMULATION; CONSTRAINT THEORY; DECISION THEORY; DESIGN FOR TESTABILITY; FUNCTION EVALUATION; PROBABILITY; VECTORS;

EID: 0034140360     PISSN: 09238174     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1008301108750     Document Type: Article
Times cited : (4)

References (22)
  • 8
    • 0002755438 scopus 로고    scopus 로고
    • Integrating Model Checking into the Semiconductor Design Flow
    • March
    • C. Pixley, "Integrating Model Checking Into the Semiconductor Design Flow," Computer Design's Electronic Systems Journal, pp. 67-74, March 1999.
    • (1999) Computer Design's Electronic Systems Journal , pp. 67-74
    • Pixley, C.1
  • 10
    • 0022769976 scopus 로고
    • Graph-based Algorithms for Boolean Function Manipulation
    • Aug.
    • R. Bryant, "Graph-based Algorithms for Boolean Function Manipulation," IEEE Transactions on Computers, Vol. C-35, pp. 677-691, Aug. 1986.
    • (1986) IEEE Transactions on Computers , vol.C-35 , pp. 677-691
    • Bryant, R.1
  • 14
    • 0001314320 scopus 로고
    • Verification of the IBM RISC System/6000 by a Dynamic Biased Pseudo-random Test Program Generator
    • July
    • A. Aharon, A. Bar-David, B. Dorfman, E. Gofman, M. Leibowitz, and V. Schwartzburd, "Verification of the IBM RISC System/6000 by a Dynamic Biased Pseudo-random Test Program Generator," IBM Systems Journal, Vol. 30, No. 4, pp. 527-538, July 1991.
    • (1991) IBM Systems Journal , vol.30 , Issue.4 , pp. 527-538
    • Aharon, A.1    Bar-David, A.2    Dorfman, B.3    Gofman, E.4    Leibowitz, M.5    Schwartzburd, V.6
  • 15
    • 0001644351 scopus 로고
    • Constraint Solving for Test Case Generation - A Technique for High Level Design Verification
    • A.K. Chandra and VS. Iyengar, "Constraint Solving for Test Case Generation - A Technique for High Level Design Verification," Proc. Intl. Conf. on Computer Design, 1992, pp. 245-248.
    • (1992) Proc. Intl. Conf. on Computer Design , pp. 245-248
    • Chandra, A.K.1    Iyengar, V.S.2
  • 19
    • 0002962651 scopus 로고
    • Equivalence of Free Boolean Graphs Can Be Decided Probabilistically in Polynomial Time
    • M. Blum, A.K. Chandra, and M.N. Wegman, "Equivalence of Free Boolean Graphs Can Be Decided Probabilistically in Polynomial Time," Information Processing Letters, Vol. 10, No. 2, pp. 80-82, 1980.
    • (1980) Information Processing Letters , vol.10 , Issue.2 , pp. 80-82
    • Blum, M.1    Chandra, A.K.2    Wegman, M.N.3


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