Sciweavers

452 search results - page 31 / 91
» Finding bugs is easy
Sort
View
SIGSOFT
2009
ACM
14 years 8 months ago
Darwin: an approach for debugging evolving programs
Debugging refers to the laborious process of finding causes of program failures. Often, such failures are introduced when a program undergoes changes and evolves from a stable ver...
Dawei Qi, Abhik Roychoudhury, Zhenkai Liang, Kapil...
SIGSOFT
2007
ACM
14 years 8 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
POPL
2002
ACM
14 years 8 months ago
Mining specifications
Program verification is a promising approach to improving program quality, because it can search all possible program executions for specific errors. However, the need to formally...
Glenn Ammons, James R. Larus, Rastislav Bodí...
PASTE
2010
ACM
13 years 10 months ago
Null dereference analysis in practice
Many analysis techniques have been proposed to determine when a potentially null value may be dereferenced. But we have observed in practice that not every potential null derefere...
Nathaniel Ayewah, William Pugh
ESE
2006
105views Database» more  ESE 2006»
13 years 8 months ago
Replaying development history to assess the effectiveness of change propagation tools
As developers modify software entities such as functions or variables to introduce new features, enhance old ones, or fix bugs, they must ensure that other entities in the software...
Ahmed E. Hassan, Richard C. Holt