메뉴 건너뛰기




Volumn 3576, Issue , 2005, Pages 170-184

Formal verification of Pentium®4 components with symbolic simulation and inductive invariants

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; CONTROL SYSTEMS; MATHEMATICAL MODELS; NETWORKS (CIRCUITS);

EID: 26444526578     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11513988_19     Document Type: Conference Paper
Times cited : (16)

References (22)
  • 1
  • 2
    • 84863931632 scopus 로고    scopus 로고
    • InVeST: A tool for the verification of invariants
    • Springer-Verlag
    • S. Bensalem, Y. Lakhnech, and S. Owre. InVeST: A tool for the verification of invariants. In CAV '98, Proceedings, pages 505-510. Springer-Verlag, 1998.
    • (1998) CAV '98, Proceedings , pp. 505-510
    • Bensalem, S.1    Lakhnech, Y.2    Owre, S.3
  • 3
    • 84958745490 scopus 로고    scopus 로고
    • Finding bugs in an alpha microprocessor using satisfiability solvers
    • Springer-Verlag
    • P. Bjesse, T. Leonard, and A. Mokkedem. Finding bugs in an alpha microprocessor using satisfiability solvers. In CAV '01, Proceedings, pages 454-464. Springer-Verlag, 2001.
    • (2001) CAV '01, Proceedings , pp. 454-464
    • Bjesse, P.1    Leonard, T.2    Mokkedem, A.3
  • 4
    • 0031079312 scopus 로고    scopus 로고
    • Automatic generation of invariants and intermediate assertions
    • N. Bjørner, A. Browne, and Z. Manna. Automatic generation of invariants and intermediate assertions. Theor. Comput. Sci., 173(1):49-87, 1997.
    • (1997) Theor. Comput. Sci. , vol.173 , Issue.1 , pp. 49-87
    • Bjørner, N.1    Browne, A.2    Manna, Z.3
  • 5
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • Aug.
    • R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Trans. on Comp., C-35(8):677-691, Aug. 1986.
    • (1986) IEEE Trans. on Comp. , vol.C-35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 6
    • 0011881992 scopus 로고
    • Program proving as hand simulation with a little induction
    • North Holland Publishing Company, aug
    • R. Burstall. Program proving as hand simulation with a little induction. In Information Processing, pages 308 - 312. North Holland Publishing Company, aug 1974.
    • (1974) Information Processing , pp. 308-312
    • Burstall, R.1
  • 9
    • 0002780749 scopus 로고
    • Assigning meaning to programs
    • American Mathematical Society
    • R. W. Floyd. Assigning meaning to programs. In Proceedings of Symposium in Applied Mathematics, volume 19, pages 19-32. American Mathematical Society, 1967.
    • (1967) Proceedings of Symposium in Applied Mathematics , vol.19 , pp. 19-32
    • Floyd, R.W.1
  • 10
    • 0005599065 scopus 로고    scopus 로고
    • Symbolic trajectory evaluation
    • T. Kropf, editor, chapter 1. Springer Verlag; New York
    • S. Hazelhurst and C.-J. H. Seger. Symbolic trajectory evaluation. In T. Kropf, editor, Formal Hardware Verification, chapter 1, pages 3-78. Springer Verlag; New York, 1997.
    • (1997) Formal Hardware Verification , pp. 3-78
    • Hazelhurst, S.1    Seger, C.-J.H.2
  • 12
    • 0032218218 scopus 로고    scopus 로고
    • Automatic generation of state invariants from requirements specifications
    • ACM Press
    • R. Jeffords and C. Heitmeyer. Automatic generation of state invariants from requirements specifications. In SIGSOFT '98/FSE-6, Proceedings, pages 56-69. ACM Press, 1998.
    • (1998) SIGSOFT '98/FSE-6, Proceedings , pp. 56-69
    • Jeffords, R.1    Heitmeyer, C.2
  • 14
    • 84896693478 scopus 로고    scopus 로고
    • Proof engineering in the large: Formal verification of Pentium 4 floating-point divider
    • R. Kaivola and K. Kohatsu. Proof engineering in the large: formal verification of Pentium 4 floating-point divider. Int'l J. on Software Tools for Technology Transfer, 4:323-334, 2003.
    • (2003) Int'l J. on Software Tools for Technology Transfer , vol.4 , pp. 323-334
    • Kaivola, R.1    Kohatsu, K.2
  • 15
    • 26444446170 scopus 로고    scopus 로고
    • An enhanced cut-points algorithm in formal equivalence verification
    • IEEE
    • Z. Khasidashvili, J. Moondanos, D. Kaiss, and Z. Hanna. An enhanced cut-points algorithm in formal equivalence verification. In HLDVT '01, page 171. IEEE, 2001.
    • (2001) HLDVT '01 , pp. 171
    • Khasidashvili, Z.1    Moondanos, J.2    Kaiss, D.3    Hanna, Z.4
  • 16
    • 0036907084 scopus 로고    scopus 로고
    • Combinational equivalence checking through function transformation
    • ACM
    • H. H. Kwak, I.-H. Moon, J. H. Kukula, and T. R. Shiple. Combinational equivalence checking through function transformation. In ICCAD '02, pages 526-533. ACM, 2002.
    • (2002) ICCAD '02 , pp. 526-533
    • Kwak, H.H.1    Moon, I.-H.2    Kukula, J.H.3    Shiple, T.R.4
  • 20
    • 0001510331 scopus 로고
    • Formal verification by symbolic evaluation of partially-ordered trajectories
    • Mar.
    • 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-189, Mar. 1995.
    • (1995) Formal Methods in System Design , vol.6 , Issue.2 , pp. 147-189
    • Seger, C.-J.H.1    Bryant, R.E.2
  • 21
    • 70350787997 scopus 로고    scopus 로고
    • Checking safety properties using induction and a sat-solver
    • Springer-Verlag
    • M. Sheeran, S. Singh, and G. Stålmarck. Checking safety properties using induction and a sat-solver. In FMCAD '00, pages 108-125. Springer-Verlag, 2000.
    • (2000) FMCAD '00 , pp. 108-125
    • Sheeran, M.1    Singh, S.2    Stålmarck, G.3
  • 22
    • 84903166484 scopus 로고    scopus 로고
    • A technique for invariant generation
    • Springer-Verlag
    • A. Tiwari, H. Rueß, H. Saïdi, and N. Shankar. A technique for invariant generation. In TACAS 2001, pages 113-127. Springer-Verlag, 2001.
    • (2001) TACAS 2001 , pp. 113-127
    • Tiwari, A.1    Rueß, H.2    Saïdi, H.3    Shankar, N.4


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