Relational STE and theorem proving for formal verification of industrial circuit designs
Model checking by symbolic trajectory evaluation, orchestrated in a flexible functional-programming framework, is a well-established technology for correctness verification of industrial-scale circuit designs. Most verifications in this domain require decomposition into subproblems that symbolic tra...
Asıl Yazarlar: | O'Leary, J, Kaivola, R, Melham, T |
---|---|
Materyal Türü: | Conference item |
Baskı/Yayın Bilgisi: |
2013
|
Benzer Materyaller
-
Relational STE and Theorem Proving for Formal Verification of Industrial Circuit Designs
Yazar:: O'Leary, J, ve diğerleri
Baskı/Yayın Bilgisi: (2013) -
A Reflective Functional Language for Hardware Design and Theorem Proving
Yazar:: Grundy, J, ve diğerleri
Baskı/Yayın Bilgisi: (2006) -
A Reflective Functional Language for Hardware Design and Theorem Proving
Yazar:: Grundy, J, ve diğerleri
Baskı/Yayın Bilgisi: (2003) -
Xs Are for Trajectory Evaluation‚ Booleans Are for Theorem Proving
Yazar:: Aagaard, M, ve diğerleri
Baskı/Yayın Bilgisi: (1999) -
Xs are for Trajectory Evaluation‚ Booleans are for Theorem Proving (Extended Version)
Yazar:: Aagaard, M, ve diğerleri
Baskı/Yayın Bilgisi: (2000)