Sciweavers

30 search results - page 2 / 6
» Dynamically Scheduling the Trace Produced During Program Exe...
Sort
View
ICSE
2004
IEEE-ACM
14 years 5 months ago
Using Compressed Bytecode Traces for Slicing Java Programs
Dynamic slicing is a well-known program debugging technique. Given a program P and input I, it finds all program statements which directly/indirectly affect the values of some var...
Tao Wang, Abhik Roychoudhury
JUCS
2000
120views more  JUCS 2000»
13 years 4 months ago
Execution and Cache Performance of the Scheduled Dataflow Architecture
: This paper presents an evaluation of our Scheduled Dataflow (SDF) Processor. Recent focus in the field of new processor architectures is mainly on VLIW (e.g. IA-64), superscalar ...
Krishna M. Kavi, Joseph Arul, Roberto Giorgi
IEEEPACT
1998
IEEE
13 years 9 months ago
Dynamic Hammock Predication for Non-Predicated Instruction Set Architectures
Conventional speculative architectures use branch prediction to evaluate the most likely execution path during program execution. However, certain branches are difficult to predic...
Artur Klauser, Todd M. Austin, Dirk Grunwald, Brad...
ICCS
2003
Springer
13 years 10 months ago
Exploiting Stability to Reduce Time-Space Cost for Memory Tracing
Memory traces record the addresses touched by a program during its execution, enabling many useful investigations for understanding and predicting program performance. But complete...
Xiaofeng Gao, Allan Snavely
SIGSOFT
2005
ACM
14 years 5 months ago
Matching execution histories of program versions
We develop a method for matching dynamic histories of program executions of two program versions. The matches produced can be useful in many applications including software piracy...
Xiangyu Zhang, Rajiv Gupta