메뉴 건너뛰기




Volumn , Issue , 2010, Pages 490-495

Efficient decision ordering techniques for SAT-based test generation

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED GENERATION; COMPLEX DESIGNS; CONVENTIONAL MODELS; CURRENT TEST; MODEL-CHECKING TECHNIQUES; RESOURCE REQUIREMENTS; TEST GENERATIONS; VARIABLE ORDERING HEURISTICS;

EID: 77953101934     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (17)

References (14)
  • 2
    • 77953104564 scopus 로고    scopus 로고
    • zChaff
    • http://www.princeton.edu/ chaff/zchaff.html. zChaff.
  • 4
    • 33646392976 scopus 로고    scopus 로고
    • An analysis of SAT-based model checking techniques in an industrial environment
    • N. Amla et al. An analysis of SAT-based model checking techniques in an industrial environment. CHARME, 254-268, 2005.
    • (2005) CHARME , pp. 254-268
    • Amla, N.1
  • 5
    • 0034852165 scopus 로고    scopus 로고
    • Chaff: Engineering an efficient SAT solver
    • M. Moskewicz et al. Chaff: Engineering an efficient SAT solver. DAC, pages 530-535, 2001.
    • (2001) DAC , pp. 530-535
    • Moskewicz, M.1
  • 6
    • 14644437089 scopus 로고    scopus 로고
    • An incremental algorithm to check satisfiability for bounded model checking
    • H. Jin and F. Somenzi. An incremental algorithm to check satisfiability for bounded model checking. BMC, 51-65, 2004.
    • (2004) BMC , pp. 51-65
    • Jin, H.1    Somenzi, F.2
  • 7
    • 84947269280 scopus 로고    scopus 로고
    • Pruning techniques for the sat-based bounded model checking problem
    • O. Strichman. Pruning techniques for the sat-based bounded model checking problem. CHARME, 58-70, 2001.
    • (2001) CHARME , pp. 58-70
    • Strichman, O.1
  • 8
    • 63149189291 scopus 로고    scopus 로고
    • Efficient techniques for directed test generation using incremental satisfiability
    • P. Mishra and M. Chen. Efficient techniques for directed test generation using incremental satisfiability. In Proceedings of International Conference of VLSI Design, 65-70, 2009.
    • (2009) Proceedings of International Conference of VLSI Design , pp. 65-70
    • Mishra, P.1    Chen, M.2
  • 10
    • 84944402340 scopus 로고    scopus 로고
    • Tuning SAT checkers for bounded model checking
    • O. Shtrichman. Tuning SAT checkers for bounded model checking. CAV, 480-494, 2000.
    • (2000) CAV , pp. 480-494
    • Shtrichman, O.1
  • 11
    • 4444266801 scopus 로고    scopus 로고
    • Refining the SAT decision ordering for bounded model checking
    • C. Wang et al. Refining the SAT decision ordering for bounded model checking. DAC, 535-538, 2004.
    • (2004) DAC , pp. 535-538
    • Wang, C.1
  • 12
    • 84919401135 scopus 로고
    • A machine program for theorem proving
    • M. Davis et al. A machine program for theorem proving. Communication of the ACM, 5:394-397, 1962.
    • (1962) Communication of the ACM , vol.5 , pp. 394-397
    • Davis, M.1
  • 14
    • 77953116296 scopus 로고    scopus 로고
    • http://nusmv.irst.itc.it/. NuSMV.


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