Sciweavers

17789 search results - page 3347 / 3558
» Exceptional Use Cases
Sort
View
143
Voted
ICSE
2008
IEEE-ACM
16 years 5 months ago
DySy: dynamic symbolic execution for invariant inference
Dynamically discovering likely program invariants from concrete test executions has emerged as a highly promising software engineering technique. Dynamic invariant inference has t...
Christoph Csallner, Nikolai Tillmann, Yannis Smara...
ICSE
2008
IEEE-ACM
16 years 5 months ago
ARTOO: adaptive random testing for object-oriented software
Intuition is often not a good guide to know which testing strategies will work best. There is no substitute for experimental analysis based on objective criteria: how many bugs a ...
Ilinca Ciupa, Andreas Leitner, Manuel Oriol, Bertr...
SIGSOFT
2009
ACM
16 years 5 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
2008
ACM
16 years 5 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...
150
Voted
SIGSOFT
2007
ACM
16 years 5 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 3347 / 3558 Last » Next »