๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Higher Order Logic and Hardware Verification

โœ Scribed by Melham T.F.


Publisher
Cambridge University Press
Year
1993
Tongue
English
Leaves
180
Series
Cambridge Tracts in Theoretical Computer Science 31
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


Dr. Melham shows here how formal logic can be used to specify the behavior 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 formalized in logic and used to express assertions about design correctness and the relative accuracy of models of hardware behavior. 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


๐Ÿ“œ SIMILAR VOLUMES


Higher Order Logic and Hardware Verifica
โœ T. F. Melham ๐Ÿ“‚ Library ๐Ÿ“… 2009 ๐Ÿ› Cambridge University Press ๐ŸŒ English

Dr. Melham shows here how formal logic can be used to specify the behavior 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

Programming with Higher-Order Logic
โœ Dale Miller, Gopalan Nadathur ๐Ÿ“‚ Library ๐Ÿ“… 2012 ๐Ÿ› Cambridge University Press ๐ŸŒ English

Formal systems that describe computations over syntactic structures occur frequently in computer science. Logic programming provides a natural framework for encoding and animating such systems. However, these systems often embody variable binding, a notion that must be treated carefully at a computa