2607 search results - page 123 / 522 » Complete Functional Synthesis |
163
Voted
DAC
1998
ACM
15 years 8 months ago
1998
ACM
We present a technique for synthesizing power- as well as area-optimized circuits from hierarchical data flow graphs under throughput constraints. We allow for the use of complex...
125
Voted
IJCAI
1997
15 years 5 months ago
1997
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
132
Voted
ISSS
1995
IEEE
15 years 7 months ago
1995
IEEE
Decisions taken at the earliest steps of the design process may have a significantimpact on the characteristics of the final implementation. This paper illustrates how power con...
151
Voted
DAC
2003
ACM
16 years 4 months ago
2003
ACM
Combinational circuits are generally thought of as acyclic structures. It is known that cyclic structures can be combinational, and techniques have been proposed to analyze cyclic...
131
Voted
JELIA
2004
Springer
15 years 9 months ago
2004
Springer
In this work we reconsider the replacement of predicate-like notation by functional terms, using a similar syntax to Functional Logic Programming, but under a completely different...