Name
Abstract | ||
|---|---|---|
Automatic test data generation usually concerns identifying input values that cause a selected path to execute. If a given path involves pointers, then input values may be represented in terms of two-dimensional dynamic data structures such as lists or trees. Thus, it is very important to identify the shape of the input data structure describing how many nodes are required and how nodes are connected each other. The approach presented in this paper makes use of the points-to information for each statement in the selected path for the shape generation. It also converts each statement into a static single assignment (SSA) form without pointer dereferences. The SSA form serves as a system of constraints to be solved to yield input values for non-pointer types. An empirical evaluation shows that shape generation can be achieved in linear time in terms of the number of pointer dereference operations. Copyright © 2008 John Wiley & Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1002/stvr.v19:1 | Softw. Test., Verif. Reliab. |
Keywords | Field | DocType |
2 dimensional,linear time,data structure | Data structure,Pointer (computer programming),Programming language,Automatic test data generation,Computer science,Theoretical computer science,Time complexity,Program testing,Dynamic data structures,Static single assignment form | Journal |
Volume | Issue | ISSN |
19 | 1 | 0960-0833 |
Citations | PageRank | References |
3 | 0.45 | 15 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| In Sang Chung | 1 | 64 | 6.76 |
| James M. Bieman | 2 | 1237 | 121.36 |