Sciweavers

438 search results - page 29 / 88
» Bugs in the programs
Sort
View
OOPSLA
2010
Springer
13 years 8 months ago
Random testing for higher-order, stateful programs
Testing is among the most effective tools available for finding bugs. Still, we know of no automatic technique for generating test cases that expose bugs involving a combination ...
Casey Klein, Matthew Flatt, Robert Bruce Findler
SOSP
2009
ACM
14 years 6 months ago
ODR: output-deterministic replay for multicore debugging
Reproducing bugs is hard. Deterministic replay systems address this problem by providing a high-fidelity replica of an original program run that can be repeatedly executed to zer...
Gautam Altekar, Ion Stoica
PLDI
2006
ACM
14 years 3 months ago
Effective static race detection for Java
We present a novel technique for static race detection in Java programs, comprised of a series of stages that employ a combination of static analyses to successively reduce the pa...
Mayur Naik, Alex Aiken, John Whaley
MSR
2006
ACM
14 years 3 months ago
Are refactorings less error-prone than other changes?
Refactorings are program transformations which should preserve the program behavior. Consequently, we expect that during phases when there are mostly refactorings in the change hi...
Peter Weißgerber, Stephan Diehl
TACAS
2009
Springer
135views Algorithms» more  TACAS 2009»
14 years 4 months ago
Context-Bounded Analysis for Concurrent Programs with Dynamic Creation of Threads
Context-bounded analysis has been shown to be both efficient and effective at finding bugs in concurrent programs. According to its original definition, context-bounded analysis...
Mohamed Faouzi Atig, Ahmed Bouajjani, Shaz Qadeer