Verification of Sequential and Concurrent Programs

Computer programs are becoming more and more part of systems that we use to rely on in our daily lives. The proper functioning and safety of these systems is of paramount importance. A major challenger for computer science is to develop methods that ensure program correctness. This textbook provides a structured introduction to program verification using an assertional approach - so named because it relies on the use of assertions that are attached to program control points. Sequential programs in the form of deterministic and nondeterministic programs, and concurrent programs in the form of parallel and distributed programs are considered within the context of their partial and total correctness. The use of these proof systems is demonstrated with the help of case studies. In particular solutions to classical problems such as mutual exclusion are formally verified. Each chapter concludes with exercises and bibliographic remarks for further reading. As a result, this text will be appropriate for either an introductory course on program verification for upper division of undergraduate studies or for graduate studies. It can also be used as an introduction to operational semantics. Outlines of possible courses are presented in the preface of the book. Front Matter....Pages i-xvii Introduction....Pages 1-14 Preliminaries....Pages 15-45 Deterministic Programs....Pages 47-99 Disjoint Parallel Programs....Pages 101-124 Parallel Programs with Shared Variables....Pages 125-167 Parallel Programs with Synchronization....Pages 169-211 Nondeterministic Programs....Pages 213-233 Distributed Programs....Pages 235-270 Fairness....Pages 271-323 Back Matter....Pages 325-364 From the contents: Preface Introduction Preliminaries Deterministic Programs Disjoint parallel programs Parallel programs with shared variables Parallel programs with synchronization Nondeterministic programs Distributed programs Fairness Appendices References.