Skip to content
Register Sign in Wishlist
Look Inside Concurrency Verification

Concurrency Verification
Introduction to Compositional and Non-compositional Methods

$108.00 (C)

Part of Cambridge Tracts in Theoretical Computer Science

  • Date Published: January 2012
  • availability: Available
  • format: Paperback
  • isbn: 9780521169325

$ 108.00 (C)

Add to cart Add to wishlist

Other available formats:

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact providing details of the course you are teaching.

Product filter button
About the Authors
  • 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.

    • The semantic approach highlights essential concepts without syntactic overhead, and simplifies soundness and completeness proofs
    • A detailed introduction to compositional proof methods each of which is proved to be sound and (semantically) complete
    • Every method is illustrated by many examples, and a picture gallery of key figures complements the text
    Read more

    Reviews & endorsements

    "It is capable of replacing a multitude of original articles...with one coherent text. Wherever appropriate, however, the book does refer in detail to original research, and includes many historical hints. It also provides a rich choice of exercises." Computing Reviews

    "The book gives a very comprehensive presentation of what we know so far about proving concurrent systems...It gives an excellent survey of the field and lots of examples and technical details." Mathematical Reviews

    See more reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: January 2012
    • format: Paperback
    • isbn: 9780521169325
    • length: 800 pages
    • dimensions: 229 x 152 x 40 mm
    • weight: 1.05kg
    • availability: Available
  • Table of Contents

    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
    Glossary of symbols

  • Resources for

    Concurrency Verification

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

    General Resources

    Find resources associated with this title

    Type Name Unlocked * Format Size

    Showing of

    Back to top

    This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors should sign in to or register for a Cambridge user account.

    Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other instructors may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.

    Supplementary resources are subject to copyright. Instructors are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.

    If you are having problems accessing these resources please contact

  • Authors

    Willem-Paul de Roever, Christian-Albrechts Universität zu Kiel, Germany

    Frank de Boer, Universiteit Utrecht, The Netherlands

    Ulrich Hanneman, Katholieke Universiteit Nijmegen, The Netherlands

    Jozef Hooman, Katholieke Universiteit Nijmegen, The Netherlands

    Yassine Lakhnech, Université Joseph Fourier, Grenoble

    Mannes Poel, University of Twente, Enschede, The Netherlands

    Job Zwiers, University of Twente, Enschede, The Netherlands

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.