Copyright © 2006 Elsevier B.V. All rights reserved.
Goal-oriented test data generation for pointer programs
Received 14 October 2005;
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
Automatic test data generation leads to the identification of input values on which a selected path or a selected branch is executed within a program (path-oriented vs. goal-oriented methods). In both cases, several approaches based on constraint solving exist, but in the presence of pointer variables only path-oriented methods have been proposed. Pointers are responsible for the existence of conditional aliasing problems that usually provoke the failure of the goal-oriented test data generation process. In this paper, we propose an overall constraint-based method that exploits the results of an intraprocedural points-to analysis and provides two specific constraint combinators for automatically generating goal-oriented test data. This approach correctly handles multi-levels stack-directed pointers that are mainly used in C programs. The method has been fully implemented in the test data generation tool INKA and first experiences in applying it to a variety of existing programs are presented.
Keywords: Goal-oriented test data generation; Constraint logic programming; Static single assignment form; Pointer variables
Article Outline
- 1. Introduction
- 2. Background
- 3. An overview of the approach
- 4. The Pointer-SSA form (PSSA)
- 4.1. A simple language over pointer variables
- 4.2. Normalization
- 4.3. A points-to analysis
- 4.4.
u- and
d-functions in PSSA - 4.5. Building the PSSA form
- 5. Combinators Φu and Φd in CLP(FD)
- 6. Preliminary results
- 6.1. The InKa tool
- 6.2. Experimental evaluation
- 6.3. Analysis
- 7. Related work
- 8. Conclusion
- Acknowledgements
- References







E-mail Article
Add to my Quick Links

Cited By in Scopus (1)






