A Constraint Logic Programming Approach to Automated Testing - Université Pierre et Marie Curie Accéder directement au contenu
Communication Dans Un Congrès Année : 2008

A Constraint Logic Programming Approach to Automated Testing

Frédéric Peschanski
  • Fonction : Auteur
  • PersonId : 839315

Résumé

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.

Dates et versions

hal-01303857 , version 1 (18-04-2016)

Identifiants

Citer

Hakim Belhaouari, Frédéric Peschanski. A Constraint Logic Programming Approach to Automated Testing. 24th International Conference on Logic Programming, Dec 2008, Udine, Italy. pp.754-758, ⟨10.1007/978-3-540-89982-2_71⟩. ⟨hal-01303857⟩
51 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More