Sciweavers

Share
COMPSAC
2008
IEEE

Constraint Reasoning in Path-Oriented Random Testing

8 years 10 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. The main challenge of PRT is to build efficiently such a test suite in order to minimize the number of rejects (test data that activate another control flow path). We address this problem with an original technique based on constraint reasoning over finite domains, a well-recognized Constraint Programming technique. Our approach derives path conditions by using symbolic execution and computes an approximation of their associated subdomain by using constraint propagation and constraint refutation.
Arnaud Gotlieb, Matthieu Petit
Added 29 May 2010
Updated 29 May 2010
Type Conference
Year 2008
Where COMPSAC
Authors Arnaud Gotlieb, Matthieu Petit
Comments (0)
books