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...
主要な著者: | O'Leary, J, Kaivola, R, Melham, T |
---|---|
フォーマット: | Conference item |
出版事項: |
2013
|
類似資料
-
Relational STE and Theorem Proving for Formal Verification of Industrial Circuit Designs
著者:: O'Leary, J, 等
出版事項: (2013) -
A Reflective Functional Language for Hardware Design and Theorem Proving
著者:: Grundy, J, 等
出版事項: (2006) -
A Reflective Functional Language for Hardware Design and Theorem Proving
著者:: Grundy, J, 等
出版事項: (2003) -
Xs Are for Trajectory Evaluation‚ Booleans Are for Theorem Proving
著者:: Aagaard, M, 等
出版事項: (1999) -
Xs are for Trajectory Evaluation‚ Booleans are for Theorem Proving (Extended Version)
著者:: Aagaard, M, 等
出版事項: (2000)