Sciweavers

587 search results - page 102 / 118
» Algorithmic Debugging of Java Programs
Sort
View
PASTE
2010
ACM
13 years 9 months ago
Packrat parsers can handle practical grammars in mostly constant space
Packrat parsing is a powerful parsing algorithm presented by Ford in 2002. Packrat parsers can handle complicated grammars and recursive structures in lexical elements more easily...
Kota Mizushima, Atusi Maeda, Yoshinori Yamaguchi
SIGSOFT
2007
ACM
14 years 8 months ago
Context-based detection of clone-related bugs
Studies show that programs contain much similar code, commonly known as clones. One of the main reasons for introducing clones is programmers' tendency to copy and paste code...
Lingxiao Jiang, Zhendong Su, Edwin Chiu
MIDDLEWARE
2004
Springer
14 years 1 months ago
iOverlay: A Lightweight Middleware Infrastructure for Overlay Application Implementations
The very nature of implementing and evaluating fully distributed algorithms or protocols in application-layer overlay networks involves certain programming tasks that are at best m...
Baochun Li, Jiang Guo, Mea Wang
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
14 years 2 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
ISSTA
2004
ACM
14 years 1 months ago
Evolutionary testing in the presence of loop-assigned flags: a testability transformation approach
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
André Baresel, David Binkley, Mark Harman, ...