Isbn: 9780521169325 - concurrency verification: introduction to compositional and non-compositional methods: 54 (cambridge tracts in theoretical computer science, series number 54) (14 resultados)

Condición: New.

Condición: New.

Condición: As New. Unread book in perfect condition.

Paperback. Condición: New.

Condición: New.

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, black & white illustrations. BIC Classification: UYA. Category: (UP) Postgraduate, Research & Scholarly. Dimension: 228 x 154 x 42. Weight in Grams: 1066. . 2012. paperback. . . . . …

Condición: New. In English.

Condición: As New. Unread book in perfect condition.

Paperback. Condición: New. 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.…

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, black & white illustrations. BIC Classification: UYA. Category: (UP) Postgraduate, Research & Scholarly. Dimension: 228 x 154 x 42. Weight in Grams: 1066. . 2012. paperback. . . . . Books ship from the US and Ireland. …

Paperback. Condición: New. 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.…

Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Paperback. Condición: 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. 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. 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 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.…

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 is illustrated by examples, and a picture gallery o.…