Sciweavers

7393 search results - page 557 / 1479
» Synthesis-for-testability using transformations
Sort
View
SAS
2000
Springer
15 years 11 months ago
Flattening Is an Improvement
d Abstract) James Riely1 and Jan Prins2 1 DePaul University 2 University of North Carolina at Chapel Hill Abstract. Flattening is a program transformation that eliminates nested pa...
James Riely, Jan Prins
FPCA
1995
15 years 11 months ago
Shortcut Deforestation in Calculational Form
In functional programming, intermediate data structures are often used to “glue’) together small programs. Deforestation is a program transformation to remove these intermedia...
Akihiko Takano, Erik Meijer
ISSAC
1995
Springer
86views Mathematics» more  ISSAC 1995»
15 years 11 months ago
Programs for Applying Symmetries
In this paper the programs APPLYSYM, QUASILINPDE and DETRAFO are described which aim at the utilization of infinitesimal symmetries of differential equations. The purpose of QUA...
Thomas Wolf
BPM
2008
Springer
136views Business» more  BPM 2008»
15 years 9 months ago
On the Formal Generation of Process Redesigns
Business Process Redesign (BPR) is a process oriented methodology to improve organizations. Although literature on BPR is available in abundance, little concrete support on how to ...
Mariska Netjes, Hajo A. Reijers, Wil M. P. van der...
ASPDAC
2005
ACM
132views Hardware» more  ASPDAC 2005»
15 years 9 months ago
Automatic synthesis and scheduling of multirate DSP algorithms
- To date, most high-level synthesis systems do not automatically solve present design problems, such as those related to timing associated with the physical implementation of mult...
Ying Yi, Mark Milward, Sami Khawam, Ioannis Nousia...