+612 9045 4394
 
CHECKOUT
$7.95 Delivery per order to Australia and New Zealand
100% Australian owned
Over a hundred thousand in-stock titles ready to ship
Theoretical Foundations of VLSI Design : Cambridge Tracts in Theoretical Computer Science - K. McEvoy

Theoretical Foundations of VLSI Design

Cambridge Tracts in Theoretical Computer Science

By: K. McEvoy (Editor), J. V. Tucker (Editor), C. J. Van Rijsbergen (Editor), S. Abramsky (Editor), P. H. Aczel (Editor)

Paperback Published: 30th March 2004
ISBN: 9780521545655
Number Of Pages: 452

Share This Book:

Paperback

RRP $87.95
$76.75
13%
OFF
Ships in 10 to 15 business days

Earn 154 Qantas Points
on this Book

This book discusses recent research in the theoretical foundations of several subjects of importance for the design of hardware, and for computer science in general. The physical technologies of very large scale integration (VLSI) are having major effects on the electronic industry. The potential diversity and complexity of digital systems have begun a revolution in the technologies of digital design, involving the application of concepts and methods to do with algorithms and programming. In return, the problems of VLSI design have led to new subjects becoming of importance in computer science. Topics covered in this volume include: models of VLSI complexity; complexity theory; systolic algorithm design; specification theory; verification theory; design by stepwise refinement and transformations. A thorough literature survey with an exhaustive bibliography is also included. The book has grown from a workshop held at the Centre for Theoretical Computer Science at Leeds University and organised by the editors.

Introduction
Formal Methods and Verification
A mechanised proof of correctness of a simple counter
A formal model for the hierarchical design of synchronous and systolic algorithms
Correctness proofs for systolic algorithms
A palindrome recogniser
Theory and Methodology of Design
Formal specification of a digital correlator
Describing and reasoning about circuits using relations
Models of Circuits and Complexity Theory
Superpolynomial bounds on monotone network complexity
The prioritiser experiment
Estimation and measurement of computation time in VLSI
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780521545655
ISBN-10: 052154565X
Series: Cambridge Tracts in Theoretical Computer Science
Audience: Professional
Format: Paperback
Language: English
Number Of Pages: 452
Published: 30th March 2004
Publisher: Cambridge University Press
Country of Publication: GB
Dimensions (cm): 24.6 x 18.9  x 2.3
Weight (kg): 0.8

Earn 154 Qantas Points
on this Book