메뉴 건너뛰기




Volumn 17, Issue , 2004, Pages 784-787

Enhancing SAT-based bounded model checking using sequential logic implications

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED MODEL CHECKING (BMC); CIRCUIT UNDER VERIFICATION (CUV); MONITOR CIRCUITS; STATIC LOGIC IMPLICATIONS;

EID: 2342655036     PISSN: 10639667     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (14)

References (17)
  • 2
    • 0032680865 scopus 로고    scopus 로고
    • GRASP: A search algorithm for prepositional satisfiability
    • May
    • J.P. Marques-Silva and K.A. Sakallah, "GRASP: A Search Algorithm for Prepositional Satisfiability", In IEEE Trans. Computers, vol. 48, May 1999, pp. 506-521.
    • (1999) IEEE Trans. Computers , vol.48 , pp. 506-521
    • Marques-Silva, J.P.1    Sakallah, K.A.2
  • 3
    • 84937410369 scopus 로고    scopus 로고
    • SATO, "an efficient propositional prover"
    • LNAI, July
    • H. Zhang. SATO, "An Efficient Propositional Prover", In Proc. of Intl Conf. Automated Deduction, vol. 1249, LNAI, July 1997, pp. 272-275.
    • (1997) Proc. of Intl Conf. Automated Deduction , vol.1249 , pp. 272-275
    • Zhang, H.1
  • 4
    • 84893808653 scopus 로고    scopus 로고
    • Berkmin: A fast and robust SAT solver
    • E. Goldberg, Ya. Novikov, "Berkmin: A Fast and Robust SAT solver", In Proc. DATE, 2002, pp. 142-149.
    • (2002) Proc. DATE , pp. 142-149
    • Goldberg, E.1    Novikov, Ya.2
  • 7
    • 0032630134 scopus 로고    scopus 로고
    • Symbolic model checking using SAT procedures instead of BDDs
    • June
    • A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu, "Symbolic Model Checking using SAT procedures instead of BDDs", In Proc. DAC, June 1999, pp. 317-320.
    • (1999) Proc. DAC , pp. 317-320
    • Biere, A.1    Cimatti, A.2    Clarke, E.M.3    Fujita, M.4    Zhu, Y.5
  • 8
    • 0042635589 scopus 로고    scopus 로고
    • Learning from BDDs in SAT-based bounded model checking
    • A. Gupta, M. Ganai, C. Wang, Z. Yang, P. Ashar, "Learning from BDDs in SAT-based Bounded Model Checking", In Proc. DAC, 2003, pp. 824-829.
    • (2003) Proc. DAC , pp. 824-829
    • Gupta, A.1    Ganai, M.2    Wang, C.3    Yang, Z.4    Ashar, P.5
  • 9
    • 0030686639 scopus 로고    scopus 로고
    • Static logic implication with application to fast redundancy identification
    • J. Zhao, M. Rudnick, J. H. Patel, "Static Logic Implication with application to fast redundancy identification", In Proc. VLSI Test Syposium, 1997, pp. 288-293.
    • (1997) Proc. VLSI Test Syposium , pp. 288-293
    • Zhao, J.1    Rudnick, M.2    Patel, J.H.3
  • 10
    • 0035016402 scopus 로고    scopus 로고
    • A graph traversal based framework for sequential logic implication with an application to C-cycle redundancy identification
    • J. Zhao, J. A. Newquist and J. H. Patel, "A Graph Traversal Based Framework for Sequential Logic Implication With an Application to C-Cycle Redundancy Identification", In Proc. VLSI Design Conf, 2001, pp. 163-169.
    • (2001) Proc. VLSI Design Conf , pp. 163-169
    • Zhao, J.1    Newquist, J.A.2    Patel, J.H.3
  • 11
    • 84893802558 scopus 로고    scopus 로고
    • Improving SAT-based bounded model checking by means of bdd-based approximated traversals
    • G. Cabodi, S. Nocco and S. Quer, "Improving SAT-based Bounded Model Checking by Means of BDD-based Approximated Traversals", In Proc. DATE., 2003, pp. 898-903.
    • (2003) Proc. DATE , pp. 898-903
    • Cabodi, G.1    Nocco, S.2    Quer, S.3
  • 12
    • 2342610523 scopus 로고    scopus 로고
    • Formal verification using bounded model checking: SAT versus sequential ATPG engines
    • D. G. Saab, J. A. Abraham and V. M. Vedula, "Formal Verification Using Bounded Model Checking: SAT versus Sequential ATPG Engines", In Proc. VLSI Design Conf., 2003, pp. 243-248.
    • (2003) Proc. VLSI Design Conf. , pp. 243-248
    • Saab, D.G.1    Abraham, J.A.2    Vedula, V.M.3
  • 13
    • 0036058529 scopus 로고    scopus 로고
    • Can BDDs compete with SAT solvers on bounded model checking?
    • June
    • G. Cabodi, P. Camurati and S. Quer, "Can BDDs compete with SAT solvers on Bounded Model Checking?", In Proc. DAC, June 2002, pp. 117-122.
    • (2002) Proc. DAC , pp. 117-122
    • Cabodi, G.1    Camurati, P.2    Quer, S.3
  • 14
    • 84957068589 scopus 로고    scopus 로고
    • Model checking based on sequential ATPG
    • Lecture Notes in Computer Science, Springer
    • V. Boppana, S. P. Rajan, K. Takayama, M. Fujita, "Model Checking Based On Sequential ATPG", In Proc. of Computer Aided Verification, Lecture Notes in Computer Science, 1633 Springer 1999, pp. 418-430.
    • (1999) Proc. of Computer Aided Verification , vol.1633 , pp. 418-430
    • Boppana, V.1    Rajan, S.P.2    Takayama, K.3    Fujita, M.4
  • 15
    • 0022706656 scopus 로고
    • Automatic verification of finite-state concurrent systems using temporal logic specifications
    • E. M. Clarke, E. A. Emerson, and A. P. Sistla. "Automatic verification of finite-state concurrent systems using temporal logic specifications", In ACM Trans. Programming Languages and Systems, 1986, pp. 244-263.
    • (1986) ACM Trans. Programming Languages and Systems , pp. 244-263
    • Clarke, E.M.1    Emerson, E.A.2    Sistla, A.P.3
  • 17
    • 0036048611 scopus 로고    scopus 로고
    • Effective property checking using simulation-based sequential ATPG
    • S. Sheng, K. Takayama, M. S. Hsiao, "Effective Property Checking Using Simulation-based Sequential ATPG", In Proc. DAC, 2002, pp. 813-818.
    • (2002) Proc. DAC , pp. 813-818
    • Sheng, S.1    Takayama, K.2    Hsiao, M.S.3


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