000			03963nam a22003978i 4500
001			CR9780511569845
003			UkCbUP
005			20200124160241.0
006			m|||||o||d||||||||
007			cr||||||||||||
008			090520s1993||||enk o ||1 0|eng|d
020			_a9780511569845 (ebook)
020			_z9780521417181 (hardback)
020			_z9780521115322 (paperback)
040			_aUkCbUP _beng _erda _cUkCbUP
050	0	0	_aTK7874 _b.M432 1993
082	0	0	_a621.39/2 _220
100	1		_aMelham, T. F. _q(Tom F.), _eauthor.
245	1	0	_aHigher order logic and hardware verification / _cT. Melham.
246	3		_aHigher Order Logic & Hardware Verification
264		1	_aCambridge : _bCambridge University Press, _c1993.
300			_a1 online resource (xiii, 165 pages) : _bdigital, PDF file(s).
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
490	1		_aCambridge tracts in theoretical computer science ; _v31
500			_aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
505	0		_a1. Hardware Verification. 1.1. The hardware verification method. 1.2. Limitations of hardware verification. 1.3. Abstraction. 1.4. Hardware verification using higher order logic -- 2. Higher Order Logic and the HOL System. 2.1. Types. 2.2. Terms. 2.3. Sequents, theorems and inference rules. 2.4. Constant definitions. 2.5. The primitive constant [epsilon]. 2.6. Recursive definitions. 2.7. Type definitions. 2.8. The HOL system -- 3. Hardware Verification using Higher Order Logic. 3.1. Specifying hardware behaviour. 3.2. Deriving behaviour from structure. 3.3. Formulating correctness. 3.4. An example correctness proof. 3.5. Other approaches -- 4. Abstraction. 4.1. Abstraction within a model. 4.2. Two problems. 4.3. Abstraction in practice. 4.4. Validity conditions. 4.5. A notation for correctness. 4.6. Abstraction and hierarchical verification. 4.7. Abstraction between models. 4.8. Other approaches -- 5. Data Abstraction. 5.1. Defining concrete types in logic. 5.2. An example: a transistor model.
505	0		_a5.3. An example of data abstraction. 5.4. Reasoning about hardware using bit-vectors. 5.5. Reasoning about tree-shaped circuits. 5.6. Other approaches -- 6. Temporal Abstraction. 6.1. Temporal abstraction by sampling. 6.2. An example: abstracting to unit delay. 6.3. A synchronizing temporal abstraction. 6.4. A case study: the T-ring. 6.5. Other approaches -- 7. Abstraction between Models. 7.1. Representing the structure of CMOS circuits. 7.2. Defining the semantics of CMOS circuits. 7.3. Defining satisfaction. 7.4. Correctness in the two models. 7.5. Relating the models. 7.6. Improving the results. 7.7. Other approaches.
520			_aThis 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.
650		0	_aIntegrated circuits _xVery large scale integration _xData processing.
650		0	_aLogic, Symbolic and mathematical.
776	0	8	_iPrint version: _z9780521417181
830		0	_aCambridge tracts in theoretical computer science ; _v31.
856	4	0	_uhttps://doi.org/10.1017/CBO9780511569845
999			_c518586 _d518584