• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Concurrency Verification: Introduction to Compositional and Non-Compositional Methods

Concurrency Verification: Introduction to Compositional and Non-Compositional Methods

Paperback

Series: Cambridge Tracts in Theoretical Computer Science, Book 54

Programming

ISBN10: 0521169321
ISBN13: 9780521169325
Publisher: Cambridge University Press
Published: Jan 26 2012
Pages: 800
Weight: 2.31
Height: 1.59 Width: 6.00 Depth: 9.00
Language: English
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.

1 different editions

Also available

Also in

Programming