Concurrency Verification by Frank Boer
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.-
The Optimal Implementation of Functional Programming Languages
-
Mathematics for Computer Graphics
-
The Clausal Theory of Types
-
Basic Proof Theory
-
Process Algebra
-
Nonmonotonic Reasoning
-
Applications of Process Algebra
- Reasoning about Gossip
-
Belief Revision
-
Mathematical Theory of Domains
-
Process Algebra: Equational Theories of Communicating Processes
-
Initial Algebras and Terminal Coalgebras
-
Rippling: Meta-Level Guidance for Mathematical Reasoning
-
Finite-State Techniques
-
Higher Order Logic and Hardware Verification
-
Formal Methods in Artificial Intelligence
-
Hybrid Graph Theory and Network Analysis
-
Data Refinement
-
Lambda-calculus, Combinators and Functional Programming
-
A Unifying Framework for Structured Analysis and Design Models
-
Design Theory and Computer Science
-
Nets, Terms and Formulas
-
Computational Learning Theory
-
Metamathematics, Machines and Goedel's Proof
-
Formal Specification and Design
-
The Logic of Typed Feature Structures
-
Free Choice Petri Nets
-
Two-Level Functional Languages
-
Basic Simple Type Theory
-
Term Rewriting Systems
-
The Uncertain Reasoner's Companion
-
Deductive and Declarative Programming
-
Information Flow
-
Domains and Lambda-Calculi
-
Formal Semantics and Pragmatics for Natural Language Querying
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 fur Mathematik und ihre Grenzgebiete Mathematics Abstracts
| SKU | Unavailable |
| ISBN 13 | 9780521169325 |
| ISBN 10 | 0521169321 |
| Title | Concurrency Verification |
| Author | Ulrich Hanneman |
| Series | Cambridge Tracts In Theoretical Computer Science |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Cambridge University Press |
| Year published | 2012-01-26 |
| Number of pages | 800 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |