메뉴 건너뛰기




Volumn 2001-January, Issue , 2001, Pages 45-50

Symbolic simulation techniques-state-of-the-art and applications

Author keywords

[No Author keywords available]

Indexed keywords

C (PROGRAMMING LANGUAGE);

EID: 0012982636     PISSN: 15526674     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HLDVT.2001.972806     Document Type: Conference Paper
Times cited : (6)

References (31)
  • 1
    • 84957633777 scopus 로고    scopus 로고
    • Validity checking for combinations of theories with equality
    • M. Srivas and A. Camilleri, editors, Proc. FMCAD'96, Springer
    • C. Barrett, D. Dill, and J. Levitt. Validity checking for combinations of theories with equality. In M. Srivas and A. Camilleri, editors, Proc. FMCAD'96, volume 1166 of LNCS. Springer, 1996.
    • (1996) LNCS , vol.1166
    • Barrett, C.1    Dill, D.2    Levitt, J.3
  • 4
    • 84952806082 scopus 로고    scopus 로고
    • Formal verification of register binding
    • C. Blank. Formal verification of register binding. In Proc. WAVE'00, 2000.
    • (2000) Proc. WAVE'00
    • Blank, C.1
  • 5
    • 84952806083 scopus 로고    scopus 로고
    • VeXt - A framework for property verification of mixed data and control intensive designs
    • C. Blank. VeXt - A framework for property verification of mixed data and control intensive designs. In Proc. University Booth at DATE'01, 2001.
    • (2001) Proc. University Booth at DATE'01
    • Blank, C.1
  • 7
    • 84952806085 scopus 로고
    • A switch-level model and simulator for MOS digital systems
    • R. Bryant. A switch-level model and simulator for MOS digital systems. IEEE C-33, 1984.
    • (1984) IEEE C-33
    • Bryant, R.1
  • 8
    • 0026174870 scopus 로고
    • Formal hardware verification by symbolic ternary trajectory evaluation
    • R. Bryant, D. Beatty, and C. Seger. Formal hardware verification by symbolic ternary trajectory evaluation. In Proc. DAC'91, 1991.
    • (1991) Proc. DAC'91
    • Bryant, R.1    Beatty, D.2    Seger, C.3
  • 9
    • 84957091519 scopus 로고    scopus 로고
    • Exploiting positive equality in a logic of equality with uninterpreted functions
    • Proc. CAV'99, Springer
    • R. Bryant, S. German, and M. Velev. Exploiting positive equality in a logic of equality with uninterpreted functions. In Proc. CAV'99, volume 1633 of LNCS. Springer, 1999.
    • (1999) LNCS , vol.1633
    • Bryant, R.1    German, S.2    Velev, M.3
  • 10
    • 84944393003 scopus 로고    scopus 로고
    • Boolean satisfiability with transitivity constraints
    • Proc. CAV'00, Springer
    • R. Bryant and M. Velev. Boolean satisfiability with transitivity constraints. In Proc. CAV'00, volume 1855 of LNCS. Springer, 2000.
    • (2000) LNCS , vol.1855
    • Bryant, R.1    Velev, M.2
  • 11
    • 84958772916 scopus 로고
    • Automatic verification of pipelined microprocessor control
    • D. Dill, editor, Proc. CAV'94, Springer
    • J. R. Burch and D. L. Dill. Automatic verification of pipelined microprocessor control. In D. Dill, editor, Proc. CAV'94, volume 818 of LNCS. Springer, 1994.
    • (1994) LNCS , vol.818
    • Burch, J.R.1    Dill, D.L.2
  • 12
    • 0033684556 scopus 로고    scopus 로고
    • Automatic formal verification of DSP software
    • IEEE Press
    • D. Currie, A. Hu, S. Rajan, and M. Fujita. Automatic formal verification of DSP software. In Proc. DAC'00. IEEE Press, 2000.
    • (2000) Proc. DAC'00
    • Currie, D.1    Hu, A.2    Rajan, S.3    Fujita, M.4
  • 13
    • 33748557565 scopus 로고    scopus 로고
    • An efficient decision procedure for the theory of fixed-sized bit-vectors
    • Proc. CAV'97, Springer
    • D. Cyrluk, O. Möller, and H. Rueß. An efficient decision procedure for the theory of fixed-sized bit-vectors. In Proc. CAV'97, volume 1254 of LNCS. Springer, 1997.
    • (1997) LNCS , vol.1254
    • Cyrluk, D.1    Möller, O.2    Rueß, H.3
  • 14
    • 84958751994 scopus 로고    scopus 로고
    • ICS: Integrated canonizer and solver
    • Proc. CAV'01, Springer
    • J. Filliâtre, S. Owre, H. R. and N. Shankar. ICS: integrated canonizer and solver. In Proc. CAV'01, volume 2102 of LNCS. Springer, 2001.
    • (2001) LNCS , vol.2102
    • Filliâtre, J.1    Owre, S.2    R, H.3    Shankar, N.4
  • 15
    • 84947287272 scopus 로고    scopus 로고
    • Symbolic checking of signal-transition consistency for verifying high-level designs
    • Proc. FMCAD'00, Springer
    • K. Hamaguchi, H. Urushihara, and T. Kashiwabara. Symbolic checking of signal-transition consistency for verifying high-level designs. In Proc. FMCAD'00, volume 1954 of LNCS. Springer, 2000.
    • (2000) LNCS , vol.1954
    • Hamaguchi, K.1    Urushihara, H.2    Kashiwabara, T.3
  • 16
    • 0011886073 scopus 로고    scopus 로고
    • Implementation of a multiple-domain decision diagram package
    • S. Höreth. Implementation of a multiple-domain decision diagram package. In Proc. CHARME'97, 1997.
    • (1997) Proc. CHARME'97
    • Höreth, S.1
  • 20
    • 84948970435 scopus 로고    scopus 로고
    • Symbolic simulation: An ACL2 approach
    • Proc. FMCAD'98, Springer
    • G. Moore. Symbolic simulation: an ACL2 approach. In Proc. FMCAD'98, volume 1522 of LNCS. Springer, 1998.
    • (1998) LNCS , vol.1522
    • Moore, G.1
  • 21
    • 84952806088 scopus 로고    scopus 로고
    • Rewriting for symblic execution of state machine models
    • Proc. CAV'01, Springer
    • G. Moore. Rewriting for symblic execution of state machine models. In Proc. CAV'01, volume 2102 of LNCS. Springer, 2001.
    • (2001) LNCS , vol.2102
    • Moore, G.1
  • 23
    • 84957075583 scopus 로고    scopus 로고
    • Deciding equality formulas by small domain instantiations
    • Proc. CAV'99, Springer
    • A. Pnueli, Y. Rodeh, M. Siegel, and O. Shtrichman. Deciding equality formulas by small domain instantiations. In Proc. CAV'99, volume 1633 of LNCS. Springer, 1999.
    • (1999) LNCS , vol.1633
    • Pnueli, A.1    Rodeh, Y.2    Siegel, M.3    Shtrichman, O.4
  • 24
    • 0004492569 scopus 로고    scopus 로고
    • Sequential equivalence checking by symbolic simulation
    • Proc. FMCAD'00, Springer
    • G. Ritter. Sequential equivalence checking by symbolic simulation. In Proc. FMCAD'00, volume 1954 of LNCS. Springer, 2000.
    • (2000) LNCS , vol.1954
    • Ritter, G.1
  • 25
    • 2342667530 scopus 로고    scopus 로고
    • PhD thesis, Binational, Dept. of Electrical and Computer Engineering (Computer Systems), Darmstadt University of Technology, Germany, and TIMA laboratory, Université Joseph Fourier, France
    • G. Ritter. Formal sequential equivalence checking of digital systems by symbolic simulation. PhD thesis, Binational, Dept. of Electrical and Computer Engineering (Computer Systems), Darmstadt University of Technology, Germany, and TIMA laboratory, Université Joseph Fourier, France, available at http://www.rs.e-technik.tu-darmstadt.de/research, 2001.
    • (2001) Formal Sequential Equivalence Checking of Digital Systems by Symbolic Simulation
    • Ritter, G.1
  • 26
    • 84947266301 scopus 로고    scopus 로고
    • Formal verification of designs with complex control by symbolic simulation
    • Proc. CHARME'99, Springer
    • G. Ritter, H. Eveking, and H. Hinrichsen. Formal verification of designs with complex control by symbolic simulation. In Proc. CHARME'99, volume 1703 of LNCS. Springer, 1999.
    • (1999) LNCS , vol.1703
    • Ritter, G.1    Eveking, H.2    Hinrichsen, H.3
  • 27
    • 84952778181 scopus 로고    scopus 로고
    • Formal verification of descriptions with distinct order of memory operations
    • Proc. ASIAN'99, Springer
    • G. Ritter, H. Hinrichsen, and H. Eveking. Formal verification of descriptions with distinct order of memory operations. In Proc. ASIAN'99, volume 1742 of LNCS. Springer, 1999.
    • (1999) LNCS , vol.1742
    • Ritter, G.1    Hinrichsen, H.2    Eveking, H.3
  • 28
    • 84958754487 scopus 로고    scopus 로고
    • Finite instantiations in equivalence logic with uninterpreted functions
    • Proc. CAV'01, Springer
    • Y. Rodeh and O. Shtrichman. Finite instantiations in equivalence logic with uninterpreted functions. In Proc. CAV'01, volume 2102 of LNCS. Springer, 2001.
    • (2001) LNCS , vol.2102
    • Rodeh, Y.1    Shtrichman, O.2
  • 29
    • 0001510331 scopus 로고
    • Formal verification by symbolic evaluation of partially-ordered trajectories
    • C. Seger and R. Bryant. Formal verification by symbolic evaluation of partially-ordered trajectories. Formal Methods in System Design, 6, 1995.
    • (1995) Formal Methods in System Design , vol.6
    • Seger, C.1    Bryant, R.2
  • 31
    • 84861449103 scopus 로고    scopus 로고
    • Superscalar processor verification using efficient reductions of the logic of equality with uninterpreted functions to propositional logic
    • Proc. CHARME'99, Springer
    • M. Velev and R. Bryant. Superscalar processor verification using efficient reductions of the logic of equality with uninterpreted functions to propositional logic. In Proc. CHARME'99, volume 1703 of LNCS. Springer, 1999.
    • (1999) LNCS , vol.1703
    • Velev, M.1    Bryant, R.2


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