|
A nice discussion of the requirements from good programming building blocks (e.g., algebraic properties). Hoare defines three concurrency operators (or program structures): P first Q (run whichever starts first), P both Q (run them concurrently) and P any Q (non-deterministic choice). Hoare briefly talks about the properties of these operators.
Also check out the lecture given a week earlier: Concurrent programs wait faster.
Favorite quote: Now there are large sections of Microsoft code that contain no goto's. 
Posted to theory by Ehud Lamm on 1/1/03; 2:09:07 PM
|
Tony Hoare: Structured concurrent programming
