Books.org participates in affiliate programs including Bookshop.org and the Amazon Services LLC Associates Program. We may earn a commission from qualifying purchases made through links on this page, at no additional cost to you.
Overview
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.Synopsis
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 Books for College Libraries, 3rd ed. Annotation ©2004 Book News, Inc., Portland, OR