메뉴 건너뛰기




Volumn 2102, Issue , 2001, Pages 373-377

BooSTER: Speeding up RTL property checking of digital designs by word-level abstraction

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER AIDED ANALYSIS; MODEL CHECKING;

EID: 84958777591     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44585-4_35     Document Type: Conference Paper
Times cited : (8)

References (11)
  • 1
    • 0032630134 scopus 로고    scopus 로고
    • Symbolic Model Checking Using SAT Procedures instead of BDDs
    • A. Biere, A. Cimatti, E.M. Clarke, M. Fujita, Y. Zhu. Symbolic Model Checking Using SAT Procedures instead of BDDs. DAC'99, pages 317-320. 1999.
    • (1999) DAC'99 , pp. 317-320
    • Biere, A.1    Cimatti, A.2    Clarke, E.M.3    Fujita, M.4    Zhu, Y.5
  • 2
    • 0031618668 scopus 로고    scopus 로고
    • A Decision Procedure for Bit-Vector Arithmetic
    • C.W. Barrett, D.L. Dill, J.R. Levitt. A Decision Procedure for Bit-Vector Arithmetic. DAC'98, pages 522-527. 1998.
    • (1998) DAC'98 , pp. 522-527
    • Barrett, C.W.1    Dill, D.L.2    Levitt, J.R.3
  • 3
    • 72949103106 scopus 로고    scopus 로고
    • Deciding Fixed and Non-fixed Size Bit-vectors
    • N. Bj0rner, M.C. Pichora. Deciding Fixed and Non-fixed Size Bit-vectors. TACAS'98, pages 376-392. 1998.
    • (1998) TACAS'98 , pp. 376-392
    • Bj0rner, N.1    Pichora, M.C.2
  • 4
    • 0033714214 scopus 로고    scopus 로고
    • Assertion checking by combined word-level ATPG and modular arithmetic constraint-solving techniques
    • C.Y. Huang, K.T. Cheng. Assertion checking by combined word-level ATPG and modular arithmetic constraint-solving techniques. DAC'00, pages 118-123. 2000.
    • (2000) DAC'00 , pp. 118-123
    • Huang, C.Y.1    Cheng, K.T.2
  • 5
    • 33748557565 scopus 로고    scopus 로고
    • An Efficient Decision Procedure for the Theory of Fixed-Sized Bit-Vectors
    • D. Cyrluk, M.O. Moller, H. Ruess. An Efficient Decision Procedure for the Theory of Fixed-Sized Bit-Vectors. CAV'97, pages 60-71. 1997.
    • (1997) CAV'97 , pp. 60-71
    • Cyrluk, D.1    Moller, M.O.2    Ruess, H.3
  • 6
    • 84957627890 scopus 로고    scopus 로고
    • A.J.Isles, D.Kirkpatrick,R.K.Brayton.Verification UsingUninter-preted Functions and Finite Instantiations
    • R. Hojati, A.J.Isles, D.Kirkpatrick,R.K.Brayton.Verification UsingUninter-preted Functions and Finite Instantiations. FMCAD'96, pages 218-232. 1996.
    • (1996) FMCAD'96 , pp. 218-232
    • Hojati, R.1
  • 8
    • 84958798525 scopus 로고    scopus 로고
    • Computing One-to-One Minimum-Width Abstractions of Digital Designs for RTL Property Checking
    • Siemens AG, CT-SE-4, submitted to ICCAD'01
    • P. Johannsen. Computing One-to-One Minimum-Width Abstractions of Digital Designs for RTL Property Checking. Intern. Report, Siemens AG, CT-SE-4, submitted to ICCAD'01.
    • Intern. Report
    • Johannsen, P.1
  • 9
    • 0033684697 scopus 로고    scopus 로고
    • Boolean satisfiability in electronic design automation
    • J.P. Marques da Silva, K.A. Sakallah. Boolean satisfiability in electronic design automation. DAC 00, pages 675-680. 2000.
    • (2000) DAC , pp. 675-680
    • Da Marques Silva, J.P.1    Sakallah, K.A.2
  • 10
    • 0002829723 scopus 로고    scopus 로고
    • Deciding Equality Formulas by Small Domains Instantiations
    • A. Pnueli, Y. Rodeh, O. Shtrichman, M. Siegel. Deciding Equality Formulas by Small Domains Instantiations. CAV 99, pages 455-469. 1999.
    • (1999) CAV , vol.99 , pp. 455-469
    • Pnueli, A.1    Rodeh, Y.2    Shtrichman, O.3    Siegel, M.4
  • 11
    • 84893652372 scopus 로고    scopus 로고
    • LPSAT: A Unified Approach to RTL Satisfiability
    • Z. Zeng, P. Kalla, M. Ciesielski. LPSAT: A Unified Approach to RTL Satisfiability. DATE'01. 2001.
    • (2001) DATE'01
    • Zeng, Z.1    Kalla, P.2    Ciesielski, M.3


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