Sciweavers

388 search results - page 23 / 78
» Guiding random test generation with program analysis
Sort
View
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
14 years 9 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
ISSTA
2004
ACM
14 years 2 months ago
Testing of java web services for robustness
This paper presents a new compile-time analysis that enables a testing methodology for white-box coverage testing of error recovery code (i.e., exception handlers) in Java web ser...
Chen Fu, Barbara G. Ryder, Ana Milanova, David Won...
ICSE
2010
IEEE-ACM
14 years 1 months ago
Is operator-based mutant selection superior to random mutant selection?
Due to the expensiveness of compiling and executing a large number of mutants, it is usually necessary to select a subset of mutants to substitute the whole set of generated mutan...
Lu Zhang, Shan-Shan Hou, Jun-Jue Hu, Tao Xie, Hong...
CEC
2009
IEEE
14 years 3 months ago
Evolutionary design of the energy function for protein structure prediction
— Automatic protein structure predictors use the notion of energy to guide the search towards good candidate structures. The energy functions used by the state-of-the-art predict...
Pawel Widera, Jonathan M. Garibaldi, Natalio Krasn...
KBSE
2007
IEEE
14 years 3 months ago
Testing concurrent programs using value schedules
Concurrent programs are difficult to debug and verify because of the nondeterministic nature of concurrent executions. A particular concurrency-related bug may only show up under ...
Jun Chen, Steve MacDonald