+353-1-416-8900REST OF WORLD
+44-20-3973-8888REST OF WORLD
1-917-300-0470EAST COAST U.S
1-800-526-8630U.S. (TOLL FREE)


The Foundations of Program Verification. 2nd Edition. Wiley Teubner on Applicable Theory in Computer Science

  • ID: 2240022
  • Book
  • February 1987
  • Region: Global
  • 240 Pages
  • John Wiley and Sons Ltd
1 of 3
The Foundations of Program Verification Second Edition Jacques Loeckx and Kurt Sieber Fachbereich informatik Universität des Saariandes, Saarbrücken, 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’ 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 of the better books currently available which introduces program verification.’ G. Bunting, University College Cardiff University Computing
Note: Product cover images may vary from those shown
2 of 3

Mathematical Preliminaries.

Predicate Logic.


Three Simple Programming Languages.

Fixpoints in Complete Partial Orders.

Denotational Semantics.


Correctness of Programs.

The Classical Methods of Floyd.

The Axiomatic Method of Hoare.

Verfication Methods Based on Denotational Semantics.

LCF, A Logic for Computable Functions.


An Overview of Further Developments.


Note: Product cover images may vary from those shown
3 of 3


4 of 3
Jacques Loeckx
Kurt Sieber
Note: Product cover images may vary from those shown