Sciweavers

1477 search results - page 143 / 296
» Token flow control
Sort
View
JUCS
2006
87views more  JUCS 2006»
15 years 4 months ago
Eliminating Redundant Join-Set Computations in Static Single Assignment
: The seminal algorithm developed by Ron Cytron, Jeanne Ferrante and colleagues in 1989 for the placement of -nodes in a control flow graph is still widely used in commercial compi...
Angela French, José Nelson Amaral
ENTCS
2002
79views more  ENTCS 2002»
15 years 3 months ago
Debugging and Testing Optimizers through Comparison Checking
We present a novel technique called comparison checking that helps optimizer writers debug optimizers by testing, for given inputs, that the semantics of a program are not changed...
Clara Jaramillo, Rajiv Gupta, Mary Lou Soffa
JLP
2010
142views more  JLP 2010»
14 years 11 months ago
Relational bytecode correlations
We present a calculus for tracking equality relationships between values through pairs of bytecode programs. The calculus may serve as a certification mechanism for noninterferenc...
Lennart Beringer
PPOPP
2009
ACM
16 years 4 months ago
Exploiting global optimizations for openmp programs in the openuh compiler
The advent of new parallel architectures has increased the need for parallel optimizing compilers to assist developers in creating efficient code. OpenUH is a state-of-the-art opt...
Lei Huang, Deepak Eachempati, Marcus W. Hervey, Ba...
RSP
2003
IEEE
149views Control Systems» more  RSP 2003»
15 years 9 months ago
Rapid Scheduling of Efficient VLSI Architectures for Next-Generation HSDPA
In this paper, an efficient design flow integrating Mentor Graphics Precesion C and HDL designer is derived. In this hybrid prototyping environment, efficient FPGA architectures a...
Yuanbin Guo, Gang Xu, Dennis McCain, Joseph R. Cav...