A well-formedness checker for ?CRL

We present an algebraic speciication for the static semantics of the process language CRL. This spec-iication can be executed in the ASF+SDF meta-environment which automatically derives a rewriting system for it. In this way, we immediately obtain a prototype of an enriched type checker (well-formedness checker) for CRL. Our prototype is rather eecient and shows that automatic prototyping of formal speciications is feasible.