G.E. Taylor, G. Russell's Algorithmic and knowledge based CAD for VLSI PDF

By G.E. Taylor, G. Russell

ISBN-10: 086341267X

ISBN-13: 9780863412677

This ebook covers algorithms and purposes of concepts from the unreal intelligence group in CAD for VLSI.

Show description

Read or Download Algorithmic and knowledge based CAD for VLSI PDF

Similar logic books

Get Logic Colloquium '69: Proceedings Manchester, 1969 PDF

Amsterdam 1971 North-Holland. complaints of the summer season institution and colloquium in mathematical common sense, Manchester, August 1969. octavo. , 452pp. VG, gentle soiling, no DJ.

Computational Logic in Multi-Agent Systems: 14th - download pdf or read online

This e-book constitutes the complaints of the 14th overseas Workshop on Computational common sense in Multi-Agent structures, CLIMA XIV, held in Corunna, Spain, in September 2013. The 23 average papers have been conscientiously reviewed and chosen from forty four submissions and offered with 4 invited talks. the aim of the CLIMA workshops is to supply a discussion board for discussing thoughts, in line with computational good judgment, for representing, programming and reasoning approximately brokers and multi-agent structures in a proper manner.

Extra resources for Algorithmic and knowledge based CAD for VLSI

Sample text

4 an example of its use is presented. 6. 2 Transformational synthesis An excellent introduction to high level synthesis systems can be found in the overview paper by McFarland (McFarland et al, 1988). All high level synthesis systems initially operate upon a user specified behavioural description in an appropriate high level language. The language we use for this purpose is called STRICT (Campbell etal, 1985), which is a conventional hardware description language which allows specifications to be written in a functional notation.

This is usually referred to as the Shell principle. For the purpose of hardware verification, Hunt (Hunt, 1985) has added a data type for use with bit vectors, and a whole set of associated theorems. These can be loaded automatically when the prover is started. If the prover fails to complete a proof, this will not necessarily mean that there is something wrong with the theorem. It may be that if the proof is rather complex, the prover will not' see * the right path through the proof. In this case it will be necessary to 'educate' the prover by first proving smaller theorems which prove parts of the big proof, so that the prover will subsequently use these to complete the big proof.

In this case it will be necessary to 'educate' the prover by first proving smaller theorems which prove parts of the big proof, so that the prover will subsequently use these to complete the big proof. In many cases these smaller theorems will be useful in themselves, and can be added to the users' database if he wishes. The prover will therefore frequently need help from the user, which means that in a sense it is not fully automatic. The prove-lemma construct can have as an optional parameter a list of hints, which can tell the prover to use certain theorems with certain parameters, ignore other theorems, or perform inductions in a specified manner.

Download PDF sample

Algorithmic and knowledge based CAD for VLSI by G.E. Taylor, G. Russell


by Jason
4.1

Rated 4.02 of 5 – based on 13 votes

admin