Cantitate/Preț
Produs

Concurrency Verification

Autor de Roever Willem-Paul, de Boer Frank, Hanneman Ulrich
en Limba Engleză Paperback – 20 oct 2010
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.
Citește tot Restrânge

Preț: 56779 lei

Preț vechi: 70973 lei
-20%

Puncte Express: 852

Carte tipărită la comandă

Livrare economică 18 iulie-01 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit pentru acest produs Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.

Specificații

ISBN-13: 9780521169325
ISBN-10: 0521169321
Pagini: 800
Dimensiuni: 152 x 229 x 42 mm
Greutate: 1.14 kg
Editura: Cambridge University Press
Locul publicării:Cambridge, United Kingdom

Cuprins

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.

Recenzii

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

Descriere

An advanced 2001 textbook on verification of concurrent programs using a semantic approach which highlights concepts clearly.