|Title:||Introduction to Digital Circuit Verification
|Abstract:||This report offers a step-by-step introduction to digital circuit verification. It makes extensive use of material freely available on the Internet. The material we use has been established and is being maintained and updated by well-known Computer Science Departments and/or Research Institutes. The major part of this report offers an introduction to the formal verification of combinational, iterative, synchronous, and asynchronous circuits. It also presents some inside into valuable approaches to basic theorem proving (Larch-Prover, MIT), the high-level specification language LOTOS, and the elements of Petri Nets and the related software tool PETRIFY (U. Barcelona).|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2001/CS/CS-2001-10), rather than to the URL of the PDF or PS files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 2001
To the main CS technical reports page
Computer science department, Technion