Verification of sequential and concurrent programs (Texts and monographs in computer science) - Hardcover

Apt, Krzysztof R

Hardcover

ISBN 10: 3540975322 ISBN 13: 9783540975328

Publisher: Springer-Verlag, 1991

Synopsis

This work provides a structured introduction to programme verification and the semantics of structured concurrent programmes. Sequential programmes in the form of deterministic and nondeterministic programmes, and concurrent programmes in the form of parallel and distributed programmes, are considered within the context of their partial and total correctness. The book is appropriate for either a one- or two-term introductory course on programme verification for senior undergraduate studies or for graduate students. It can also be used as an introduction to operational semantics. Outlines of ideas for one-term courses are described in the preface. Within the book, the authors systematically discuss five classes of programmes, concentrating on operational semantics, syntax-directed assertional proof systems, soundness proofs of the proof systems, programme transformations, correctness proofs of the programme transformations and correctness proofs of a substantial example. Each chapter is organized in a systematic manner and ends with a list of exercises. The material presented here draws on work which until now was only available in the form of advanced research publications. This monograph on programme logics and semantics, mathematical logic and normal language and the theory of computation is intended for academics teaching senior undergraduate and graduate-level courses.

About this title

From the Back Cover

Computer programs are an indispensable part of many of the systems we rely upon in our daily lives, and the proper functioning and safety of these systems is of paramount importance. The development of methods that ensure program correctness is therefore a key challenge for computer scientists.

This widely anticipated third edition of Verification of Sequential and Concurrent Programs provides a systematic exploration of one of the most common approaches to program verification, known as the "assertional" approach. Following the successful formula of previous editions, this approach is applied to deterministic and nondeterministic sequential programs of varying complexity, together with both parallel and distributed concurrent programs. The expanded content of this thorough new edition also includes coverage of the verification of object-oriented programs. For each class of programs, the authors introduce an operational semantics and proof systems for the verification of partial and total correctness, justified formally in corresponding soundness theorems. Case studies supplied throughout the book demonstrate the use of the proof systems to formally verify solutions to classical problems, such as sorting, manipulation of lists, producer/consumer and mutual exclusion.

Topics and Features:

• Includes a thorough introductory section, familiarizing the reader with the basic concepts and notation used in the book, as well as the book’s structure
  
• Explains Hoare’s approach to program verification for while programs, providing a correctness proof of a program for partitioning an array (NEW)
  
• Concludes each chapter with exercises and bibliographic remarks for further reading
  
• Discusses recursive programs that extend deterministic programs by parameterless procedures and procedures with the call-by-value parameter mechanism, and provides a correctness proof of the quicksort program (NEW)
  
• Explores nondeterministic and distributed programs, presenting a verification method of distributed programs based on a transformation into nondeterministic ones
  
• Presents object-oriented programs, with a focus on the main characteristics of objects (NEW)
  
• Investigates parallel programs with shared variables and with synchronization
  
• Studies the issue of fairness in the framework of nondeterministic programs, using an approach based on the method of explicit schedulers
  
• Includes a Foreword by Professor Amir Pnueli

This modern update of a classic, reader-friendly textbook is perfect for an introductory course on program verification for advanced undergraduate or graduate students, and may also be used as an introduction to operational semantics. Outlines for possible courses are suggested in the Preface to the book. This book is unique in addressing assertional verification of all essential classes of imperative programs: while programs, recursive programs, object-oriented programs, nondeterministic programs, parallel programs, and distributed programs.

Review

"Specification and verification of programs is increasingly being taught to undergraduate and graduate computer science students. Courses along these lines enable students to understand and reason about programs as formal objects.

a ]this beautifully written and smoothly flowing textbook should serve as a fine candidate for teaching graduate-level and possibly upper-level undergraduate courses on, or with a component on, program verification. a ]the book is self-contained"

(Anish Arora, William Gasarcha (TM)s Book Review Column, SIGACT News)

Edition details

• Publisher: Springer-Verlag
• Publication date: 1991
• ISBN 10: 3540975322
• ISBN 13: 9783540975328
• Binding: Hardcover
• Language: English
• Number of pages: 441