The Foundations of Program Verification (Wiley Teubner Series in Computer Science) (2 SUB)

  • ポイントキャンペーン

The Foundations of Program Verification (Wiley Teubner Series in Computer Science) (2 SUB)

  • 提携先の海外書籍取次会社に在庫がございます。通常2週間で発送いたします。
    1. 納期遅延や、ご入手不能となる場合が若干ございます。
    2. 複数冊ご注文の場合、分割発送となる場合がございます。
    3. 美品のご指定は承りかねます。
  • ≪洋書のご注文につきまして≫ 「海外取次在庫あり」および「国内仕入れ先からお取り寄せいたします」表示の商品でも、納期の目安期間内にお届けできないことがございます。あらかじめご了承ください。

  • 製本 Hardcover:ハードカバー版/ページ数 230 p.
  • 言語 ENG
  • 商品コード 9780471912828
  • DDC分類 005.14

Full Description

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

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
LCF, A Logic for Computable Functions.
An Overview of Further Developments.