Concurrency Verification: Introduction to Compositional and Non-compositional Methods (Cambridge Tracts in Theoretical Computer Science, Series Number 54)

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. The book is self-contained, guiding the reader from advanced undergraduate level to the state-of-the-art. Every method is illustrated by examples, and a picture gallery of some of the subject's key figures complements the text.

This is the first introduction to the problem of verifying concurrent programs scaling up to a realistic size. The compositional proof methods described reduce the problem to the independent verification of the program's parts. The semantic approach allows a systematic presentation in a unified framework, highlighting essential concepts. The book is self-contained and comprehensive, guiding the reader from advanced undergraduate level to the state-of-the-art. Every method is illustrated by examples, and a picture gallery of some of the subject's key figures complements the text.