March 2003
Intermediate to advanced
912 pages
27h 17m
English
We have begun to move from the definition of basic mechanisms for synchronization and mutual exclusion to the design of concurrent algorithms. This book does not cover the theory of concurrency but an outline of the factors relevant to proofs of correctness of concurrent programs is in order. The following discussion is taken from Andrews (1991) where the topic is studied in depth.
A property of a program is an attribute that is true of every possible history of that program. There are two fundamental properties: safety and liveness. A safety property asserts that nothing bad happens during execution; a liveness property asserts that something good eventually happens. In sequential programs the key safety ...
Read now
Unlock full access