메뉴 건너뛰기




Volumn 2, Issue , 2005, Pages 967-970

Experimental studies on SAT-based test pattern generation for industrial circuits

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; HEURISTIC METHODS; INTEGRATED CIRCUIT MANUFACTURE; PROBLEM SOLVING;

EID: 33751053759     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (11)
  • 1
    • 84919401135 scopus 로고
    • A machine program for theorem proving
    • M. Davis, G. Logeman, D. Loveland: A machine program for theorem proving, Comm. of the ACM, Vol. 5, No. 7, pp. 394-397, 1962.
    • (1962) Comm. of the ACM , vol.5 , Issue.7 , pp. 394-397
    • Davis, M.1    Logeman, G.2    Loveland, D.3
  • 2
    • 30344450270 scopus 로고    scopus 로고
    • An extensible SAT solver
    • Proc. of SAT
    • N. Eén, N. Sörensson: An extensible SAT solver. In. Proc. of SAT 2003, LNCS, Vol. 2919, pp. 502-518, 2004.
    • (2003) LNCS , vol.2919 , pp. 502-518
    • Eén, N.1    Sörensson, N.2
  • 3
    • 0020923381 scopus 로고
    • On the acceleration of test generation algorithms
    • H. Fujiwara and T. Shimono. On the acceleration of test generation algorithms. IEEE Trans, on Computers, Vol. 32, No. 12, pp. 1137-1144, 1983.
    • (1983) IEEE Trans, on Computers , vol.32 , Issue.12 , pp. 1137-1144
    • Fujiwara, H.1    Shimono, T.2
  • 4
    • 84893808653 scopus 로고    scopus 로고
    • BerkMin: A fast and robust SAT solver
    • E.Goldberg, Y.Novikov: BerkMin: A fast and robust SAT solver. In Proc. of DATE, pp. 142-149, 2002.
    • (2002) Proc. of DATE , pp. 142-149
    • Goldberg, E.1    Novikov, Y.2
  • 5
    • 0019543877 scopus 로고
    • An implicit enumeration algorithm to generate test for combinational logic
    • P. Goel. An implicit enumeration algorithm to generate test for combinational logic. IEEE Trans, on Computers, Vol. 30, No. 3, pp. 215-222, 1981.
    • (1981) IEEE Trans, on Computers , vol.30 , Issue.3 , pp. 215-222
    • Goel, P.1
  • 6
    • 33847335149 scopus 로고    scopus 로고
    • Appendix summarizing results of walksat on challenge instances
    • ed, AMS
    • D. S. Johnson, M. A. Trick, ed.: Appendix summarizing results of walksat on challenge instances, in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 26, AMS, 1996.
    • (1996) DIMACS Series in Discrete Mathematics and Theoretical Computer Science , vol.26
  • 8
    • 0032680865 scopus 로고    scopus 로고
    • GRASP: A search algorithm for prepositional satisfiability
    • J. P. Marques-Silva, K. A. Sakallah : GRASP: A search algorithm for prepositional satisfiability. In IEEE Trans, on Computers, Vol. 48, No. 5, pp. 506-521, 1999.
    • (1999) IEEE Trans, on Computers , vol.48 , Issue.5 , pp. 506-521
    • Marques-Silva, J.P.1    Sakallah, K.A.2
  • 9
    • 0001413253 scopus 로고
    • Diagnosis of automata failures: A calculus and a method
    • J. Roth. Diagnosis of automata failures: A calculus and a method. IBM J. Res. Dev., Vol. 10, pp. 278-281, 1966.
    • (1966) IBM J. Res. Dev , vol.10 , pp. 278-281
    • Roth, J.1
  • 10
    • 0030247603 scopus 로고    scopus 로고
    • Combinational test generation using satisfiability
    • P. Stephan, R. Brayton, and A. Sangiovanni-Vincentelli. Combinational test generation using satisfiability. IEEE Trans. on CAD, Vol. 15, No. 9, pp. 1167-1176, 1996.
    • (1996) IEEE Trans. on CAD , vol.15 , Issue.9 , pp. 1167-1176
    • Stephan, P.1    Brayton, R.2    Sangiovanni-Vincentelli, A.3


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