Sciweavers

183 search results - page 10 / 37
» Practical Random Number Generation in Software
Sort
View
TSE
2010
120views more  TSE 2010»
13 years 4 months ago
Efficient Software Verification: Statistical Testing Using Automated Search
Statistical testing has been shown to be more efficient at detecting faults in software than other methods of dynamic testing such as random and structural testing. Test data are g...
Simon M. Poulding, John A. Clark
CAV
2009
Springer
132views Hardware» more  CAV 2009»
14 years 10 months ago
Image Computation for Polynomial Dynamical Systems Using the Bernstein Expansion
This paper is concerned with the problem of computing the image of a set by a polynomial function. Such image computations constitute a crucial component in typical tools for set-b...
Thao Dang, David Salinas
ICSE
2010
IEEE-ACM
14 years 2 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...
CTRSA
2009
Springer
141views Cryptology» more  CTRSA 2009»
14 years 1 months ago
Practical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
Anna Lisa Ferrara, Matthew Green, Susan Hohenberge...
COMPSAC
2008
IEEE
14 years 4 months ago
Constraint Reasoning in Path-Oriented Random Testing
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
Arnaud Gotlieb, Matthieu Petit