|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: Timothy T.R. Colburn , J.H. Fetzer , R.L. RankinPublisher: Springer Imprint: Springer Edition: Softcover reprint of the original 1st ed. 1993 Volume: 14 Dimensions: Width: 15.20cm , Height: 2.70cm , Length: 22.90cm Weight: 0.702kg ISBN: 9789401047890ISBN 10: 9401047898 Pages: 458 Publication Date: 02 October 2012 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Manufactured on demand ![]() We will order this item for you from a manufactured on demand supplier. Table of ContentsPrologue.- Computer Science and Philosophy.- I / The Mathematical Paradigm.- Towards a Mathematical Science of Computation.- Proof of Algorithms by General Snapshots.- Assigning Meanings to Programs.- An Axiomatic Basis for Computer Programming.- II / Elaborating The Paradigm.- First Steps Towards Inferential Programming.- Mathematics of Programming.- On Formalism in Specifications.- Formalization in Program Development.- III / Challenges, Limits, and Alternatives.- Formalism and Prototyping in the Software Process.- Outline of a Paradigm Change in Software Engineering.- The Place of Strictly Defined Notation in Human Insight.- Limits of Correctness in Computers.- IV / Focus on Formal Verification.- Social Processes and Proofs of Theorems and Programs.- Program Verification: The Very Idea.- The Notion of Proof in Hardware Verification.- Program Verification, Defeasible Reasoning, and Two Views of Computer Science.- Epilogue.- Philosophical Aspects of Program Verification.- Selected Bibliography.- Index of Names.- Index of Subjects.ReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |