메뉴 건너뛰기




Volumn , Issue , 2008, Pages 164-172

Efficient bit-level model reductions for automated hardware verification

Author keywords

[No Author keywords available]

Indexed keywords

DOMAIN-SPECIFIC; INTERNATIONAL SYMPOSIUM; TRANSITION SYSTEMS;

EID: 51549109385     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2008.11     Document Type: Conference Paper
Times cited : (5)

References (29)
  • 4
    • 84958772916 scopus 로고
    • Automatic verification of pipelined microprocessor control
    • London, UK, Springer
    • J. R. Burch and D. L. Dill. Automatic verification of pipelined microprocessor control. In CAV '94, pages 68-80, London, UK, 1994. Springer.
    • (1994) CAV '94 , pp. 68-80
    • Burch, J.R.1    Dill, D.L.2
  • 7
    • 33646404050 scopus 로고    scopus 로고
    • On the verification of memory management mechanisms
    • D. Borrione and W. Paul, editors, CHARME 2005, Springer
    • I. Dalinger, M. Hillebrand, and W. Paul. On the verification of memory management mechanisms. In D. Borrione and W. Paul, editors, CHARME 2005, LNCS, pages 301-316. Springer, 2005.
    • (2005) LNCS , pp. 301-316
    • Dalinger, I.1    Hillebrand, M.2    Paul, W.3
  • 10
    • 0030211668 scopus 로고    scopus 로고
    • Better verification through symmetry
    • 9(l-2):41-75
    • C. N. Ip and D. L. Dill. Better verification through symmetry. Fonn. Methods Syst. Des., 9(l-2):41-75, 1996.
    • (1996) Fonn. Methods Syst. Des
    • Ip, C.N.1    Dill, D.L.2
  • 11
    • 84937561625 scopus 로고    scopus 로고
    • Formal verification of complex out-of-order pipelines by combining model-checking and theorem-proving
    • Computer Aided, Verification CAV 02, of, Springer
    • C. Jacobi. Formal verification of complex out-of-order pipelines by combining model-checking and theorem-proving. In Computer Aided, Verification (CAV 02), volume 2404 of LNCS, pages 309-323. Springer, 2002.
    • (2002) LNCS , vol.2404 , pp. 309-323
    • Jacobi, C.1
  • 14
    • 84948178956 scopus 로고    scopus 로고
    • Modeling and verification of out-of-order microprocessors in UCLID
    • London, UK, Springer
    • S. K. Lahiri, S. A. Seshia, and R. E. Bryant. Modeling and verification of out-of-order microprocessors in UCLID. In FMCAD '02, pages 142-159, London, UK, 2002. Springer.
    • (2002) FMCAD '02 , pp. 142-159
    • Lahiri, S.K.1    Seshia, S.A.2    Bryant, R.E.3
  • 15
    • 29144435150 scopus 로고    scopus 로고
    • Polymorphic systems with arrays, 2-counter machines and multiset rewriting
    • R. Lazic, T. C. Newcomb, and B. Roscoe. Polymorphic systems with arrays, 2-counter machines and multiset rewriting. Electr. Notes Theor. Comput. Sci., 138(3):61-86, 2005.
    • (2005) Electr. Notes Theor. Comput. Sci , vol.138 , Issue.3 , pp. 61-86
    • Lazic, R.1    Newcomb, T.C.2    Roscoe, B.3
  • 16
    • 33846469976 scopus 로고    scopus 로고
    • A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures
    • 37(l-2):93-116
    • P. Manolios and S. K. Srinivasan. A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures. Journal of Automated Reasoning, 37(l-2):93-116, 2006.
    • (2006) Journal of Automated Reasoning
    • Manolios, P.1    Srinivasan, S.K.2
  • 18
    • 0004275127 scopus 로고    scopus 로고
    • The SMV language
    • Technical report, Berkeley Labs, 1999
    • K. L. McMillan. The SMV language. Technical report, Berkeley Labs, 1999.
    • McMillan, K.L.1
  • 21
    • 84944677742 scopus 로고
    • PVS: A prototype verification system
    • S. Owre, N. Shankar, and J. Rushby. PVS: A prototype verification system. In CADE'92, pages 748-752, 1992.
    • (1992) CADE'92 , pp. 748-752
    • Owre, S.1    Shankar, N.2    Rushby, J.3
  • 23
    • 0003267035 scopus 로고
    • Isabelle: A generic theorem prover
    • of, Springer, New York, NY, USA
    • L. C. Paulson. Isabelle: a generic theorem prover, volume 828 of LNCS. Springer, New York, NY, USA, 1994.
    • (1994) LNCS , vol.828
    • Paulson, L.C.1
  • 24
    • 0037057861 scopus 로고    scopus 로고
    • The small model property: How small can it be?
    • A. Pnueli, Y. Rodeh, O. Strichmann, and M. Siegel. The small model property: how small can it be? Inf. Comput., 178(l):279-293, 2002.
    • (2002) Inf. Comput , vol.178 , Issue.L , pp. 279-293
    • Pnueli, A.1    Rodeh, Y.2    Strichmann, O.3    Siegel, M.4
  • 27
    • 33646186509 scopus 로고    scopus 로고
    • Combination of Isabelle/HOL with automatic tools
    • B. Gramlich, editor, FroCoS 2005, of, Springer
    • S. Tverdyshev. Combination of Isabelle/HOL with automatic tools. In B. Gramlich, editor, FroCoS 2005, volume 3717 of Lecture Notes in Computer Science, pages 302-309. Springer, 2005.
    • (2005) Lecture Notes in Computer Science , vol.3717 , pp. 302-309
    • Tverdyshev, S.1
  • 28
    • 33646398590 scopus 로고    scopus 로고
    • Automatic formal verification of liveness for pipelined processors with multicycle functional units
    • M. N. Velev. Automatic formal verification of liveness for pipelined processors with multicycle functional units. In CHARME, pages 97-113, 2005.
    • (2005) CHARME , pp. 97-113
    • Velev, M.N.1
  • 29
    • 51549105845 scopus 로고    scopus 로고
    • TLSim and EVC: A term-level symbolic simulator and an efficient decision procedure for the logic of equality with uninterpreted functions and memories
    • M. N. Velev and R. E. Bryant. TLSim and EVC: a term-level symbolic simulator and an efficient decision procedure for the logic of equality with uninterpreted functions and memories. Int. J. Embedded Systems, 1(1/2): 134-149, 2005.
    • (2005) Int. J. Embedded Systems , vol.1 , Issue.1-2 , pp. 134-149
    • Velev, M.N.1    Bryant, R.E.2


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