The Foundations of Program Verification - Rilegato

Loeckx, Jacques; Sieber, Kurt; Stansifer, Ryan D.

Rilegato

ISBN 10: 0471912824 ISBN 13: 9780471912828

Casa editrice: John Wiley & Sons Inc, 1987

Riassunto

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

Su questo libro

Informazioni sull?autore

Jacques Loeckx and Kurt Sieber are the authors of The Foundations of Program Verification, 2nd Edition, published by Wiley.

Dalla quarta di copertina

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

Dettagli dell?edizione

• Editore: John Wiley & Sons Inc
• Data di pubblicazione: 1987
• Lingua: Inglese
• ISBN 10: 0471912824
• ISBN 13: 9780471912828
• Rilegatura: Copertina rigida
• Numero di pagine: 230
• Contatto del produttore: non disponibile
• Persona responsabile: non disponibile