HARDWARE VERIFICATION BY FORMAL PROOF
dc.contributor.author | Birtwistle, Graham | eng |
dc.contributor.author | Graham, Brian | eng |
dc.contributor.author | Melham, Tom | eng |
dc.contributor.author | Schediwy, Rich | eng |
dc.date.accessioned | 2008-02-27T16:30:01Z | |
dc.date.available | 2008-02-27T16:30:01Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1988-10-01 | eng |
dc.description.abstract | Hardware verification is the art of proving formally that, to within the tolerance of an underlying model, a design meets (or perhaps does not meet) its specification. This paper is an introduction to hardware verification and its limitations. We illustrate the technique by specifying and verifying an $x$ or gate and a ripple carry sub-system using the HOL notation, (see [2,8,9]), and then demonstrate its capabilities with sample applications to VLSI CAD and system re-implementation. | eng |
dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
dc.identifier.department | 1988-328-40 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30382 | |
dc.identifier.uri | http://hdl.handle.net/1880/45726 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | HARDWARE VERIFICATION BY FORMAL PROOF | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |