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 Zwiersen Limba Engleză Paperback – 25 ian 2012
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 542.23 lei 6-8 săpt. | |
Cambridge University Press – 25 ian 2012 | 542.23 lei 6-8 săpt. | |
Hardback (1) | 1573.22 lei 6-8 săpt. | |
Cambridge University Press – 25 noi 2001 | 1573.22 lei 6-8 săpt. |
Din seria Cambridge Tracts in Theoretical Computer Science
- 20% Preț: 490.79 lei
- 20% Preț: 486.27 lei
- 20% Preț: 502.38 lei
- 20% Preț: 355.71 lei
- 20% Preț: 377.22 lei
- 20% Preț: 268.19 lei
- 20% Preț: 273.24 lei
- 20% Preț: 487.99 lei
- 20% Preț: 622.53 lei
- 11% Preț: 509.34 lei
- 20% Preț: 378.32 lei
- 20% Preț: 196.37 lei
- 20% Preț: 444.60 lei
- 20% Preț: 321.53 lei
- 20% Preț: 389.91 lei
- 20% Preț: 319.39 lei
- 20% Preț: 322.04 lei
- 20% Preț: 453.03 lei
- 20% Preț: 254.65 lei
- 20% Preț: 313.04 lei
- 20% Preț: 267.54 lei
- 20% Preț: 321.87 lei
- 20% Preț: 379.83 lei
- 20% Preț: 355.60 lei
- 20% Preț: 357.90 lei
- 20% Preț: 296.25 lei
- Preț: 372.97 lei
- 20% Preț: 334.54 lei
- 20% Preț: 359.58 lei
- 20% Preț: 277.21 lei
- 20% Preț: 431.42 lei
- 20% Preț: 278.44 lei
- 20% Preț: 300.52 lei
- 20% Preț: 612.71 lei
- 20% Preț: 407.01 lei
- 20% Preț: 387.43 lei
- 20% Preț: 267.04 lei
- 20% Preț: 389.78 lei
Preț: 542.23 lei
Preț vechi: 677.79 lei
-20% Nou
Puncte Express: 813
Preț estimativ în valută:
103.77€ • 107.05$ • 87.82£
103.77€ • 107.05$ • 87.82£
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
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.