- STAFF PICKS
- GIFTS + GIFT CARDS
- SELL BOOKS
- FIND A STORE
New Trade Paper
Ships in 1 to 3 days
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
More copies of this ISBN
Mathematical Theory of Computationby Zohar Manna
Synopses & Reviews
With the objective of making into a science the art of verifying computer programs (debugging), the author addresses both practical and theoretical aspects of the process. A classic of sequential program verification, this volume has been translated into almost a dozen other languages and is much in demand among graduate and advanced undergraduate computer science students.
Subjects include computability (with discussions of finite automata and Turing machines); predicate calculus (basic notions, natural deduction, and the resolution method); verification of programs (both flowchart and algol-like programs); flowchart schemas (basic notions, decision problems, formalization in predicate calculus, and translation programs); and the fixpoint theory of programs (functions and functionals, recursive programs, and verification programs). The treamtent is self-contained, and each chapter concludes with bibliographic remarks, references, and problems.
Book News Annotation:
<:st> A mathematical theory of computation, according to the formulation of Manna (Stanford U.), is a theory that "attempts to formalize our understanding of computation," and to place program verification on greater scientific footing. He looks at the theory and practice of computational verification techniques, keeping the underlying mathematical theory to a minimum. Chapters cover computability, predicate calculus, verification of programs, flowchart schemas, and the "fixpoint" theory of programs. The McGraw-Hill original 1974 edition of this work is cited in
Annotation ©2004 Book News, Inc., Portland, OR (booknews.com)
Attempting to make into a science the art of verifying computer programs (debugging), the author addresses both practical and theoretical aspects. This self-contained treatment includes selected concepts of computability theory and mathematical logic.
With the objective of making into a science the art of verifying computer programs (debugging), the author addresses both practical and theoretical aspects. Subjects include computability (with discussions of finite automata and Turing machines); predicate calculus; verification of programs (bloth flowchart and algol-like programs); flowchart schemas; and the fixpoint theory of programs. 1974 edition. Includes 77 figures.
Table of Contents
2. Predicate Calculus
3. Verification of Programs
4. Flowchart Schemas
5. The Fixpoint Theory of Programs
What Our Readers Are Saying
Computers and Internet » Software Engineering » Programming and Languages