메뉴 건너뛰기




Volumn , Issue , 2007, Pages 69-74

Reusing learned information in SAT-based ATPG

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; INTEGRATED CIRCUITS; LEARNING ALGORITHMS; NETWORKS (CIRCUITS);

EID: 34548850252     PISSN: 10639667     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/VLSID.2007.137     Document Type: Conference Paper
Times cited : (11)

References (18)
  • 1
    • 33646903261 scopus 로고    scopus 로고
    • Integration of learning techniques into incremental satisfiability for efficient pathdelay fault test generation
    • K. Chandrasekar and M. S. Hsiao. Integration of learning techniques into incremental satisfiability for efficient pathdelay fault test generation. In Design, Automation and Test in Europe, pages 1002-1007, 2005.
    • (2005) Design, Automation and Test in Europe , pp. 1002-1007
    • Chandrasekar, K.1    Hsiao, M.S.2
  • 2
  • 3
    • 33745959970 scopus 로고    scopus 로고
    • Automatic test pattern generation
    • Formal Methods for Hardware Verification
    • R. Drechsler and G. Fey. Automatic test pattern generation. In Formal Methods for Hardware Verification, LNCS, pages 30-55, 2006.
    • (2006) LNCS , pp. 30-55
    • Drechsler, R.1    Fey, G.2
  • 4
    • 30344450270 scopus 로고    scopus 로고
    • An extensible SAT solver
    • SAT 2003, of
    • N. Eén and N. Sörensson. An extensible SAT solver. In SAT 2003, volume 2919 of LNCS, pages 502-518, 2004.
    • (2004) LNCS , vol.2919 , pp. 502-518
    • Eén, N.1    Sörensson, N.2
  • 5
    • 0020923381 scopus 로고
    • On the acceleration of test generation algorithms
    • H. Fujiwara and T. Shimono. On the acceleration of test generation algorithms. IEEE Trans. on Comp., 32:1137-1144, 1983.
    • (1983) IEEE Trans. on Comp , vol.32 , pp. 1137-1144
    • Fujiwara, H.1    Shimono, T.2
  • 6
    • 0019543877 scopus 로고
    • An implicit enumeration algorithm to generate tests for combinational logic
    • P. Goel. An implicit enumeration algorithm to generate tests for combinational logic. IEEE Trans. on Comp., 30:215-222, 1981.
    • (1981) IEEE Trans. on Comp , vol.30 , pp. 215-222
    • Goel, P.1
  • 7
    • 33646420863 scopus 로고    scopus 로고
    • Acceleration of SAT-based iterative property checking
    • CHARME, of, Springer
    • D. Große and R. Drechsler. Acceleration of SAT-based iterative property checking. In CHARME, volume 3725 of LNCS, pages 349-353. Springer, 2005.
    • (2005) LNCS , vol.3725 , pp. 349-353
    • Große, D.1    Drechsler, R.2
  • 8
    • 0027839536 scopus 로고
    • HANNIBAL: An efficient tool for logic verification based on recursive learning
    • W. Kunz. HANNIBAL: An efficient tool for logic verification based on recursive learning. In Int'l Conf. on CAD, pages 538-543, 1993.
    • (1993) Int'l Conf. on CAD , pp. 538-543
    • Kunz, W.1
  • 9
    • 0026623575 scopus 로고
    • Test pattern generation using Boolean satisfiability
    • T. Larrabee. Test pattern generation using Boolean satisfiability. IEEE Trans. on CAD, 11:4-15, 1992.
    • (1992) IEEE Trans. on CAD , vol.11 , pp. 4-15
    • Larrabee, T.1
  • 10
    • 0032680865 scopus 로고    scopus 로고
    • GRASP: A search algorithm for propositional satisfiability
    • J. Marques-Silva and K. Sakallah. GRASP: A search algorithm for propositional satisfiability. IEEE Trans, on Comp., 48(5):506-521, 1999.
    • (1999) IEEE Trans, on Comp , vol.48 , Issue.5 , pp. 506-521
    • Marques-Silva, J.1    Sakallah, K.2
  • 12
    • 0023558527 scopus 로고
    • SOCRATES: A highly efficient automatic test pattern generation system
    • M. Schulz, E. Trischler, and T. Sarfert. SOCRATES: A highly efficient automatic test pattern generation system. In Int'l Test Conf., pages 1016-1026, 1987.
    • (1987) Int'l Test Conf , pp. 1016-1026
    • Schulz, M.1    Trischler, E.2    Sarfert, T.3
  • 14
  • 15
    • 84947269280 scopus 로고    scopus 로고
    • Pruning techniques for the SAT-based bounded model checking problem
    • CHARME, of
    • O. Shtrichman. Pruning techniques for the SAT-based bounded model checking problem. In CHARME, volume 2144 of LNCS, pages 58-70, 2001.
    • (2001) LNCS , vol.2144 , pp. 58-70
    • Shtrichman, O.1
  • 18


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