55 search results - page 3 / 11 » Definitions of Equivalence for Transformational Synthesis of... |
ISSS
2002
IEEE
14 years 16 days ago
2002
IEEE
Modeling for synthesis and modeling for simulation seem to be two competing goals in the context of C++-based modeling frameworks. One of the reasons is while most hardware system...
ISSS
2000
IEEE
14 years 10 hour ago
2000
IEEE
Time-driven simulation models typically model timing in an idealized way that is over-constrained and cannot be directly implemented. In this paper we present a transformation to ...
SAIG
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Functional languages are particularly well-suited to the implementation of interpreters for domain-specific embedded languages (DSELs). We describe an implemented techniq...
RTAS
2008
IEEE
14 years 2 months ago
2008
IEEE
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
LOPSTR
1994
Springer
13 years 11 months ago
1994
Springer
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...