Translating concurrent programs into delay-insensitive circuits
نویسندگان
چکیده
Erik Brunvand* Carnegie Mellon University Programs written in a subset of occam are automatically translated into delay-insensitive circuits using syntax-directed techniques. The resulting circuits are improved using semantics-preserving circuit-tocircuit transformations. Since each step of the translation process can be proven correct, the resulting circuit behavior is a faithful copy of the original program behavior. A compiler has been constructed that automatically performs the translation and transformation.
منابع مشابه
Delay Insensitive Circuits and Action Systems
The action systems formalism has been successfully used as a formal frame work for reasoning about concurrent behaviour Circuits both synchronous and asynchronous exhibit concurrent behaviour In this paper we com bine the design of asynchronous circuits with action systems We show how quasi delay insensitive circuits can be modelled as action systems This is done by de ning classes of action sy...
متن کاملMechanically Verifying Safety and Liveness Properties of Delay Insensitive Circuits
This paper describes, by means of an example, how one may mechanically verify delay insensitive circuits on an automated theorem prover. It presents the verification of both the safety and liveness properties of an n-node delay insensitive fifo circuit [12]. The proof system used is a mechanized implementation of Unity [3] on the Boyer-Moore prover [1], described in [6, 7, 8]. This paper descri...
متن کاملTranslating Concurrent Programs into Petri Nets for Synthesis of Asynchronous Circuits
We introduce a high-level synthesis methodology to automatically synthesize asynchronous circuits from a concurrent language called ALEPH. ALEPH is a high-level concurrent algorithmic specification that can model complex concurrent control flow, logical and arithmetic computation, and communication. This specification is translated into a Petri net which has actions. These actions are refined t...
متن کاملSynthesizing Iterative Functions into Delay-Insensitive Tree Circuits
Speed, cost and correctness may be the most important factors in designing a digital system. This paper proposes a novel and general methodology to synthesize iterative functions into potentially high speed, low cost and very robust circuits, called delay-insensitive combinational tree iterative circuits. In particular, our methodology can be applied to synthesize binary addition and comparison...
متن کاملAn Algebra for Delay-Insensitive Circuits
A novel process algebra is presented; algebraic expressions specify delay-insensitive circuits in terms of voltage-level transitions on wires. The approach appears to have several advantages over traditional state-graph and production-rule based methods. The wealth of algebraic laws makes it possible to specify circuits concisely and facilitates the verification of designs. Individual component...
متن کامل