## Compressor Memory (1995)

### BibTeX

@MISC{Edwards95compressormemory,

author = {Stephen A. Edwards},

title = {Compressor Memory},

year = {1995}

}

### OpenURL

### Abstract

Electronic systems are becoming more complex. Using subproblem-specific languages simplifies their design, but presents the problem of connecting the parts. I propose a system description scheme for reactive systems (systems that maintain a dialog with their environment) that supports such heterogeneity. I expect to contribute the system description scheme, a mathematical framework for it, a set of efficient algorithms for simulating these systems, and a practical implementation of the scheme. My prototype compiler suggests this scheme can be made practical, and the mathematical framework is nearly complete. I expect this work to make designing complex, heterogeneous reactive systems fast and simple. Buttons,

### Citations

2225 | Statecharts: A Visual Formalism for Complex Systems
- Harel
- 1987
(Show Context)
Citation Context ...l statements. Lustre [12] is a textual declarative language with dataflowstyle semantics. Signal [17] is a textual relational language, also with a dataflow flavor. Argos, a derivative of Statecharts =-=[13]-=-, is a graphical hierarchical finite state machine language. Compilers for these languages have been developed around common intermediate formats [21]. Esterel and Argos are translated into an imperat... |

839 |
The Semantics of a Simple Language for Parallel Programming
- Kahn
- 1974
(Show Context)
Citation Context ...a system under development is broken into independently-compiled source files, which are connected later using little knowledge of their contents. Kahn’s network of communicating concurrent processes =-=[15]-=- are deterministic because of a simple constraint on process interfaces. The Ptolemy system [6] also takes a heterogeneous approach to connect systems specified using different computational paradigms... |

698 | The Esterel synchronous programming language: Design, semantics, implementation
- Berry, Gonthier
- 1992
(Show Context)
Citation Context ... the system in every time step. Two other schemes have been devised to do this, but neither support heterogeneity. A diverse collection of languages have evolved around synchronous semantics. Esterel =-=[4]-=- is a textual imperative language with concurrent and sequential statements. Lustre [12] is a textual declarative language with dataflowstyle semantics. Signal [17] is a textual relational language, a... |

523 | The synchronous dataflow programming language LUSTRE
- Halbwachs, Caspi, et al.
- 1991
(Show Context)
Citation Context ...ther support heterogeneity. A diverse collection of languages have evolved around synchronous semantics. Esterel [4] is a textual imperative language with concurrent and sequential statements. Lustre =-=[12]-=- is a textual declarative language with dataflowstyle semantics. Signal [17] is a textual relational language, also with a dataflow flavor. Argos, a derivative of Statecharts [13], is a graphical hier... |

380 | The synchronous approach to reactive and real-time systems
- Berry, Benveniste
- 1991
(Show Context)
Citation Context ...hnique. A A = not B B A B B = A Figure 6: A contradictory zero-delay specification. 2 Benveniste and Berry provide an excellent overview of this approach in a special issue of Proceedings of the IEEE =-=[2]-=-. 33.2 CPOs and Monotonic Functions To formally describe the semantics of my specifications, I use the concepts of complete partial orders and monotonic functions from the theory of program semantics... |

317 |
On the development of reactive systems
- Harel, Pnueli
- 1985
(Show Context)
Citation Context ...h as to preclude all. The inter-task communication scheme I adopt was developed by others for specifying reactive systems 1 — systems that maintain an ongoing dialog with their envi1 Harel and Pnueli =-=[14]-=- coined the term. 1ronment. In these systems, when things happen is as important as what happens. Many important systems fit this mold, including those with complex user interfaces (e.g., digital wat... |

238 |
The Formal Semantics of Programming Languages, an introduction. Foundations of Computing
- Winskel
- 1993
(Show Context)
Citation Context ...visualization of the effect of a monotonic function is shown in Figure 8. 3 Scott and Strachey [19] pioneered this field. Modern-day books on the subject include Allison [1], Gunter [11], and Winskel =-=[22]-=- y x f f f(y) f(x) Figure 8: The effect of a monotonic function. If there is a path from x to y, then there is a similar path from f(x)to f(y). 3.3 The Least Fixed Point Theorem The following well-kno... |

206 | Scheduling dynamic dataflow graphs with bounded memoryusingtheToken Flow Model
- Buck
- 1993
(Show Context)
Citation Context ...eatly accelerating things. However, the higher overhead may cancel out such gains. Applicable existing scheduling techniques are numerous. The clustering scheme used in Buck’s boolean dataflow domain =-=[7]-=- might find application here. Shiple et al. adopt Bourdoncle’s Weak Topological Ordering scheme [5] to accelerate a similar problem. Similar problems can be found throughout engineering. For example, ... |

160 |
The UNIX Programming Environment
- Kernighan, Pike
- 1984
(Show Context)
Citation Context ...tem development environments. One Interfaces: defined Communication: defined Contents: arbitrary Figure 2: A heterogeneous specification scheme. well-known example is the UNIX programming environment =-=[16]-=-. Here, a system under development is broken into independently-compiled source files, which are connected later using little knowledge of their contents. Kahn’s network of communicating concurrent pr... |

147 |
Semantics of Programming Languages
- Gunter
- 1992
(Show Context)
Citation Context ... for all x;y2S. A visualization of the effect of a monotonic function is shown in Figure 8. 3 Scott and Strachey [19] pioneered this field. Modern-day books on the subject include Allison [1], Gunter =-=[11]-=-, and Winskel [22] y x f f f(y) f(x) Figure 8: The effect of a monotonic function. If there is a path from x to y, then there is a similar path from f(x)to f(y). 3.3 The Least Fixed Point Theorem The ... |

136 |
Towards a Mathematical Semantics of Computer Languages
- Scott, Strachey
- 1971
(Show Context)
Citation Context ...otonic function f : S!S on a finite complete partial order(S;v;?) satisfies xvy implies for all x;y2S. A visualization of the effect of a monotonic function is shown in Figure 8. 3 Scott and Strachey =-=[19]-=- pioneered this field. Modern-day books on the subject include Allison [1], Gunter [11], and Winskel [22] y x f f f(y) f(x) Figure 8: The effect of a monotonic function. If there is a path from x to y... |

124 | Efficient chaotic iteration strategies with widenings
- Bourdoncle
- 1993
(Show Context)
Citation Context ...ing scheduling techniques are numerous. The clustering scheme used in Buck’s boolean dataflow domain [7] might find application here. Shiple et al. adopt Bourdoncle’s Weak Topological Ordering scheme =-=[5]-=- to accelerate a similar problem. Similar problems can be found throughout engineering. For example, Buhl et al.’s SPARK system for solving nonlinear differential algebraic systems [8] addresses exact... |

65 |
Analysis of cyclic combinational circuits
- Malik
- 1993
(Show Context)
Citation Context ... an Esterel program into a cyclic boolean network [3]. This is transformed into an acyclic boolean network by an implicit version [20] of Malik’s procedure for analyzing cyclic combinational circuits =-=[18]-=-. This analysis is probably NP-complete, but in practice is fast enough for programs of reasonable size. The proof of Theorem 1 suggests the execution scheme I propose. A convergent iteration, it star... |

63 | A hardware implementation of pure Esterel
- Berry
- 1991
(Show Context)
Citation Context ...th 32 states can take fifteen minutes to compile and produce a ten-megabyte executable [10]. The latest Esterel compiler from Berry’s group translates an Esterel program into a cyclic boolean network =-=[3]-=-. This is transformed into an acyclic boolean network by an implicit version [20] of Malik’s procedure for analyzing cyclic combinational circuits [18]. This analysis is probably NP-complete, but in p... |

29 |
A Practical Introduction to Denotational Semantics
- Allison
- 1986
(Show Context)
Citation Context ... xvy implies for all x;y2S. A visualization of the effect of a monotonic function is shown in Figure 8. 3 Scott and Strachey [19] pioneered this field. Modern-day books on the subject include Allison =-=[1]-=-, Gunter [11], and Winskel [22] y x f f f(y) f(x) Figure 8: The effect of a monotonic function. If there is a path from x to y, then there is a similar path from f(x)to f(y). 3.3 The Least Fixed Point... |

17 |
Le Borgne, and Claude Le Maire. Programming real-time applications with
- Guernic, Gautier, et al.
- 1991
(Show Context)
Citation Context ...round synchronous semantics. Esterel [4] is a textual imperative language with concurrent and sequential statements. Lustre [12] is a textual declarative language with dataflowstyle semantics. Signal =-=[17]-=- is a textual relational language, also with a dataflow flavor. Argos, a derivative of Statecharts [13], is a graphical hierarchical finite state machine language. Compilers for these languages have b... |

12 | Ptolemy: a mixed-paradigm simulation=prototyping platform
- Buck, Ha, et al.
- 1991
(Show Context)
Citation Context ...matical framework for it, a set of scheduling algorithms for quickly simulating systems described in it, and a practical implementation of the scheme in the existing multilanguage environment Ptolemy =-=[6]-=-. In the following sections, I discuss my specification scheme (Section 2), its mathematical framework (Section 3), and issues in its implementation (Section 4). Section 5 concludes with a description... |

6 |
Hervé Touati. Constructive analysis of cyclic circuits
- Shiple, Berry
- 1996
(Show Context)
Citation Context ...utable [10]. The latest Esterel compiler from Berry’s group translates an Esterel program into a cyclic boolean network [3]. This is transformed into an acyclic boolean network by an implicit version =-=[20]-=- of Malik’s procedure for analyzing cyclic combinational circuits [18]. This analysis is probably NP-complete, but in practice is fast enough for programs of reasonable size. The proof of Theorem 1 su... |

4 |
Recent improvements in SPARK: Strong component decomposition, multivalued objects, and graphical interface
- Buhl, Erdem, et al.
- 1993
(Show Context)
Citation Context ...Ordering scheme [5] to accelerate a similar problem. Similar problems can be found throughout engineering. For example, Buhl et al.’s SPARK system for solving nonlinear differential algebraic systems =-=[8]-=- addresses exactly this problem. A optimal solutionmay be expensive, however, since the minimum feedback arc set problem is NP-complete for planar graphs. As a proof of concept, I have written a compi... |

3 | An Esterel compiler for a synchronous/reactive development system
- Edwards
- 1994
(Show Context)
Citation Context ...ally long compilation times and exponentially large executables. Using this scheme, a small (600-line) program with 32 states can take fifteen minutes to compile and produce a ten-megabyte executable =-=[10]-=-. The latest Esterel compiler from Berry’s group translates an Esterel program into a cyclic boolean network [3]. This is transformed into an acyclic boolean network by an implicit version [20] of Mal... |

2 |
Effective heterogeneousdesign and cosimulation
- Chang, Klavade, et al.
- 1995
(Show Context)
Citation Context ...so imposed. The objective of this technique is to maintain a high level of abstraction while allowing a reasonable amount of analysis. Chang, Kalavade, and Lee discuss this approach at greater length =-=[9]-=-. This approach is especially useful for describing large systems. For many whole-system analyses, complex module contents may be ignored, greatly simplifying the problem. Moreover, new module specifi... |