메뉴 건너뛰기




Volumn 3312, Issue , 2004, Pages 174-185

Simple yet efficient improvements of SAT based bounded model checking

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; FORMAL METHODS;

EID: 26444495758     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30494-4_13     Document Type: Article
Times cited : (8)

References (26)
  • 9
    • 0023362541 scopus 로고
    • Modalities for Model Checking: Branching Time Strikes Back
    • E. Emerson and C. Lei. Modalities for Model Checking: Branching Time Strikes Back. In Science of Computer Programming, 8:275-306, 1986.
    • (1986) Science of Computer Programming , vol.8 , pp. 275-306
    • Emerson, E.1    Lei, C.2
  • 12
    • 0034852165 scopus 로고    scopus 로고
    • Chaff: Engineering an Efficient SAT Solver. in 38th
    • ACM/IEEE
    • M. Moskewicz et al. Chaff: Engineering an Efficient SAT Solver. In 38th Design Automation Conference, page 530-535. ACM/IEEE, 2001.
    • (2001) Design Automation Conference , pp. 530-535
    • Moskewicz, M.1
  • 14
    • 49149133038 scopus 로고
    • A Temporal Logic of Concurrent Programs
    • A. Pnueli. A Temporal Logic of Concurrent Programs. In Theoretical Computer Science, Vol 13, pp 45-60, 1981.
    • (1981) Theoretical Computer Science , vol.13 , pp. 45-60
    • Pnueli, A.1
  • 17
    • 84944402340 scopus 로고    scopus 로고
    • Tuning SAT Checkers for Bounded Model Checking
    • Lecture Notes in Computer Science, 1855. Springer-Verlag
    • O. Strichman. Tuning SAT Checkers for Bounded Model Checking. In Computer-Aided Verification: 12th International Conference, Lecture Notes in Computer Science, 1855. Springer-Verlag, 2000.
    • (2000) Computer-Aided Verification: 12th International Conference
    • Strichman, O.1
  • 18
    • 84958782734 scopus 로고    scopus 로고
    • A Performance Study of BDD-Bases Model Checking
    • Lecture Notes in Computer Science, 1522. Springer-Verlag
    • B. Yang et al. A Performance Study of BDD-Bases Model Checking. In Formal Methods in Computer-Aided Design: 2nd International Conference, Lecture Notes in Computer Science, 1522. Springer-Verlag, 1998.
    • (1998) Formal Methods in Computer-Aided Design: 2nd International Conference
    • Yang, B.1
  • 20
    • 84862475150 scopus 로고
    • Berkley Logic Interechange Format (BLIP). University of California, Berkley
    • Berkley Logic Interechange Format (BLIP). University of California, Berkley, 1992. http://www-cad.eecs.berkeley.edu/Respep/Research/vis/usrDoc.html
    • (1992)
  • 21
    • 84862482911 scopus 로고    scopus 로고
    • IBM Formal Verification Benchmark Library.
    • IBM Formal Verification Benchmark Library. http://www.haifa.il.ibm.com/ projects/verification/RB_Homepage/ fvbenchmarks.html
  • 22
    • 84862486152 scopus 로고    scopus 로고
    • CNF Benchmarks from IBM Formal Verification Benchmarks Library.
    • CNF Benchmarks from IBM Formal Verification Benchmarks Library. http://www.haifa.il.ibm.com/projects/verification/RB_Homepage/ bmcbenchmarks.html
  • 23
    • 84862486153 scopus 로고    scopus 로고
    • IBM CNF Benchmark Illustration.
    • IBM CNF Benchmark Illustration. http://www.haifa.il.ibm.com/projects/ verification/RB_Hornepage/ bmcbenchmarks_illustrations.html
  • 25
    • 84862482902 scopus 로고    scopus 로고
    • RuleBase University Program.
    • RuleBase University Program. http://www.haifa.il.ibm.com/projects/ verification/Formal_Methods-Home/university.html
  • 26
    • 84862475151 scopus 로고    scopus 로고
    • SAT2004 contest.
    • SAT2004 contest. http://satlive.org/SATCompetition/2004/
    • (2004)


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