7197 search results - page 1062 / 1440 » On the computational power of BlenX |
145
click to vote
MFCS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. We consider the iterates of bilinear functions over the semiring (max, +). Equivalently, our object of study can be viewed as recognizable tree series over the semiring (...
207
click to vote
DAC
1997
ACM
15 years 10 months ago
1997
ACM
Abstract. Many modern systems are designed as a set of interconnected reactive subsystems. The subsystem verification task is to verify an implementation of the subsystem against t...
199
click to vote
RTA
2000
Springer
15 years 10 months ago
2000
Springer
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
200
Voted
SAC
2000
ACM
15 years 10 months ago
2000
ACM
Abstract. Formal grammars are well established for specifying the syntax of programming languages. However, the formal specification of programming language semantics has proven mo...
166
Voted
DAC
1995
ACM
15 years 10 months ago
1995
ACM
- We introduce a transformation, named rephasing, that manipulates the timing parameters in control-dataflow graphs. Traditionally high-level synthesis systems for DSP have either ...