VLSI design is viewed as a programming activity. VLSI programs are described in CP-0 (Communicating Process-level 0), essentially a subset of CSP. By means of a few simple examples the authors introduce the CP-0 program notation and discuss its compatibility with VLSI. With larger examples (block sorters and FIR filters) they demonstrate how CP-0 programs can be derived from formal specifications and how to comply with performance-related requirements.>

To make silicon as an implementation medium accessible to system designers, the Philips approach requires an interface between the system-level and algorithmic concerns on the one hand and the more physical concerns on the other hand. The CP-0 programming language is proposed as such an interface. The actual design amounts to the translation of system requirements into a CP-0 program, for which the term VLSI programming is proposed. A silicon compiler subsequently transforms the CP-0 program into a VLSI layout and a test trace. Other issues considered include the implementation of delay-insensitive circuits, testing, and the use of 'zoom and pan' (ZaP) as a vehicle.>

The closure statement is the basic statement when programming with assooons Its execution may revolve a very high degree of concurrencyThe state of a computation ~s represented as a set of assocmns.The closure statement transforms this set into a closure thereof.The defimtmn and the mathematical properUes of these closures are presented Dljkstra's weakest precondmons are used to define the semanUcs of the closure statement In terms of the closure concept The theorems on closures are then translated into theorems on closure statements It is shown, by means of four examples, how these theorems can be used for the construction of correct assocmn programs.

A program notation without variables is proposed.The state of a computation is recorded as a set of "associons."Each associon is a tuple of names representing a relation between the entities with those names.The state of the computation can be changed by the creation of new associons representing new relations deducible from those already recorded.The building block prescribing such deductions is called the "closure statement."The notation proposed is the result of our search for a basic statement the execution of which may employ more concurrency than is the case for the traditional assignment statement.Some possible extensions to the notation are discussed.