Reasoning in CSP via the HOL theorem prover

A proof tool developed for CSP by customizing an existing general-purpose theorem prover based on higher order logic is described, and it is demonstrated how it can be used to conduct formal reasoning about CSP. The focus is on illustrating the usefulness of the approach. It is shown how reasoning about CSP can be done using a natural deduction theorem prover by illustrating how some standard CSP laws can be mechanically proved from semantic definitions mechanized previously by the author (1990).<
>