Sciweavers

587 search results - page 70 / 118
» Algorithmic Debugging of Java Programs
Sort
View
ISSTA
2010
ACM
14 years 2 months ago
On test repair using symbolic execution
When developers change a program, regression tests can fail not only due to faults in the program but also due to outof-date test code that does not reflect the desired behavior ...
Brett Daniel, Tihomir Gvero, Darko Marinov
SIGSOFT
2007
ACM
14 years 11 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...
SIGSOFT
2010
ACM
13 years 8 months ago
Representation dependence testing using program inversion
The definition of a data structure may permit many different concrete representations of the same logical content. A (client) program that accepts such a data structure as input i...
Aditya Kanade, Rajeev Alur, Sriram K. Rajamani, Ga...
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
MSR
2006
ACM
14 years 4 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