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

The foundations of program verification (Wiley-Teubner series in computer science)

Computers & Technology

Loeckx, Jacques

Software

New York, NY, U.S.A.: John Wiley & Sons, Incorporated, 1985

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 
<ul>
<li>Part A: Preliminaries <ol>
<li>Mathematical Preliminaries</li> <li>Predicate Logic</li> </ol>
</li> <li>Part B: Semantics of Programming Languages <ol>
<li>Three Simple Programming Languages</li> <li>Fixpoints in Complete Partial Orders</li> <li>Denotational Semantics</li> </ol>
</li> <li>Part C: Program Verification Methods <ol>
<li>Correctness of Programs</li> <li>The Classical Methods of Floyd</li> <li>The Axiomatic Method of Hoare</li> <li>Verification Methods Based on Denotational Semantics</li> <li>LCF A Logic for Computable Functions</li> </ol>
</li> <li>Part D: Prospects <ol>
<li>An Overview of Further Developments</li> </ol>
</li> </ul> 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

The Foundations of Program Verification, 2nd Edition

Sieber, Kurt

Programming

wiley

A first course in computer science, covering the principles of programming languages and their connection to actual computers, supported by examples of algorithms. Presentation relies on the PROSA programming language (which is very similar to Pascal but incorporates changes that simplify and make clear some concepts not found in Pascal). The very accessible development employs attribute grammars to describe the syntax, and an operational approach to define semantics, all of which leads to compilation in a natural way. Contains a large number of examples, theorems, and exercises.

Foundations of Programming Languages

Mehlhorn, Kurt

Wilhelm, Reinhard

Specification of Abstract Data Types provides an authoritative introduction to the mathematical foundations of algebraic program specification. Unlike most other publications on the subject, this book does not draw on category theory, but instead tries to demystify the topic and promote its use in practical applications. It clearly distinguishes between the study of algebras, logic, specification methods and specification languages and it avoids focusing on a particular logic or a particular specification method. After an informal discussion on the design of reliable software, the book presents the main notions and properties of algebras. Next it investigates logic, introducing a general notion of logic, encompassing those commonly used. On the basis of these fundamentals it describes in some detail three specification methods and the principles of specification languages. It concludes with a case study illustrating the use of abstract data type specification in software design. While treating the subject with mathematical precision, the book contains numerous examples, exercises and comments to provide a deeper understanding of concepts discussed. It was conceived as a student textbook but will also be a useful source of reference for researchers and developers using formal specification methods for software design.

Specification of Abstract Data Types (Wiley Teubner on Applicable Theory in Computer Science)

WOLF, MARKUS

Ehrich, Hans-Dieter

Programming Languages

See the best price to sell, buy, or rent books by Loeckx, Jacques. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Loeckx, Jacques