Higher Order Logic and Hardware Verification
Part of Cambridge Tracts in Theoretical Computer Science
- Author: T. F. Melham, University of Glasgow
- Date Published: November 1993
- availability: Available
- format: Hardback
- isbn: 9780521417181
Hardback
Other available formats:
Paperback, eBook
Looking for an inspection copy?
This title is not currently available for inspection. However, if you are interested in the title for your course we can consider offering an inspection copy. To register your interest please contact [email protected] providing details of the course you are teaching.
-
This 1993 book shows how formal logic can be used to specify the behaviour of hardware designs and reason about their correctness. A primary theme of the book is the use of abstraction in hardware specification and verification. The author describes how certain fundamental abstraction mechanisms for hardware verification can be formalised in logic and used to express assertions about design correctness and the relative accuracy of models of hardware behaviour. His approach is pragmatic and driven by examples. He also includes an introduction to higher-order logic, which is a widely used formalism in this subject, and describes how that formalism is actually used for hardware verification. The book is based in part on the author's own research as well as on graduate teaching. Thus it can be used to accompany courses on hardware verification and as a resource for research workers.
Read more- 'Trendy' subject area
- By the same author as An Introduction to HOL
- Useful for M.Sc level courses on hardware verification
Customer reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity
×Product details
- Date Published: November 1993
- format: Hardback
- isbn: 9780521417181
- length: 180 pages
- dimensions: 244 x 170 x 11 mm
- weight: 0.49kg
- availability: Available
Table of Contents
1. Introduction
2. Higher order logic and the HOL system
3. Hardware verification using higher order logic
4. Abstraction
5. Data abstraction
6. Temporal abstraction
7. Abstraction between models
8. Conclusions and future work
Appendices
References.-
General Resources
Find resources associated with this title
Type Name Unlocked * Format Size Showing of
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to lecturers whose faculty status has been verified. To gain access to locked resources, lecturers should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other lecturers may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Lecturers are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact [email protected].
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email [email protected]
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.
×