Concurrency Verification: Introduction to Compositional and Non-compositional Methods: 54 (Cambridge Tracts in Theoretical Computer Science, Series Number 54) - Image 1

£91.42

Cambridge University Press Concurrency Verification: Introduction to Compositional and Non-compositional Methods: 54 (Cambridge Tracts in Theoretical Computer Science, Series Number 54)

Name: Concurrency Verification: Introduction to Compositional and Non-compositional Methods: 54 (Cambridge Tracts in Theoretical Computer Science, Series Number 54)
Brand: Cambridge University Press
Price: 91.42 GBP
Availability: InStock

5 tables 156 exercises

Architecture & Microprocessors

This is the usual price. Wait for it to drop, or tell us your number.

£91 today · usual range £0–£0 · best ever £82

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 613 days • 613 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 613 days • 4 price ranges

Days at Price

Current Price

Price Analysis

Most common range: £82-108 (417 days, 68.0%)

Price range: £82 - £212

Price levels: 4 price ranges over 613 days

Description

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. Review 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 Book Description An advanced 2001 textbook on verification of concurrent programs using a semantic approach which highlights concepts clearly.

Product Specifications

Brand: Cambridge University Press
Model: 5 tables 156 exercises
Format: Hardcover
ASIN: 0521806089
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 26 November 2001
Listed Since: 09 February 2007

Barcode

No barcode data available

Cambridge University Press Concurrency Verification: Introduction to Compositional and Non-compositional Methods: 54 (Cambridge Tracts in Theoretical Computer Science, Series Number 54)

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Theories of Programming: The Life and Works of Tony Hoare (ACM Collection II)

Verification of Sequential and Concurrent Programs (Texts in Computer Science)

Mathematical Techniques for Analyzing Concurrent and Probabilistic Systems (CRM Monograph Series)

Temporal Verification of Reactive Systems: Safety

Concurrent and Real-time Systems: The CSP Approach (Worldwide Series in Computer Science)

Verification of Reactive Systems: Formal Methods and Algorithms (Texts in Theoretical Computer Science. An EATCS Series)

Understanding Concurrent Systems (Texts in Computer Science)

Formalization of Complex Analysis and Matrix Theory

Software Verification Based on Game Semantics and Process Algebra: A Game Semantic Framework for Verifying Safety Properties of Open Programs

Automatic Verification of Sequential Infinite-State Processes: 1354 (Lecture Notes in Computer Science, 1354)

Program Verification: Fundamental Issues in Computer Science: 14 (Studies in Cognitive Systems, 14)

Program Verification: Fundamental Issues in Computer Science: 14 (Studies in Cognitive Systems, 14)

Principles of Model Checking

Communicating Sequential Processes. The First 25 Years: Symposium on the Occasion of 25 Years of CSP, London, UK, July 7-8, 2004. Revised Invited Papers

Concurrency 88: International Conference on Concurrency Hamburg, FRG, October 18-19, 1988. Proceedings: 335 (Lecture Notes in Computer Science, 335)

Formal Methods in Computer Science (Textbooks in Mathematics)

Verification of Digital and Hybrid Systems: 170 (NATO ASI Subseries F:, 170)

Model Checking (Cyber Physical Systems Series)

Computer Aided Verification: 21st International Conference, CAV 2009, Grenoble, France, June 26 - July 2, 2009, Proceedings: 5643 (Lecture Notes in Computer Science, 5643)

Scalable Hardware Verification with Symbolic Simulation

Computer–Aided Verification of Coordinating Processes – The Automata–Theoretic Approach (Princeton Series in Computer Science)

Certified Programming with Dependent Types: A Pragmatic Introduction to the Coq Proof Assistant

Computer-Aided Verification: A Special Issue of Formal Methods In System Design on Computer-Aided Verification

NASA Formal Methods: 11th International Symposium, NFM 2019, Houston, TX, USA, May 7–9, 2019, Proceedings: 11460 (Lecture Notes in Computer Science, 11460)