A Constraint Logic Programming Approach to Automated Testing
In this paper we present a new constraint solver for the automated generation of test cases from specifications. The specification language is inspired by the contract-oriented programming extended with a finite state machines. Beyond the generation of correct argument values for method calls, we generate full test scenarios thanks to the symbolic animation of the specifications. We propose a flexible CSP architecture that can operate not only on integer or bounded domains but also on arbitrary types. An original notion of type builder is used to establish the link between the type semantics and the CSP framework. We illustrate this with a string builder that can automatically generate string instances depending on combinations of constraints.
Unable to display preview. Download preview PDF.
- 2.Utting, M., Legeard, B.: Practical Model-Based Testing: A Tools Approach, 1st edn. Morgan Kaufmann, San Francisco (2006)Google Scholar
- 4.Kumar, V.: Algorithms for constraint-satisfaction problems: A survey. AI Magazine 13, 32–44 (1992)Google Scholar
- 5.Boyapati, C., Khurshid, S., Marinov, D.: Korat: Automated testing based on java predicates (2002)Google Scholar
- 8.Ambert, F., Bouquet, F., Legeard, B., Peureux, F.: Automated boundary-value test generation from specifications - method and tools. In: ICSTEST 2003, Cologne, Allemagne, pp. 52–68 (2003)Google Scholar