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. Unabridged republication of the edition published by McGraw-Hill, New York, 1974.
Computability and Unsolvability by Martin Davis Classic graduate-level introduction to theory of computability. Discusses general theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, more.
Real Computing Made Real: Preventing Errors in Scientific and Engineering Calculations by Forman S. Acton This concise guide to trouble-shooting offers practical advice on detecting and removing the bugs, preserving significant figures, avoiding extraneous solutions, and finding efficient iterative processes for solving nonlinear equations. 1996 edition.
