+612 9045 4394
Foundations of Prog Verification 2E : Wiley-Teubner Series in Computer Science - Jacques Loeckx

Foundations of Prog Verification 2E

Wiley-Teubner Series in Computer Science


Published: 8th January 1991
Ships: 7 to 10 business days
7 to 10 business days
or 4 easy payments of $260.94 with Learn more

The Foundations of Program Verification Second Edition Jacques Loeckx and Kurt Sieber Fachbereich informatik Universit&#228;t des Saariandes, Saarbr&#252;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&#145;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&#146; Preface<UL><LI=0>Part A: Preliminaries<OL><LI>Mathematical Preliminaries<LI>Predicate Logic</OL><LI=0>Part B: Semantics of Programming Languages<OL start=3><LI>Three Simple Programming Languages<LI>Fixpoints in Complete Partial Orders<LI>Denotational Semantics</OL><LI=0>Part C: Program Verification Methods<OL start=6><LI>Correctness of Programs<LI>The Classical Methods of Floyd<LI>The Axiomatic Method of Hoare<LI>Verification Methods Based on Denotational Semantics<LI>LCF A Logic for Computable Functions</OL><LI=0>Part D: Prospects<OL start=11><LI>An Overview of Further Developments</OL></UL>Bibliography Index Review of the First Edition &#145;&#133; one of the better books currently available which introduces program verification.&#146; G. Bunting, University College Cardiff University Computing


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.



ISBN: 9780471912828
ISBN-10: 0471912824
Series: Wiley-Teubner Series in Computer Science
Audience: Tertiary; University or College
Format: Hardcover
Language: English
Number Of Pages: 240
Published: 8th January 1991
Country of Publication: GB
Dimensions (cm): 23.6 x 15.82  x 2.11
Weight (kg): 0.54
Edition Number: 2
Edition Type: Revised