메뉴 건너뛰기




Volumn , Issue , 2006, Pages 25-

Efficiency of multi-valued encoding in SAT-based ATPG

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATIC TESTING; DIGITAL CIRCUITS; FORMAL LOGIC; MATHEMATICAL MODELS; PROBLEM SOLVING;

EID: 33751052525     PISSN: 0195623X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISMVL.2006.39     Document Type: Conference Paper
Times cited : (16)

References (17)
  • 1
    • 24644465658 scopus 로고    scopus 로고
    • Mapping many-valued CNF formulas to Boolean CNF formulas
    • C. Ansòtegui and F. Manyà. Mapping many-valued CNF formulas to Boolean CNF formulas. In Int'l Symp. on Multi-Valued Logic, pages 290-295, 2005.
    • (2005) Int'l Symp. on Multi-valued Logic , pp. 290-295
    • Ansòtegui, C.1    Manyà, F.2
  • 2
    • 0027832523 scopus 로고
    • Verification of large synthesized designs
    • D. Brand. Verification of large synthesized designs. In Int'l Conf. on CAD, pages 534-537, 1993.
    • (1993) Int'l Conf. on CAD , pp. 534-537
    • Brand, D.1
  • 4
  • 5
    • 30344450270 scopus 로고    scopus 로고
    • An extensible SAT solver
    • SAT 2003
    • 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
  • 6
    • 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
  • 7
    • 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 Comp., 30:215-222, 1981.
    • (1981) IEEE Trans. on Comp. , vol.30 , pp. 215-222
    • Goel, P.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
    • 0030402207 scopus 로고    scopus 로고
    • GRASP - A new search algorithm for satisfiability
    • J. Marques-Silva and K. Sakallah. GRASP - a new search algorithm for satisfiability. In Int'l Conf. on CAD, pages 220-227, 1996.
    • (1996) Int'l Conf. on CAD , pp. 220-227
    • Marques-Silva, J.1    Sakallah, K.2
  • 12
    • 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., 10:278-281, 1966.
    • (1966) IBM J. Res. Dev. , vol.10 , pp. 278-281
    • Roth, J.1
  • 15
    • 33751053759 scopus 로고    scopus 로고
    • Experimental studies on SAT-based test pattern generation for industrial circuits
    • J. Shi, G. Fey, R. Drechsler, A. Glowatz, J. Schlöffel, and F. Hapke. Experimental studies on SAT-based test pattern generation for industrial circuits. In ASICON, pages 967-970, 2005.
    • (2005) ASICON , pp. 967-970
    • Shi, J.1    Fey, G.2    Drechsler, R.3    Glowatz, A.4    Schlöffel, J.5    Hapke, F.6
  • 17
    • 0034250207 scopus 로고    scopus 로고
    • Igraine - An implication graph based engine for fast implication, justification, and propagation
    • P. Tafertshofer, A. Ganz, and K. Antreich. Igraine - an implication graph based engine for fast implication, justification, and propagation. IEEE Trans. on CAD, 19(8):907-927, 2000.
    • (2000) IEEE Trans. on CAD , vol.19 , Issue.8 , pp. 907-927
    • Tafertshofer, P.1    Ganz, A.2    Antreich, K.3


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