The Foundations of Program Verification

The Foundations of Program Verification Second Edition JacquesLoeckx and Kurt Sieber Fachbereich informatik Universit't desSaariandes, Saarbr?cken, Germany In collaboration with Ryan D.Stansifer Department of Computer Science Cornell University, USAThis revised edition provides a precise mathematical background toseveral program verification techniques. It concentrates on thoseverification methods that have now become classic, such as theinductive assertions method of Floyd, the axiomatic method ofHoare, and Scott's fixpoint induction. The aim of the book isto present these different verification methods in a simple settingand to explain their mathematical background in particular theproblems of correctness and completeness of the different methodsare discussed in some detail and many helpful examples areincluded. Contents Authors' Preface
* Part 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 ofthe better books currently available which introduces programverification.' G. Bunting, University College CardiffUniversity Computing