Download:
|
by S. Lapierre, E. Merlo, G. Savard, G. Antoniol, R. Fiutem, P. Tonella
http://serg.ing.unisannio.it/~antoniol/papers/icsm99test.ps.gz
Add To MetaCart
Abstract:
This paper presents an approach to automatic unit test data generation for branch coverage using mixed-integer linear programming, execution trees, and symbolic execution. This approach can be useful to both general testing and regression testing after software maintenance and reengineering activities. Several strategies, including original algorithms, to move towards practical test data generation have been investigated in this paper. Methods include: ffl the analysis of minimum path-length partial execution trees for unconstrained arcs, thus increasing the generation performance and reducing the difficulties originated by infeasible paths ffl the reduction of the difficulties originated by nonlinear
Citations
|
214
|
Using program slicing in software maintenance
– Gallagher, Lyle
- 1991
|
|
163
|
Constraint-based automatic test data generation
– DeMillo, Offutt
- 1991
|
|
162
|
Symbolic execution and program testing
– King
- 1976
|
|
147
|
An applicable family of data flow testing criteria
– Frankl, Weyuker
- 1988
|
|
109
|
A system to generate test data and symbolically execute programs
– Clarke
- 1976
|
|
105
|
Automated Software Test Data Generation
– Korel
- 1990
|
|
104
|
Analyzing Regression Test Selection Techniques
– Rothermel, Harrold
- 1996
|
|
38
|
Identifying reusable functions using specification driven program slicing: a case study
– Cimitile, Lucia, et al.
- 1995
|
|
27
|
Qualifying Reusable Functions Using Symbolic Execution
– Cimitile, Lucia, et al.
- 1995
|
|
22
|
Program understanding and maintenance with the CANTO environment
– Antoniol, Fiutem, et al.
- 1997
|
|
20
|
Data flow analysis techniques for test data selection
– Rapps, Weyuker
- 1982
|
|
18
|
Automatic generation of path covers based on the control ow analysis of computer programs
– Bertolino, Marre
- 1994
|
|
18
|
Test data generation and feasible path analysis
– Jasper, Brennan, et al.
- 1994
|
|
12
|
Antirandom testing: Getting the most out of black-box testing
– Malaiya
- 1995
|
|
10
|
The applicability of program schema results to programs
– Weyuker
- 1979
|
|
9
|
An empirical evaluation of weak mutation
– Offut, Lee
- 1994
|
|
4
|
Reducing the effects of infeasible paths in branch testing
– Yates, Malevris
- 1989
|
|
3
|
A.,"Integer and Combinatorial Optimization," Wiley-Interscience
– Nemhauser, Wolsey
- 1988
|
|
2
|
Priority Based Data Flow Testing
– Gupta, Soa
- 1995
|
|
2
|
A generalized optimal path-selection model for structural program testing
– Wang, Hsu
- 1989
|
|
1
|
Software testing techniques, second edition ", International Thomson computer press
– Beizer
- 1990
|
|
1
|
Symbolic execution and testing", Information and soft
– Coward
- 1991
|
|
1
|
Semantic Domains ", pp. 635--677, from "Handbook of theoretical computer science
– Gunter, Scott
- 1990
|
|
1
|
Description of TAO test data generation system", ' Ecole Polytechnique technical report
– Lapierre, Merlo, et al.
- 1997
|
|
1
|
Test-case generation with IOGen
– Lindquist, Jenkins
- 1988
|
|
1
|
Software testing : opportunity and nightmare
– Mayrhauser
- 1992
|
