ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Information and Software Technology
Volume 49, Issues 9-10, September 2007, Pages 1030-1044
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (669 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.infsof.2006.10.016    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2006 Elsevier B.V. All rights reserved.

Goal-oriented test data generation for pointer programs

Arnaud Gotlieba, Corresponding Author Contact Information, E-mail The Corresponding Author, Tristan Denmata and Bernard Botellab

aIRISA/INRIA, Campus Beaulieu, 35042 Rennes Cedex, France bTHALES AEROSPACE, 78851 Elancourt Cedex, France

Received 14 October 2005; 
revised 13 October 2006; 
accepted 24 October 2006. 
Available online 22 December 2006.

Purchase the full-text article



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
2.1. SSA form
2.2. The CLP(FD) framework
2.3. Combinators for program analysis
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. phiu- and phid-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













 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.