ENGINEERING - Cambridge University Press India

Logic in Computer
Science
Modelling and Reasoning
About Systems
2nd Edition
Michael Huth
Imperial College of
Science, Technology and
Medicine, London
& Mark Ryan
University of Birmingham
Recent years have seen the development of
powerful tools for verifying hardware and software
systems, as companies worldwide realise the
need for improved means of validating their
products. There is increasing demand for training
in basic methods in formal reasoning so that
students can gain proficiency in logic-based
verification methods. The second edition of this
successful textbook addresses both those
requirements, by continuing to provide a clear
introduction to formal reasoning which is both
relevant to the needs of modern computer science
and rigorous enough for practical application.
Improvements to the first edition have been made
throughout, with extra and expanded sections on
SAT solvers, existential/ universal second-order
logic, micro-models, programming by contract and
total correctness. The coverage of model-checking
has been substantially updated. Further exercises
have been added. Internet support for the book
includes worked solutions for all exercises for
teachers, and model solutions to some exercises
for students.
Contents: Foreword; 1. Propositional logic;
2. Predicate logic; 3. Verification by model
checking; 4. Program verification; 5. Modal logics
and agents; 6. Binary decision diagrams;
Bibliography; Index.
Digital Systems
Engineering
William J. Dally
Stanford University,
California
& John W. Poulton
University of North
Carolina, Chapel Hill
What makes some computers slow Why do
some digital systems operate reliably , for years
while others fail mysteriously every few hours
How can some systems dissipate kilowatts while
others operate off batteries These questions of
speed, reliability, and power are all determined by
the system-level electrical design of a digital
system.
Digital Systems Engineering presents a
comprehensive treatment of these topics. It
combines a rigorous development of the
fundamental principles in each area with real
world examples of circuits and methods. The book
not only serves as an undergraduate textbook,
filling the gap between circuit design and logic
design, but can also help practising digital
designers keep pace with the speed and power of
modern integrated circuits.
Contents: 1. Introduction to digital systems
engineering; 2. Packaging of digital systems;
3. Modeling and analysis of wires; 4. Circuits;
5. Power distribution; 6. Noise in digital systems;
7. Signalling conventions; 8. Advanced signalling
techniques; 9. Timing conventions;
10. Synchronization; 11. Signalling circuits;
12. Timing circuits; Index.
ISBN: 9780521670449 688pp ` 695.00
ISBN: 9780521670890 440pp ` 595.00
Randomized
Algorithms
Rajeev Motwani
Stanford University,
California
& Prabhakar Raghavan
Yahoo Research,
Santa Clara, California
This text by two well-known experts in the field
presents the basic concepts in the design and
analysis of randomized algorithms at a level
accessible to beginning graduate students.
The first part of the book presents basic tools from
probability theory and probabilistic analysis that
are recurrent in algorithmic applications.
Algorithmic examples are given to illustrate the
use of each tool in a concrete setting. In the
second part of the book each of the seven
chapters focuses on one important area of
application of randomized algorithms: data
structures, geometric algorithms, graph
algorithms, giving a comprehensive and
representative selection of the algorithms in these
areas. This first book on the subject should prove
invaluable as a reference for researchers and
professional programmers, as well as for students.
Contents: Part I. Tools and Techniques:
1. Introduction; 2. Game-theoretic techniques;
3. Moments and deviations; 4. Tail inequalities;
5. The probabilistic method; 6. Markov chains and
random walks; 7. Algebraic techniques; Part II.
Applications: 8. Data structures; 9. Geometric
algorithms and linear programming; 10. Graph
algorithms; 11. Approximate counting; 12. Parallel
and distributed algorithms; 13. Online algorithms;
14. Number theory and algebra; Appendix A.
Notational index; Appendix B. Mathematical
background; Appendix C. Basic probability theory.
Modern Compiler
Implementation in
Java
Andrew W. Appel
Princeton University,
New Jersey
This textbook describes all phases of a modern
compiler, including current techniques in code
generation and register allocation, for imperative,
functional and object-oriented languages. In a
concise and practical way the author describes the
fundamentals of compilation and then moves on to
advanced topics such as SSA form, loop
scheduling, and optimization for cache-memory
hierarchies. The new edition features a redesigned
compiler project in Java, for a subset of Java itself,
covering both front-end and back-end phases.
Contents: Part I. Fundamentals of Compilation:
1. Introduction; 2. Lexical analysis; 3. Parsing;
4. Abstract syntax; 5. Semantic analysis;
6. Activation records; 7. Translation to
intermediate code; 8. Basic blocks and traces;
9. Instruction selection; 10. Liveness analysis;
11. Register allocation; 12. Putting it all together;
Part II. Advanced Topics: 13. Garbage collection;
14. Object-oriented languages; 15. Functional
programming languages; 16. Polymorphic types;
17. Dataflow analysis; 18. Loop optimizations;
19. Static single-assignment form; 20. Pipelining
and scheduling; 21. The memory hierarchy;
Appendix: Mini-Java reference manual.
ISBN: 9788175960725 548pp ` 445.00
ISBN: 9780521613903 492pp ` 595.00
46