Cantitate/Preț
Produs

Concurrency Verification: Introduction to Compositional and Non-compositional Methods: Cambridge Tracts in Theoretical Computer Science, cartea 54

Autor Willem-Paul de Roever, Frank de Boer, Ulrich Hanneman, Jozef Hooman, Yassine Lakhnech, Mannes Poel, Job Zwiers
en Limba Engleză Paperback – 25 ian 2012
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

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 54223 lei  6-8 săpt.
  Cambridge University Press – 25 ian 2012 54223 lei  6-8 săpt.
Hardback (1) 157322 lei  6-8 săpt.
  Cambridge University Press – 25 noi 2001 157322 lei  6-8 săpt.

Din seria Cambridge Tracts in Theoretical Computer Science

Preț: 54223 lei

Preț vechi: 67779 lei
-20% Nou

Puncte Express: 813

Preț estimativ în valută:
10377 10705$ 8782£

Carte tipărită la comandă

Livrare economică 05-19 martie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780521169325
ISBN-10: 0521169321
Pagini: 800
Dimensiuni: 152 x 229 x 40 mm
Greutate: 1.05 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Cambridge Tracts in Theoretical Computer Science

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.