Concurrency Verification

Introduction to Compositional and Non-compositional Methods

AvWillem-Paul de Roever,Frank de Boer

Inbunden, Engelska, 2001

Del 54 i serien Cambridge Tracts in Theoretical Computer Science

3 058 kr

Beställningsvara. Skickas inom 7-10 vardagar. Fri frakt över 249 kr.

Fler format och utgåvor

Häftad

1 024 kr

Skickas inom 7-10 vardagar

Beskrivning

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.

Produktinformation

Utgivningsdatum:2001-11-26
Mått:160 x 235 x 43 mm
Vikt:1 175 g
Format:Inbunden
Språk:Engelska
Serie:Cambridge Tracts in Theoretical Computer Science
Antal sidor:800
Förlag:Cambridge University Press
ISBN:9780521806084

Utforska kategorier

Programmeringsböcker inom Data och IT
Systemvetenskap och AI inom Data och IT

Recensioner i media

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

Innehållsförteckning

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.