Automatic test data generation leads to identify input values on which a selected point in a procedure is executed. This paper introduces a new method for this problem based on constraint solving techniques. First, we statically transform a procedure into a constraint system by using well-known "Static Single Assignment" form and control-dependencies. Second, we solve this system to check whether at least one feasible control flow path goicg through the selected point exists and to generate test data that correspond to one of these paths. The key point of our approach is to take advantage of current advan( es in constraint techniques when solving the generated constraint system. Global constraints are used in a prelil ninary step to detect some of the non feasible paths. PJ rtial consistency techniques are employed to reduce the c omains of possible values of the test data. A prototype implementation has been developped on a restricted subset of the C language. Advantages of our approach are illustrated on a non-trivial example.
CITATION STYLE
Gotlieb, A., Botella, B., & Rueher, M. (1998). Automatic test data generation using constraint solving techniques. In Proceedings of the 1998 ACM SIGSOFT International Symposium on Software Testing and Analysis, ISSTA 1998 (pp. 53–62). Association for Computing Machinery, Inc. https://doi.org/10.1145/271771.271790
Mendeley helps you to discover research relevant for your work.