Sciweavers

50 search results - page 7 / 10
» Partial Dead Code Elimination
Sort
View
CGO
2003
IEEE
14 years 23 days ago
Optimizing Memory Accesses For Spatial Computation
In this paper we present the internal representation and optimizations used by the CASH compiler for improving the memory parallelism of pointer-based programs. CASH uses an SSA-b...
Mihai Budiu, Seth Copen Goldstein
PEPM
1994
ACM
13 years 11 months ago
Improving CPS-Based Partial Evaluation: Writing Cogen by Hand
It is well-known that self-applicable partial evaluation can be used to generate compiler generators: cogen = mix(mix;mix), where mix is the specializer (partial evaluator). Howev...
Anders Bondorf, Dirk Dussart
PEPM
2009
ACM
15 years 7 months ago
Static Consistency Checking for Verilog Wire Interconnects
The Verilog hardware description language has padding semantics that allow designers to write descriptions where wires of different bit widths can be interconnected. However, many ...
Cherif Salama, Gregory Malecha, Walid Taha, Jim Gr...
CGO
2006
IEEE
13 years 11 months ago
Dynamic Class Hierarchy Mutation
Class hierarchies in object-oriented programs are used to capture various attributes of the underlying objects they represent, allowing programmers to encapsulate common attribute...
Lixin Su, Mikko H. Lipasti
FDTC
2008
Springer
144views Cryptology» more  FDTC 2008»
13 years 9 months ago
Comparative Analysis of Robust Fault Attack Resistant Architectures for Public and Private Cryptosystems
The adaptive and active nature of fault based sidechannel attacks along with the large arsenal of fault injection methods complicates the design of effective countermeasures. To o...
Konrad J. Kulikowski, Zhen Wang, Mark G. Karpovsky