A Constraint Logic Programming Approach to Automated Testing

  • Hakim Belhaouari
  • Frédéric Peschanski
Conference paper

DOI: 10.1007/978-3-540-89982-2_71

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5366)
Cite this paper as:
Belhaouari H., Peschanski F. (2008) A Constraint Logic Programming Approach to Automated Testing. In: Garcia de la Banda M., Pontelli E. (eds) Logic Programming. ICLP 2008. Lecture Notes in Computer Science, vol 5366. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Hakim Belhaouari
    • 1
  • Frédéric Peschanski
    • 1
  1. 1.Laboratoire d’Informatique de Paris 6UPMC Paris UniversitasParisFrance

Personalised recommendations