메뉴 건너뛰기




Volumn 1954, Issue , 2000, Pages 423-442

Sequential equivalence checking by symbolic simulation

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; FORMAL METHODS; MODEL CHECKING;

EID: 0004492569     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper
Times cited : (2)

References (25)
  • 1
    • 0031634235 scopus 로고    scopus 로고
    • Combining theorem proving and trajectory evaluation in an industrial environment
    • M. D. Aagaard, R. B. Jones, and C-J. H. Seger. Combining theorem proving and trajectory evaluation in an industrial environment. In DAC'98, 1998.
    • (1998) DAC'98
    • Aagaard, M.D.1    Jones, R.B.2    Seger, C.-J.H.3
  • 2
    • 0032630135 scopus 로고    scopus 로고
    • Formal verification using parametric representations of boolean constraints
    • M. D. Aagaard, R. B. Jones, and C-J. H. Seger. Formal verification using parametric representations of boolean constraints. In DAC'99, 1999.
    • (1999) DAC'99
    • Aagaard, M.D.1    Jones, R.B.2    Seger, C.-J.H.3
  • 3
    • 0030403629 scopus 로고    scopus 로고
    • Using complete-1-distinguishability for FSM equivalence checking
    • P. Ashar, A. Gupta, and S. Malik. Using complete-1-distinguishability for FSM equivalence checking. In ICCAD'96, 1996.
    • (1996) ICCAD'96
    • Ashar, P.1    Gupta, A.2    Malik, S.3
  • 4
    • 84957633777 scopus 로고    scopus 로고
    • Validity checking for combinations of theories with equality
    • Springer Verlag
    • C. W. Barrett, D. L. Dill, and J. R. Levitt. Validity checking for combinations of theories with equality. In FMCAD'96, volume 1166 of LNCS. Springer Verlag, 1996.
    • (1996) FMCAD'96 , vol.1166
    • Barrett, C.W.1    Dill, D.L.2    Levitt, J.R.3
  • 5
    • 0031618668 scopus 로고    scopus 로고
    • A decision procedure for bit-vector arithmetic
    • C. W. Barrett, D. L. Dill, and J. R. Levitt. A decision procedure for bit-vector arithmetic. In DAC'98, 1998.
    • (1998) DAC'98
    • Barrett, C.W.1    Dill, D.L.2    Levitt, J.R.3
  • 6
    • 0032641928 scopus 로고    scopus 로고
    • Cycle-based symbolic simulation of gatelevel synchronous circuits
    • V. Bertacco, M. Damiani, and S. Quer. Cycle-based symbolic simulation of gatelevel synchronous circuits. In DAC'99, 1999.
    • (1999) DAC'99
    • Bertacco, V.1    Damiani, M.2    Quer, S.3
  • 7
    • 0022219498 scopus 로고
    • Symbolic verification of MOS circuits
    • Computer Science Press
    • R. E. Bryant. Symbolic verification of MOS circuits. In 1985 Chapel Hill Conference on VLSI, pages 419-438. Computer Science Press, 1985.
    • (1985) 1985 Chapel Hill Conference on VLSI , pp. 419-438
    • Bryant, R.E.1
  • 8
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. on Computers, C-35(8): 677-691, 1986.
    • (1986) IEEE Trans. on Computers , vol.35 C , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 9
    • 0025566514 scopus 로고
    • Sequential circuit verification using symbolic model checking
    • J. R. Burch, E. M. Clarke, K. L. McMillan, and D. L. Dill. Sequential circuit verification using symbolic model checking. In DAC'90, 1990.
    • (1990) DAC'90
    • Burch, J.R.1    Clarke, E.M.2    McMillan, K.L.3    Dill, D.L.4
  • 10
    • 0032630766 scopus 로고    scopus 로고
    • Enhancing simulation with BDDs and ATPG
    • M. K. Ganai, A. Aziz, and A. Kuehlmann. Enhancing simulation with BDDs and ATPG. In DAC'99, 1999.
    • (1999) DAC'99
    • Ganai, M.K.1    Aziz, A.2    Kuehlmann, A.3
  • 14
    • 0011886073 scopus 로고    scopus 로고
    • Implementation of a multiple-domain decision diagram package
    • S. Höreth. Implementation of a multiple-domain decision diagram package. In CHARME'97, 1997.
    • (1997) CHARME'97
    • Höreth, S.1
  • 16
    • 0029707586 scopus 로고    scopus 로고
    • State reduction using reversible rules
    • C. N. Ip and D. L. Dill. State reduction using reversible rules. In DAC'96, 1996.
    • (1996) DAC'96
    • Ip, C.N.1    Dill, D.L.2
  • 17
    • 0029486985 scopus 로고
    • Efficient validity checking for processor verification
    • R. B. Jones, D. L. Dill, and J. R. Burch. Efficient validity checking for processor verification. In ICCAD'95, 1995.
    • (1995) ICCAD'95
    • Jones, R.B.1    Dill, D.L.2    Burch, J.R.3
  • 20
    • 0032641334 scopus 로고    scopus 로고
    • Exploiting symmetry when verifying transistorlevel circuits by symbolic trajectory evaluation
    • M. Pandey and R. E. Bryant. Exploiting symmetry when verifying transistorlevel circuits by symbolic trajectory evaluation. IEEE Trans. on Computer-Aided Design, 18(7): 918-935, 1999.
    • (1999) IEEE Trans. on Computer-Aided Design , vol.18 , Issue.7 , pp. 918-935
    • Pandey, M.1    Bryant, R.E.2
  • 21
    • 84947266301 scopus 로고    scopus 로고
    • Formal verification of designs with complex control by symbolic simulation
    • Springer Verlag
    • G. Ritter, H. Eveking, and H. Hinrichsen. Formal verification of designs with complex control by symbolic simulation. In CHARME'99, volume 1703 of LNCS. Springer Verlag, 1999.
    • (1999) CHARME'99 , vol.1703
    • Ritter, G.1    Eveking, H.2    Hinrichsen, H.3
  • 22
    • 84952778181 scopus 로고    scopus 로고
    • Formal verification of descriptions with distinct order of memory operations
    • Springer Verlag
    • G. Ritter, H. Hinrichsen, and H. Eveking. Formal verification of descriptions with distinct order of memory operations. In ASIAN'99, volume 1742 of LNCS. Springer Verlag, 1999.
    • (1999) ASIAN'99 , vol.1742
    • Ritter, G.1    Hinrichsen, H.2    Eveking, H.3
  • 23
    • 0001510331 scopus 로고
    • Formal verification by symbolic evaluation of partially-ordered trajectories
    • C.-J. H. Seger and R. E. Bryant. Formal verification by symbolic evaluation of partially-ordered trajectories. Formal Methods in System Design, 6(2): 147-190, 1995.
    • (1995) Formal Methods in System Design , vol.6 , Issue.2 , pp. 147-190
    • Seger, C.-J.H.1    Bryant, R.E.2
  • 24
    • 84957648346 scopus 로고
    • Proofs and synthesis are cooperative approaches for correct circuit designs
    • North-Holland
    • T. Uehara. Proofs and synthesis are cooperative approaches for correct circuit designs. In From HDL Descriptions to Guaranteed Correct Circuit Designs. North-Holland, 1987.
    • (1987) From HDL Descriptions to Guaranteed Correct Circuit Designs
    • Uehara, T.1
  • 25
    • 0031641691 scopus 로고    scopus 로고
    • Automatic generation of assertions for formal verification of PowerPC™ microprocessor arrays using symbolic trajectory evaluation
    • L.-C. Wang, M. S. Abadir, and N. Krishnamurthy. Automatic generation of assertions for formal verification of PowerPC™ microprocessor arrays using symbolic trajectory evaluation. In DAC'98, 1998.
    • (1998) DAC'98
    • Wang, L.-C.1    Abadir, M.S.2    Krishnamurthy, N.3


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