Sciweavers

11051 search results - page 2024 / 2211
» An Investigation of Generalized Cases
Sort
View
SIGSOFT
2008
ACM
16 years 8 months ago
Predicting failures with developer networks and social network analysis
Software fails and fixing it is expensive. Research in failure prediction has been highly successful at modeling software failures. Few models, however, consider the key cause of ...
Andrew Meneely, Laurie Williams, Will Snipes, Jaso...
SIGSOFT
2007
ACM
16 years 8 months ago
Program representations for testing wireless sensor network applications
Because of the growing complexity of wireless sensor network applications (WSNs), traditional software development tools are being developed that are specifically designed for the...
Nguyet T. M. Nguyen, Mary Lou Soffa
SIGSOFT
2007
ACM
16 years 8 months ago
Using groupings of static analysis alerts to identify files likely to contain field failures
In this paper, we propose a technique for leveraging historical field failure records in conjunction with automated static analysis alerts to determine which alerts or sets of ale...
Mark Sherriff, Sarah Smith Heckman, J. Michael Lak...
SIGSOFT
2007
ACM
16 years 8 months ago
The symmetry of the past and of the future: bi-infinite time in the verification of temporal properties
Model checking techniques have traditionally dealt with temporal logic languages and automata interpreted over -words, i.e., infinite in the future but finite in the past. However...
Matteo Pradella, Angelo Morzenti, Pierluigi San Pi...
SIGSOFT
2007
ACM
16 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...
« Prev « First page 2024 / 2211 Last » Next »