Graph Methods for Generating Test Cases with Universal and Existential Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

Graph Methods for Generating Test Cases with Universal and Existential Constraints

Résumé

We introduce a generalization of the t-way test case generation problem, where parameter t is replaced by a set $$\varPhi $$Φ of Boolean conditions on attribute values. We then present two reductions of this problem to graphs; first, to graph colouring, where we link the minimal number of tests to the chromatic number of some graph; second, to hypergraph vertex covering. This latter formalization allows us to handle problems with constraints of two kinds: those that must be true for every generated test case, and those that must be true for at least one test case. Experimental results show that the proposed solution produces test suites of slightly smaller sizes than a range of existing tools, while being more general: to the best of our knowledge, our work is the first to allow existential constraints over test cases.
Fichier principal
Vignette du fichier
385214_1_En_4_Chapter.pdf (791.37 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01470157 , version 1 (17-02-2017)

Licence

Paternité

Identifiants

Citer

Sylvain Hallé, Edmond La Chance, Sébastien Gaboury. Graph Methods for Generating Test Cases with Universal and Existential Constraints. 27th IFIP International Conference on Testing Software and Systems (ICTSS), Nov 2015, Sharjah and Dubai, United Arab Emirates. pp.55-70, ⟨10.1007/978-3-319-25945-1_4⟩. ⟨hal-01470157⟩
32 Consultations
133 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More