- Full Description
This widely anticipated third edition provides a systematic exploration of one of the most common approaches to program verification, known as the assertional approach. This approach is applied to deterministic and nondeterministic sequential programs of varying complexity, together with both parallel and distributed concurrent programs. The expanded content also includes coverage of the verification of object-oriented programs. For each class of programs, the authors introduce 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 and formally verify solutions to classical problems, such as producer/consumer and mutual exclusion. This modern update of a classic, reader-friendly textbook is perfect for an introductory course on program verification for advanced undergraduate or graduate students. Outlines for possible courses are suggested in the Preface.
- Table of Contents
Table of Contents
- Part I: In the Beginning.
- Part II: Deterministic Programs.
- while Programs.
- Recursive Programs.
- Recursive Programs with Parameters.
- Oriented Programs.
- Part III: Parallel Programs.
- Disjoint Parallel Programs.
- Parallel Programs with Shared Variables.
- Parallel Programs with Synchronization.
- Part IV: Nondeterministic and Distributed Programs.
- Nondeterministic Programs.
- Distributed Programs.
If you think that you've found an error in this book, please let us know by emailing to firstname.lastname@example.org . You will find any confirmed erratum below, so you can check if your concern has already been addressed. No errata are currently published