Occam & CSP

The occam language provides for ‘clean’ implementations of such processes

• developed by David May (and others) at Inmos [1] (1983), last commercial revision was occam2.1 [2] (1995)

• strict parallel-usage and aliasing checks give strong safety guarantees
i.e. freedom from race-hazard errors

• remaining issues include: deadlock, live lock and starvation CSP is the underlying process algebra, used to formally reason about the
behavior of occam processes

• developed by Tony Hoare [3, 4], standard text (currently) by Bill Roscoe [5] The mapping between CSP and occam is not an exact fit

• but is sufficiently complete for reasoning about occam programs.