메뉴 건너뛰기




Volumn 1, Issue , 2004, Pages 156-161

Using counter example guided abstraction refinement to find complex bugs

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTION REFINEMENT; BOUNDED MODEL CHECKING (BMC); TRAVERSE STATES; BOUNDED MODEL CHECKING; COUNTER EXAMPLES; FAILURE TRACES; SAFETY PROPERTY; TRADITIONAL APPROACHES;

EID: 3042565500     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2004.1268842     Document Type: Conference Paper
Times cited : (31)

References (13)
  • 2
    • 84893802558 scopus 로고    scopus 로고
    • Improving SAT-based bounded model checking by means of BDD-based approximate traversals
    • G. Cabodi, S. Nocco, and S. Quer. Improving SAT-based bounded model checking by means of BDD-based approximate traversals. In DATE, 2003.
    • (2003) DATE
    • Cabodi, G.1    Nocco, S.2    Quer, S.3
  • 3
    • 0344840440 scopus 로고    scopus 로고
    • Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis
    • P. Chauhan, E. Clarke, J. Kukula, S. Sapra, H. Veith, and D. Wang. Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis. In FMCAD '02, 2002.
    • (2002) FMCAD '02
    • Chauhan, P.1    Clarke, E.2    Kukula, J.3    Sapra, S.4    Veith, H.5    Wang, D.6
  • 7
    • 84893746482 scopus 로고    scopus 로고
    • Verification of proofs of unsatisfiability for CNF formulas
    • E. Goldberg and Y. Novikov. Verification of proofs of unsatisfiability for CNF formulas. In DATE, 2003.
    • (2003) DATE
    • Goldberg, E.1    Novikov, Y.2
  • 8
    • 78650907750 scopus 로고    scopus 로고
    • Abstraction and BDDs complement SAT-based BMC in DiVer
    • A. Gupta, C. Wang, M. Ganai, Z. Yang, and P. Ashar. Abstraction and BDDs complement SAT-based BMC in DiVer. In CAV '03, 2003.
    • (2003) CAV '03
    • Gupta, A.1    Wang, C.2    Ganai, M.3    Yang, Z.4    Ashar, P.5
  • 11
    • 0345438814 scopus 로고    scopus 로고
    • Tuning SAT checkers for bounded model-checking
    • O. Strichman. Tuning SAT checkers for bounded model-checking. In CAV '00, 2000.
    • (2000) CAV '00
    • Strichman, O.1
  • 12
    • 0034841972 scopus 로고    scopus 로고
    • Formal property verification by abstraction refinement with formal, simulation, and hybrid engines
    • D. Wang, P.-H. Ho, J. Long, J. Kukula, Y. Zhu, T. Ma, and R. Damiano. Formal property verification by abstraction refinement with formal, simulation, and hybrid engines. In DAC '01, 2001.
    • (2001) DAC '01
    • Wang, D.1    Ho, P.-H.2    Long, J.3    Kukula, J.4    Zhu, Y.5    Ma, T.6    Damiano, R.7
  • 13
    • 84893807812 scopus 로고    scopus 로고
    • Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications
    • L. Zhang and S. Malik. Validating SAT solvers using an independent resolution-based checker: Practical implementations and other applications. In DATE, 2003.
    • (2003) DATE
    • Zhang, L.1    Malik, S.2


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