Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 0521169321 ISBN 13: 9780521169325
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2012
ISBN 10: 0521169321 ISBN 13: 9780521169325
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condizione: new. Paperback. 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. Advanced textbook on verification of concurrent programs using a semantic approach which highlights concepts clearly. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Lingua: Inglese
Editore: Cambridge University Press, 2001
ISBN 10: 0521806089 ISBN 13: 9780521806084
Da: Basi6 International, Irving, TX, U.S.A.
Condizione: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
Lingua: Inglese
Editore: Cambridge University Press, 2001
ISBN 10: 0521806089 ISBN 13: 9780521806084
Da: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condizione: 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.
Lingua: Inglese
Editore: Cambridge University Press 2011-10-26, 2011
ISBN 10: 0521169321 ISBN 13: 9780521169325
Da: Chiron Media, Wallingford, Regno Unito
EUR 93,34
Quantità: 10 disponibili
Aggiungi al carrelloPaperback. Condizione: New.
Lingua: Inglese
Editore: Cambridge University Press, 2001
ISBN 10: 0521806089 ISBN 13: 9780521806084
Da: SMASS Sellers, IRVING, TX, U.S.A.
Condizione: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
Lingua: Inglese
Editore: Cambridge University Press, 2001
ISBN 10: 0521806089 ISBN 13: 9780521806084
Da: ALLBOOKS1, Direk, SA, Australia
EUR 131,33
Quantità: 3 disponibili
Aggiungi al carrelloBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 0521169321 ISBN 13: 9780521169325
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 135,18
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: 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.
Lingua: Inglese
Editore: Cambridge University Press, 2001
ISBN 10: 0521806089 ISBN 13: 9780521806084
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2001
ISBN 10: 0521806089 ISBN 13: 9780521806084
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.
Hardcover. Condizione: 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Da: UK BOOKS STORE, London, LONDO, Regno Unito
EUR 287,55
Quantità: 6 disponibili
Aggiungi al carrelloHardcover. Condizione: New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-10 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
Lingua: Inglese
Editore: Cambridge University Press, 2001
ISBN 10: 0521806089 ISBN 13: 9780521806084
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 350,87
Quantità: 1 disponibili
Aggiungi al carrelloBuch. Condizione: 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.
Da: Revaluation Books, Exeter, Regno Unito
EUR 98,08
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: Brand New. 798 pages. 9.02x5.98x1.57 inches. In Stock. This item is printed on demand.
Lingua: Inglese
Editore: Cambridge University Press, 2012
ISBN 10: 0521169321 ISBN 13: 9780521169325
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
EUR 101,38
Quantità: Più di 20 disponibili
Aggiungi al carrelloPaperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 1111.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2012
ISBN 10: 0521169321 ISBN 13: 9780521169325
Da: CitiRetail, Stevenage, Regno Unito
EUR 103,22
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: new. Paperback. 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. Advanced textbook on verification of concurrent programs using a semantic approach which highlights concepts clearly. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2012
ISBN 10: 0521169321 ISBN 13: 9780521169325
Da: AussieBookSeller, Truganina, VIC, Australia
EUR 138,03
Quantità: 1 disponibili
Aggiungi al carrelloPaperback. Condizione: new. Paperback. 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. Advanced textbook on verification of concurrent programs using a semantic approach which highlights concepts clearly. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Lingua: Inglese
Editore: Cambridge University Press, 2010
ISBN 10: 0521169321 ISBN 13: 9780521169325
Da: preigu, Osnabrück, Germania
EUR 111,65
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Concurrency Verification | Introduction to Compositional and Non-Compositional Methods | de Roever Willem-Paul (u. a.) | Taschenbuch | Englisch | 2010 | Cambridge University Press | EAN 9780521169325 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2001
ISBN 10: 0521806089 ISBN 13: 9780521806084
Da: CitiRetail, Stevenage, Regno Unito
EUR 293,27
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: 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.
Lingua: Inglese
Editore: Cambridge University Press, 2011
ISBN 10: 0521806089 ISBN 13: 9780521806084
Da: preigu, Osnabrück, Germania
EUR 292,05
Quantità: 5 disponibili
Aggiungi al carrelloBuch. Condizione: Neu. Concurrency Verification | Introduction to Compositional and Non-Compositional Methods | Willem-Paul de Roever (u. a.) | Buch | Gebunden | Englisch | 2011 | Cambridge University Press | EAN 9780521806084 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.
Lingua: Inglese
Editore: Cambridge University Press, Cambridge, 2001
ISBN 10: 0521806089 ISBN 13: 9780521806084
Da: AussieBookSeller, Truganina, VIC, Australia
EUR 371,56
Quantità: 1 disponibili
Aggiungi al carrelloHardcover. Condizione: 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 Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.