144 search results - page 13 / 29 » Automatic generation of polynomial loop |
FAC
2008
13 years 7 months ago
2008
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
ICS
1994
Tsinghua U.
13 years 11 months ago
1994
Tsinghua U.
We present a parallel code generation algorithm for complete applications and a new experimental methodology that tests the efficacy of our approach. The algorithm optimizes for d...
LCTRTS
2004
Springer
14 years 27 days ago
2004
Springer
We present a polynomial upper bound for flattening of UML statecharts. An efficient flattening technique is derived and implemented in SCOPE—a code generator targeting constra...
ASPDAC
2006
ACM
14 years 1 months ago
2006
ACM
— This paper presents an architecture and a synthesis method for programmable numerical function generators (NFGs) for trigonometric, logarithmic, square root, and reciprocal fun...
ISVLSI
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— Time-to-Market plays a central role on System-ona-Chip (SoC) competitiveness and the quality of the final product is a matter of concern as well. As SoCs complexity in...