Proceedings Article10.1109/ASE.2002.1115007
Generating test data for functions with pointer inputs
S. Visvanathan,Neelam Gupta +1 more
- 23 Sep 2002
- pp 149-160
TL;DR: This paper develops a novel approach that allows the generation of the shape of an input data structure to be done independently of thegeneration of its data values so as to force the control flow of a function along a given path.
read more
Abstract: Generating test inputs for a path in a function with integer and real parameters is an important but difficult problem. The problem becomes more difficult when pointers are passed as inputs to a function. In this case, the shape of the input data structure as well as the data values in the fields of this data structure need to be determined for traversal of the given path. The existing techniques to address this problem are inefficient since they use backtracking to simultaneously satisfy the constraints on the pointer variables and the data values used along the path. In this paper, we develop a novel approach that allows the generation of the shape of an input data structure to be done independently of the generation of its data values so as to force the control flow of a function along a given path. We also present a new technique that generates the shape of the input data structure by solving a set of pointer constraints derived in a single pass of the statements along the path. Although simple, our approach is powerful in handling pointer aliasing. It is efficient and provides a practical solution to generating test data for functions with pointer inputs.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
CUTE: a concolic unit testing engine for C
Koushik Sen,Darko Marinov,Gul Agha +2 more
- 01 Sep 2005
TL;DR: In this paper, the authors address the problem of automating unit testing with memory graphs as inputs, and develop a method to represent and track constraints that capture the behavior of a symbolic execution of a unit with memory graph as inputs.
Transition covering tests for systems with queues
Jiale Huo,Alexandre Petrenko +1 more
TL;DR: This paper introduces a method to cover transitions of a concurrent system under test through a context consisting of infinite-capacity queues, derives transition covering tests directly from the specification of the concurrent system, not its composition with queues.
157
A density-based greedy algorithm for higher strength covering arrays
Renee Bryce,Charles J. Colbourn +1 more
TL;DR: This study extends an efficient density-based algorithm for pairwise coverage to generate t-way interaction test suites and shows that it guarantees a logarithmic upper bound on the size of the test suites as a function of the number of factors.
142
Automatic, evolutionary test data generation for dynamic software testing
TL;DR: The efficacy of the proposed approach is assessed on a number of programs and the empirical results indicate that its performance is significantly better compared to existing dynamic test data generation methods.
68
Generalizing symbolic execution to library classes
Sarfraz Khurshid,Yuk Lai Suen +1 more
- 05 Sep 2005
TL;DR: D Dianju is a new technique that aims to address the scalability of symbolic execution, to perform symbolic execution of commonly used library classes at the abstract level rather than the representation level, thus promising scalable analyses based on symbolic execution.
References
Automated software test data generation
TL;DR: Values of array indexes and pointers are known at each step of program execution; this information is used to overcome difficulties of array and pointer handling to significantly increase the speed of the search process.
1K
Constraint-based automatic test data generation
R.A. DeMilli,A.J. Offutt +1 more
TL;DR: Godzilla is a fault-based technique that uses algebraic constraints to describe test cases designed to find particular types of faults and has been integrated with the Mothra testing system.
884
Automated test data generation using iterative relaxation methods
Neelam Gupta,Aditya P. Mathur,Mary Lou Soffa +2 more
- 01 Jan 1999
TL;DR: In this paper, a new program execution based approach to automated test data generation using iterative relaxation methods has been developed, which can generate test data for programs with branch predicates that compute linear and nonlinear functions of input.
192
Automated test data generation using an iterative relaxation method
Neelam Gupta,Aditya P. Mathur,Mary Lou Soffa +2 more
- 01 Nov 1998
TL;DR: This paper presents a novel program execution based approach using an iterative relaxation method to address the generation of test data that causes a program to follow a given path.
180
ADTEST: a test data generation suite for Ada software systems
TL;DR: The design of the software system ADTEST (ADa TESTing), for generating test data for programs developed in Ada83, is presented, finding to reduce the effort required to test programs as well as providing an increase in test coverage.
127