Mathematical Theory of Computation by Zohar Manna. Author Zohar Manna. Title Mathematical Theory of Computation. 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.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Acerca de este artículo
Product Identifiers
PublisherDover Publications, Incorporated
ISBN-100486432386
ISBN-139780486432380
eBay Product ID (ePID)4547181
Product Key Features
Number of Pages480 Pages
Publication NameMathematical Theory of Computation
LanguageEnglish
SubjectSoftware Development & Engineering / Quality Assurance & Testing, Programming / General, Logic
Publication Year2003
TypeTextbook
AuthorZohar Manna
Subject AreaMathematics, Computers
SeriesDover Books on Mathematics Ser.
FormatTrade Paperback
Dimensions
Item Height0.9 in
Item Weight18.8 Oz
Item Length8.4 in
Item Width5.5 in
Additional Product Features
Intended AudienceCollege Audience
LCCN2003-060063
Dewey Edition22
IllustratedYes
Dewey Decimal005.1
SynopsisWith 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., 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.