The Foundations of Program Verification Second Edition Jacques Loeckx and Kurt Sieber Fachbereich informatik Universitat des Saariandes, Saarbrucken, Germany In collaboration with Ryan D. Stansifer Department of Computer Science Cornell University, USA This revised edition provides a precise mathematical background to several program verification techniques. It concentrates on those verification methods that have now become classic, such as the inductive assertions method of Floyd, the axiomatic method of Hoare, and Scott's fixpoint induction. The aim of the book is to present these different verification methods in a simple setting and to explain their mathematical background in particular the problems of correctness and completeness of the different methods are discussed in some detail and many helpful examples are included.Contents Authors' PrefacePart A: Preliminaries Mathematical Preliminaries Predicate Logic Part B: Semantics of Programming Languages Three Simple Programming Languages Fixpoints in Complete Partial Orders Denotational Semantics Part C: Program Verification Methods Correctness of Programs The Classical Methods of Floyd The Axiomatic Method of Hoare Verification Methods Based on Denotational Semantics LCF A Logic for Computable Functions Part D: Prospects An Overview of Further Developments Bibliography Index Review of the First Edition '. one of the better books currently available which introduces program verification.' G. Bunting, University College Cardiff University Computing
Table of Contents
SEMANTICS OF PROGRAMMING LANGUAGES.
Three Simple Programming Languages.
Fixpoints in Complete Partial Orders.
PROGRAM VERIFICATION METHODS.
Correctness of Programs.
The Classical Methods of Floyd.
The Axiomatic Method of Hoare.
Verfication Methods Based on Denotational
LCF, A Logic for Computable Functions.
An Overview of Further Developments.