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)