Paramètres
- 464pages
- 17 heures de lecture
En savoir plus sur le livre
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.
Achat du livre
Mathematical Theory of Computation, Zohar Manna
- Langue
- Année de publication
- 2003
- product-detail.submit-box.info.binding
- (souple)
Modes de paiement
Il manque plus que ton avis ici.
- Titre
- Mathematical Theory of Computation
- Langue
- Anglais
- Auteurs
- Zohar Manna
- Éditeur
- DOVER PUBN INC
- Publié
- 2003
- Format
- souple
- Pages
- 464
- ISBN10
- 0486432386
- ISBN13
- 9780486432380
- Séries
- Mots clés
- Nonfiction, Technologie & Ingénierie, Science et Mathématiques, Informatique & Internet, Mathématiques
- Évaluation
- 3,65 sur 5
- Description
- 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.