Sciweavers

587 search results - page 51 / 118
» Algorithmic Debugging of Java Programs
Sort
View
ICSE
2003
IEEE-ACM
14 years 8 months ago
Precise Dynamic Slicing Algorithms
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...
Xiangyu Zhang, Rajiv Gupta, Youtao Zhang
SPAA
1997
ACM
13 years 11 months ago
Efficient Detection of Determinacy Races in Cilk Programs
A parallel multithreaded program that is ostensibly deterministic may nevertheless behave nondeterministically due to bugs in the code. These bugs are called determinacy races, an...
Mingdong Feng, Charles E. Leiserson
ICSM
2007
IEEE
14 years 2 months ago
Matching Control Flow of Program Versions
In many application areas, including piracy detection, software debugging and maintenance, situations arise in which there is a need for comparing two versions of a program that d...
Vijayanand Nagarajan, Rajiv Gupta, Matias Madou, X...
AOSD
2012
ACM
12 years 3 months ago
Reusing non-functional concerns across languages
Emerging languages are often source-to-source compiled to mainstream ones, which offer standardized, fine-tuned implementations of non-functional concerns (NFCs)—including pers...
Myoungkyu Song, Eli Tilevich
IWMM
2007
Springer
116views Hardware» more  IWMM 2007»
14 years 1 months ago
Heap space analysis for java bytecode
This article presents a heap space analysis for (sequential) Java bytecode. The analysis generates heap space cost relations which define at compile-time the heap consumption of ...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...