Synthesis of Self-Timed Circuits by Program Transformation

Abstract
Self-timed circuits can be synthesized from concurrent programs in two logically separate phases. First, through a series of program transformations, the source program is decomposed into an equivalent program constructed entirely from instances of basic processes. These basic processes correspond to the syntactic constructs of the source language. The remainder of the synthesis procedure consists of compiling each of the basic processes into a self-timed circuit using techniques described in earlier papers. These compilations need to be done only once. This paper describes in detail the program transformations used in an automated synthesis procedure developed at Caltech. The transformations used are applications of process decomposition, a simple technique that is easy to verify. The circuits synthesized by these program transformations are correct by construction; thus, this technique provides a simple method for constructing provably correct circuits from a high-level specification.

This publication has 0 references indexed in Scilit: