메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1325-1330

Image computation and predicate refinement for RTL verilog using word level proofs

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; IMAGE ANALYSIS; LSI CIRCUITS;

EID: 34548354626     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2007.364481     Document Type: Conference Paper
Times cited : (7)

References (20)
  • 1
    • 4444280802 scopus 로고    scopus 로고
    • Automatic abstraction and verification of Verilog models
    • Z. S. Andraus and K. A. Sakallah. Automatic abstraction and verification of Verilog models. In DAC, pages 218-223, 2004.
    • (2004) DAC , pp. 218-223
    • Andraus, Z.S.1    Sakallah, K.A.2
  • 2
    • 0003940079 scopus 로고    scopus 로고
    • Boolean programs: A model and process for software analysis
    • Technical Report 2000-14, Microsoft Research
    • T. Ball and S. Rajamani. Boolean programs: A model and process for software analysis. Technical Report 2000-14, Microsoft Research, 2000.
    • (2000)
    • Ball, T.1    Rajamani, S.2
  • 3
    • 34548347212 scopus 로고    scopus 로고
    • R. Bryant, S. Lahiri, and S. Seshia. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In CAV, 2002.
    • R. Bryant, S. Lahiri, and S. Seshia. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In CAV, 2002.
  • 4
    • 0344840440 scopus 로고    scopus 로고
    • Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis
    • P. Chauhan, E. Clarke, J. Kukula, S. Sapra, H. Veith, and D. Wang. Automated abstraction refinement for model checking large state spaces using SAT based conflict analysis. In FMCAD, 2002.
    • (2002) FMCAD
    • Chauhan, P.1    Clarke, E.2    Kukula, J.3    Sapra, S.4    Veith, H.5    Wang, D.6
  • 5
    • 84944406286 scopus 로고    scopus 로고
    • Counterexample-guided abstraction refinement
    • E. Clarke, O. Grumberg, S. Jha, Y. Lu, and V. H. Counterexample-guided abstraction refinement. In CAV, pages 154-169, 2000.
    • (2000) CAV , pp. 154-169
    • Clarke, E.1    Grumberg, O.2    Jha, S.3    Lu, Y.4    H., V.5
  • 8
    • 24644486279 scopus 로고    scopus 로고
    • Predicate Abstraction and Refinement Techniques for Verifying Verilog
    • Technical Report CMU-CS-04-139, Carnegie Mellon University
    • E. Clarke, H. Jain, and D. Kroening. Predicate Abstraction and Refinement Techniques for Verifying Verilog. Technical Report CMU-CS-04-139, Carnegie Mellon University, 2004.
    • (2004)
    • Clarke, E.1    Jain, H.2    Kroening, D.3
  • 9
    • 34548369940 scopus 로고    scopus 로고
    • E. Clarke, M. Talupur, and D. Wang. SAT based predicate abstraction for hardware verification. In SAT, 2003.
    • E. Clarke, M. Talupur, and D. Wang. SAT based predicate abstraction for hardware verification. In SAT, 2003.
  • 10
    • 84947441305 scopus 로고    scopus 로고
    • Construction of abstract state graphs with PVS
    • S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In CAV, volume 1254, pages 72-83, 1997.
    • (1997) CAV , vol.1254 , pp. 72-83
    • Graf, S.1    Saïdi, H.2
  • 12
    • 27944469105 scopus 로고    scopus 로고
    • Word level predicate abstraction and refinement for verifying RTL Verilog
    • H. Jain, D. Kroening, N. Sharygina, and E. Clarke. Word level predicate abstraction and refinement for verifying RTL Verilog. In Proceedings of DAC 2005, pages 445-450, 2005.
    • (2005) Proceedings of DAC 2005 , pp. 445-450
    • Jain, H.1    Kroening, D.2    Sharygina, N.3    Clarke, E.4
  • 13
    • 26444541620 scopus 로고    scopus 로고
    • R. Jhala and K. L. McMillan. Interpolant-based transition relation approximation. In CAV, pages 39-64. Springer, 2005.
    • R. Jhala and K. L. McMillan. Interpolant-based transition relation approximation. In CAV, pages 39-64. Springer, 2005.
  • 14
    • 33745777418 scopus 로고    scopus 로고
    • A practical and complete approach to predicate refinement
    • TACAS, of, Springer
    • R. Jhala and K. L. McMillan. A practical and complete approach to predicate refinement. In TACAS, volume 3920 of LNCS, pages 459-473. Springer, 2006.
    • (2006) LNCS , vol.3920 , pp. 459-473
    • Jhala, R.1    McMillan, K.L.2
  • 15
    • 33745796005 scopus 로고    scopus 로고
    • Approximating predicate images for bit-vector logic
    • TACAS, Springer
    • D. Kroening and N. Sharygina. Approximating predicate images for bit-vector logic. In TACAS, LNCS, pages 242-256. Springer, 2006.
    • (2006) LNCS , pp. 242-256
    • Kroening, D.1    Sharygina, N.2
  • 17
    • 35048822487 scopus 로고    scopus 로고
    • An interpolating theorem prover
    • Springer
    • K. L. McMillan. An interpolating theorem prover. In Proceedings of TACS, volume 2988, pages 16-30. Springer, 2004.
    • (2004) Proceedings of TACS , vol.2988 , pp. 16-30
    • McMillan, K.L.1
  • 18
    • 84948145694 scopus 로고    scopus 로고
    • On solving Presburger and linear arithmetic with SAT
    • Springer
    • O. Strichman. On solving Presburger and linear arithmetic with SAT. In FMCAD, volume 2517, pages 160-170. Springer, 2002.
    • (2002) FMCAD , vol.2517 , pp. 160-170
    • Strichman, O.1
  • 19
    • 34548352109 scopus 로고    scopus 로고
    • http://www.sun.com/processors/technologies.html.
  • 20
    • 0034841972 scopus 로고    scopus 로고
    • Formal property verification by abstraction refinement with formal, simulation and hybrid engines
    • D. Wang, P. Ho, J. Long, J. Kukula, Y. Zhu, T. Ma, and R. Damiano. Formal property verification by abstraction refinement with formal, simulation and hybrid engines. In DAC, pages 35-40, 2001.
    • (2001) DAC , pp. 35-40
    • Wang, D.1    Ho, P.2    Long, J.3    Kukula, J.4    Zhu, Y.5    Ma, T.6    Damiano, R.7


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