Sciweavers

319 search results - page 20 / 64
» Precise Dynamic Slicing Algorithms
Sort
View
SAS
1999
Springer
13 years 11 months ago
Eliminating Dead Code on Recursive Data
This paper describes a powerful method for dead code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using live...
Yanhong A. Liu, Scott D. Stoller
WCRE
2002
IEEE
14 years 9 days ago
Register Liveness Analysis for Optimizing Dynamic Binary Translation
Dynamic binary translators compile machine code from a source architecture to a target architecture at run time. Due to the hard time constraints of just-in-time compilation only ...
Mark Probst, Andreas Krall, Bernhard Scholz
SIGSOFT
2007
ACM
14 years 8 months ago
Efficient checkpointing of java software using context-sensitive capture and replay
Checkpointing and replaying is an attractive technique that has been used widely at the operating/runtime system level to provide fault tolerance. Applying such a technique at the...
Guoqing Xu, Atanas Rountev, Yan Tang, Feng Qin
TMC
2011
158views more  TMC 2011»
13 years 2 months ago
Explicit Congestion Control Algorithms for Time Varying Capacity Media
—Explicit congestion control (XCC) is emerging as one potential solution for overcoming limitations inherent to the current TCP algorithm, characterized by unstable throughput, h...
Filipe Abrantes, João Taveira Araujo, Manue...
VIS
2005
IEEE
165views Visualization» more  VIS 2005»
14 years 8 months ago
High Dynamic Range Volume Visualization
High resolution volumes require high precision compositing to preserve detailed structures. This is even more desirable for volumes with high dynamic range values. After the high ...
Baoquan Chen, David H. Porter, Minh X. Nguyen, Xia...