An Approach to Program Testing
ACM Computing Surveys (CSUR)
Symbolic execution and program testing
Communications of the ACM
An interactive Automated Test Data Generator
ACM '76 Proceedings of the 1976 annual conference
DISSECT A Symbolic Evaluation and Program Testing System
IEEE Transactions on Software Engineering
Toward a theory of test data selection
IEEE Transactions on Software Engineering
| Hi-index | 0.00 |
In automated test data generation a program is analyzed to derive a set of test paths, that is a set of predicted executions. Each path is characterized by some path constraints: data satisfying these constraints will perform the predicted execution. This paper discusses some problems which arise during path constraints evaluation when block structured languages are involved and when test paths traverse several procedures (possibly with recursive activations). In these cases partial test paths, independently selected for each procedure, must be pre-processed (enriched and or modified) to explicitly consider the semantics associated with dynamic memory allocation, parameter transmission (by value, value-result, name and reference), and co-existing instances of a recursive procedure.