2 The Sieve of Erathostenes
3 Prints all prime numbers up to PRIME_MAX
7 chan count = [0] of { int };
10 proctype sieve(chan c; int prime)
19 /* found a new prime */
20 printf("MSC: %d\n", i);
22 chan child = [0] of { int };
28 /* i is divisible by prime */
37 :: (tries < PRIME_MAX) -> count!tries; tries++
38 :: (tries >= PRIME_MAX) -> break