F. Corella. Automatic high-level verication against clocked algorithmic specications. In 11 th International Conference on Computer Hardware Description Languages and their Applications. Elsevier Science Publishers B.V., 1993. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
*BMDs Can Delay the Use of Theorem Proving for Verifying.. - Arditi (1996) (Correct)
....verication of processors was rst tackled using theorem proving techniques [22, 27, 17] Impressive proofs were performed [28, 32, 31] but in our opinion these proofs required to much user guidance from specialized experts. Some interesting results have been obtained using more automatic techniques [18, 13] but they do not verify operative parts of processors. Therefore they cannot perform functional verications of complex arithmetic circuits. Completely automatic methods [20, 12, 5] are lacking for abstraction mechanisms and so generally focus on proving low level descriptions. The problem of ....
F. Corella. Automatic high-level verication against clocked algorithmic specications. In 11 th International Conference on Computer Hardware Description Languages and their Applications. Elsevier Science Publishers B.V., 1993.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC