9780521806084 - concurrency verification hardback: introduction to compositional and non-compositional methods: 54 (cambridge tracts in theoretical computer science, series number 54) de roever; boer; hanneman (13 resultados)
Concurrency Verification Introduction to Compositional and Non-compositional Methods
Roever, Willem-Paul De; Boer, Frank De; Hanneman, Ulrich; Hooman, Jozef; Lakhnech, Yassine; Poel, Mannes; Zwiers, Job
- Tapa dura
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de AmericaRomtrade Corp.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 112,43
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
- Tapa dura
Librería: Basi6 International, Irving, TX, Estados Unidos de AmericaBasi6 International
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 112,43
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 3 disponibles
Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Concurrency Verification Introduction to Compositional and Non-compositional Methods
Roever, Willem-Paul De; Boer, Frank De; Hanneman, Ulrich; Hooman, Jozef; Lakhnech, Yassine; Poel, Mannes; Zwiers, Job
- Tapa dura
Librería: SMASS Sellers, IRVING, TX, Estados Unidos de AmericaSMASS Sellers
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 117,84
Gastos de envío gratisSe envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
- Tapa dura
Librería: Books Puddle, New York, NY, Estados Unidos de AmericaBooks Puddle
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 125,81
Envío por EUR 3,45Se envía dentro de Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: New. pp. 800.
- Tapa dura
Librería: Majestic Books, Hounslow, Reino UnidoMajestic Books
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 126,05
Envío por EUR 7,60Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: New. pp. 800 Illus.
- Tapa dura
Librería: Biblios, frankfurt am main, HESSE, AlemaniaBiblios
Contactar con el vendedorVendedor de 4 estrellasCondición: Nuevo
EUR 130,16
Envío por EUR 9,95Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Condición: New. pp. 800.
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
- Tapa dura
Librería: Ria Christie Collections, Uxbridge, Reino UnidoRia Christie Collections
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 283,31
Envío por EUR 14,01Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: New. In.
- Tapa dura
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrlandaKennys Bookshop and Art Galleries Ltd.
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 317,58
Envío por EUR 9,50Se envía de Irlanda a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: 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 E…ducation (US: College). Dimension: 228 x 152 x 43. Weight in Grams: 1175. . 2001. hardcover. . . . .
- Tapa dura
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de AmericaKennys Bookstore
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 401,34
Envío por EUR 9,08Se envía dentro de Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Condición: 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 E…ducation (US: College). Dimension: 228 x 152 x 43. Weight in Grams: 1175. . 2001. hardcover. . . . . Books ship from the US and Ireland.
- Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, AlemaniaAHA-BUCH GmbH
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 350,87
Envío por EUR 66,44Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Buch. Condición: 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 present…ation 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.
- Tapa dura
- Impresión bajo demanda
Librería: Revaluation Books, Exeter, Reino UnidoRevaluation Books
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 300,59
Envío por EUR 17,55Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: Brand New. 798 pages. 9.00x6.25x1.50 inches. In Stock. This item is printed on demand.
- Tapa dura
- Impresión bajo demanda
Librería: moluna, Greven, Alemaniamoluna
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 281,66
Envío por EUR 48,99Se envía de Alemania a Estados Unidos de AmericaCantidad disponible: Más de 20 disponibles
Gebunden. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This 2001 book is an introduction to verifying concurrent programs scaling up to a realistic size. It is self-contained and comprehensive, guiding the reader from advanced undergraduate level. Every method i…s illustrated by examples, and a picture gallery o.
- Tapa dura
- Impresión bajo demanda
Librería: CitiRetail, Stevenage, Reino UnidoCitiRetail
Contactar con el vendedorVendedor de 5 estrellasCondición: Nuevo
EUR 301,22
Envío por EUR 43,28Se envía de Reino Unido a Estados Unidos de AmericaCantidad disponible: 1 disponibles
Hardcover. Condición: new. Hardcover. 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. The book is self-contained, guiding the reader from advanced undergraduate level to the state-of-the-art. Every method is illustrated by examples, and a picture gallery of some of the subject's key figures complements the text. 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. The book is self-contained, guiding the reader from advanced undergraduate level to the state-of-the-art. Every method is illustrated by examples, and a picture gallery of some of the subject's key figures complements the text. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
