A uniform random test data generator for path testing

Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that execute a single control flow path within a program. The main challenge of PRT lies in its ability to build efficiently such a test suite in order to minimize the number of rejects (test da...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:The Journal of systems and software Ročník 83; číslo 12; s. 2618 - 2626
Hlavní autori: Gotlieb, Arnaud, Petit, Matthieu
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: New York Elsevier Inc 01.12.2010
Elsevier Sequoia S.A
Elsevier
Predmet:
Approximation
Benchmarks
Computer Science
Constraint reasoning
Construction
Divide & conquer algorithms
Flow paths
Generators
Mathematical analysis
Path testing
Product testing
Programming
Programming languages
Random testing
Reasoning
Software Engineering
Studies
Test methods
Random testing
Path testing
Constraint reasoning
Path Testing
ISSN:0164-1212, 1873-1228
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that execute a single control flow path within a program. The main challenge of PRT lies in its ability to build efficiently such a test suite in order to minimize the number of rejects (test data that execute another control flow path). We address this problem with an original divide-and-conquer approach based on constraint reasoning over finite domains, a well-recognized Constraint Programming technique. Our approach first derives path conditions by using backward symbolic execution and computes a tight over-approximation of their associated subdomain by using constraint propagation and constraint refutation. Second, a uniform random test data generator is extracted from this approximated subdomain. We implemented this approach and got experimental results that show the practical benefits of PRT based on constraint reasoning. On average, we got a two-order magnitude CPU time improvement over standard Random Testing on a set of paths extracted from classical benchmark programs.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0164-1212
1873-1228
DOI:10.1016/j.jss.2010.08.021