Concurrency Verification
Introduction to Compositional and Non-compositional Methods

An advanced 2001 textbook on verification of concurrent programs using a semantic approach which highlights concepts clearly.

Willem-Paul de Roever (Author), Frank de Boer (Author), Ulrich Hanneman (Author), Jozef Hooman (Author), Yassine Lakhnech (Author), Mannes Poel (Author), Job Zwiers (Author)

9780521169325, Cambridge University Press

Paperback, published 26 January 2012

800 pages
22.9 x 15.2 x 4 cm, 1.05 kg

Review of the hardback: 'The present textbook is a highly welcome addition to the existing literature on program verification, particularly valuable for the well-arranged, methodically unified framework for a wealth of material.' Zentralblatt für Mathematik und ihre Grenzgebiete Mathematics Abstracts

This is a systematic and comprehensive introduction both to compositional proof methods for the state-based verification of concurrent programs, such as the assumption-commitment and rely-guarantee paradigms, and to noncompositional methods, whose presentation culminates in an exposition of the communication-closed-layers (CCL) paradigm for verifying network protocols. Compositional concurrency verification methods reduce the verification of a concurrent program to the independent verification of its parts. If those parts are tightly coupled, one additionally needs verification methods based on the causal order between events. These are presented using CCL. The semantic approach followed here allows a systematic presentation of all these concepts in a unified framework which highlights essential concepts. This 2001 book is self-contained, guiding the reader from advanced undergraduate level. Every method is illustrated by examples, and a picture gallery of some of the subject's key figures complements the text.

Preface
Part I. Introduction and Overview: 1. Introduction
Part II. The Inductive Assertion Method: 2. Floyd's inductive assertion method for transition diagrams
3. The inductive assertion method for shared-variable concurrency
4. The inductive assertion method for synchronous message passing
5. Expressibility and relative completeness
Part III. Compositional Proof Methods: 6. Introduction to compositional reasoning
7. Compositional proof methods: synchronous message passing
8. Compositional proof methods: shared-variable concurrency
Part IV. Hoare Logic: 9. A proof system for sequential programs using Hoare triples
10. A Hoare logic for shared-variable concurrency
11. A Hoare logic for synchronous message passing
Part V. Layered Design: 12. Transformational design and Hoare logic
Bibliography
Glossary of symbols
Index.

Subject Areas: Mathematical theory of computation [UYA]