L. Arditi. Formal verication of microprocessors: a rst experiment with the Coq proof assistant. Technical Report RR-96-31, Universit# de Nice Sophia Antipolis. Laboratoire I3S, May 1996. 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) Self-citation (Arditi) (Correct)
....Thus, the rst attempt is done using the rst methodology. It may fail due to a combinational explosion or a data dependent loop. In the second case, recursive functions in the Coq formalism are automatically generated from the control graph. Then the proof is achieved with human guidance in Coq [1]. When the failure is due to a combinational explosion, an attempt is done using BMDs. If it fails, Coq is used. We have no place to detail our three methodologies here. We only show in the rest of the paper that BMDs are useful to handle proof of some arithmetic instructions. 3 Binary Moment ....
L. Arditi. Formal verication of microprocessors: a rst experiment with the Coq proof assistant. Technical Report RR-96-31, Universit# de Nice Sophia Antipolis. Laboratoire I3S, May 1996.
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