Description
Concurrency Verification
Introduction to Compositional and Non-compositional Methods
Cambridge Tracts in Theoretical Computer Science Series
Authors: Roever Willem-Paul de, Boer Frank de, Hanneman Ulrich, Hooman Jozef, Lakhnech Yassine, Poel Mannes, Zwiers Job
An advanced 2001 textbook on verification of concurrent programs using a semantic approach which highlights concepts clearly.
Language: EnglishSubject for Concurrency Verification:
89.57 €
In Print (Delivery period: 14 days).
Add to cart the book of Roever Willem-Paul de, Boer Frank de, Hanneman Ulrich, Hooman Jozef, Lakhnech Yassine, Poel Mannes, Zwiers Job
Concurrency verification: introduction to compositional and non-compositional methods
Publication date: 01-2012
800 p. · 15.2x22.9 cm · Paperback
Publication date: 01-2012
800 p. · 15.2x22.9 cm · Paperback
Approximative price 275.03 €
Subject to availability at the publisher.
Add to cart the book of Roever Willem-Paul de, Boer Frank de, Hanneman Ulrich, Hooman Jozef, Lakhnech Yassine, Poel Mannes, Zwiers Job
Concurrency verification
Publication date: 11-2001
800 p. · 16x23.5 cm · Hardback
Publication date: 11-2001
800 p. · 16x23.5 cm · Hardback
Description
/li>Contents
/li>
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.
© 2024 LAVOISIER S.A.S.