Sciweavers

1182 search results - page 50 / 237
» Reducing the Overhead of Dynamic Analysis
Sort
View
OSDI
2006
ACM
14 years 10 months ago
Securing Software by Enforcing Data-flow Integrity
Software attacks often subvert the intended data-flow in a vulnerable program. For example, attackers exploit buffer overflows and format string vulnerabilities to write data to u...
Manuel Costa, Miguel Castro, Timothy L. Harris
DATE
2006
IEEE
119views Hardware» more  DATE 2006»
14 years 1 months ago
Compiler-driven FPGA-area allocation for reconfigurable computing
In this paper, we propose two FPGA-area allocation algorithms based on profiling results for reducing the impact on performance of dynamic reconfiguration overheads. The problem o...
Elena Moscu Panainte, Koen Bertels, Stamatis Vassi...
FGIT
2010
Springer
13 years 8 months ago
Improved Location Aided Cluster Based Routing Protocol for GPS Enabled Manets
Routing has been the main challenge for ad hoc networks due to dynamic topology as well as resource constraints. Completely GPS free as well as GPS scarce positioning systems for ...
S. Mangai, A. Tamilarasi
VEE
2012
ACM
252views Virtualization» more  VEE 2012»
12 years 5 months ago
libdft: practical dynamic data flow tracking for commodity systems
Dynamic data flow tracking (DFT) deals with tagging and tracking data of interest as they propagate during program execution. DFT has been repeatedly implemented by a variety of ...
Vasileios P. Kemerlis, Georgios Portokalidis, Kang...
FCCM
2002
IEEE
127views VLSI» more  FCCM 2002»
14 years 2 months ago
Hardware-Assisted Fast Routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
André DeHon, Randy Huang, John Wawrzynek