Abstract : 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.
Type de document :
Communication dans un congrès
Khaled El-Fakih; Gerassimos Barlas; Nina Yevtushenko. 27th IFIP International Conference on Testing Software and Systems (ICTSS), Nov 2015, Sharjah and Dubai, United Arab Emirates. Lecture Notes in Computer Science, LNCS-9447, pp.55-70, 2015, Testing Software and Systems. 〈10.1007/978-3-319-25945-1_4〉
https://hal.inria.fr/hal-01470157
Contributeur : Hal Ifip
<>
Soumis le : vendredi 17 février 2017 - 10:25:55
Dernière modification le : mercredi 18 octobre 2017 - 15:46:01
Document(s) archivé(s) le : jeudi 18 mai 2017 - 13:55:17
Sylvain Hallé, Edmond Chance, Sébastien Gaboury. Graph Methods for Generating Test Cases with Universal and Existential Constraints. Khaled El-Fakih; Gerassimos Barlas; Nina Yevtushenko. 27th IFIP International Conference on Testing Software and Systems (ICTSS), Nov 2015, Sharjah and Dubai, United Arab Emirates. Lecture Notes in Computer Science, LNCS-9447, pp.55-70, 2015, Testing Software and Systems. 〈10.1007/978-3-319-25945-1_4〉. 〈hal-01470157〉
