Del 54 - Cambridge Tracts in Theoretical Computer Science

Concurrency Verification

Introduction to Compositional and Non-compositional Methods

Inbunden, Engelska, 2001

AvWillem-Paul de Roever,Frank de Boer,Ulrich Hanneman,Jozef Hooman,Yassine Lakhnech,Mannes Poel,Job Zwiers,Germany) Roever, Willem-Paul de (Christian-Albrechts Universitat zu Kiel,The Netherlands) Boer, Frank de (Universiteit Utrecht,The Netherlands) Hanneman, Ulrich (Katholieke Universiteit Nijmegen,The Netherlands) Hooman, Jozef (Katholieke Universiteit Nijmegen,Grenoble) Lakhnech, Yassine (Universite Joseph Fourier,The Netherlands) Poel, Mannes (University of Twente, Enschede,The Netherlands) Zwiers, Job (University of Twente, Enschede,Willem-Paul de Roever,Frank de Boer

3 949 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

Finns i fler format (1)

Häftad

1 329 kr

Skickas inom 10-15 vardagar

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

Utgivningsdatum2001-11-26
Mått160 x 235 x 43 mm
Vikt1 175 g
FormatInbunden
SpråkEngelska
SerieDel 54 i Cambridge Tracts in Theoretical Computer Science
Antal sidor800
FörlagCambridge University Press
ISBN9780521806084

Tillhör följande kategorier

Nätverk och kommunikation inom Data och it
Programmeringsböcker inom Data och it
Systemvetenskap och AI inom Data och it

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.