548 search results - page 12 / 110 » Parallel Relative Debugging with Dynamic Data Structures |
ICSE
2003
IEEE-ACM
15 years 11 months ago
2003
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. In this paper we present the d...
107
click to vote
PPL
2008
14 years 11 months ago
2008
Parallel programming has proven to be an effective technique to improve the performance of computationally intensive applications. However, writing parallel programs is not easy, ...
145
click to vote
VISUALIZATION
1996
IEEE
15 years 3 months ago
1996
IEEE
We present a method for producing real-time volume visualizations of continuously captured, arbitrarily-oriented 2D arrays (slices) of data. Our system constructs a 3D representat...
VLDB
2004
ACM
15 years 5 months ago
2004
ACM
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
102
click to vote
SIGSOFT
2005
ACM
16 years 12 days ago
2005
ACM
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...