ISBN: 9780521806084 - concurrency verification: introduction to compositional and non-compositional methods (cambridge tracts in theoretical computer science) (4 Ergebnisse)

- Hardcover
Anbieter: Majestic Books, Hounslow, Vereinigtes KönigreichMajestic Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 150,48
EUR 7,75 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Zustand: New. pp. 800 Illus.

Concurrency Verification: Introduction to Compositional and Non-compositional Methods (Cambridge Tracts in Theoretical Computer Science, Series Number 54)
Roever, Willem-Paul De; Boer, Frank De; Hanneman, Ulrich; Hooman, Jozef; Lakhnech, Yassine; Poel, Mannes; Zwiers, Job
- Hardcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 318,08
EUR 17,81 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In English.

- Hardcover
Anbieter: Kennys Bookstore, Olney, MD, USAKennys Bookstore
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 413,26
EUR 9,35 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: New. An advanced 2001 textbook on verification of concurrent programs using a semantic approach which highlights concepts clearly. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 800 pages, 5 tables 156 exercises. BIC Classification: UM; UYA. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 228 x 152 x 43. Weight in Grams: 1175. . 2001. hardcover. . . . . Books ship from the US and Ireland.…

- Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 377,05
EUR 44,02 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…