Exhaustive test sets for algebraic specification correctness

Abstract : In the context of testing from algebraic specifications, test cases are ground formulas chosen amongst the ground semantic consequences of the specification, according to some possible additional observability conditions. A test set is said to be exhaustive if every programme P passing all the tests is correct and if for every incorrect programme P, there exists a test case on which P fails. Because correctness can be proved by testing on such a test set, it is an appropriate basis for the selection of a test set of practical size. The largest candidate test set is the set of observable consequences of the specification. However, depending on the nature of specifications and programmes, this set is not necessarily exhaustive. In this paper, we study conditions to ensure the exhaustiveness property of this set for several algebraic formalisms (equational, conditional positive, quantifier free and with quantifiers) and several test hypotheses.
Complete list of metadatas

Contributor : Agnès Arnould <>
Submitted on : Thursday, May 19, 2016 - 3:01:23 PM
Last modification on : Tuesday, December 18, 2018 - 3:32:07 PM



Marc Aiguier, Agnès Arnould, Pascale Le Gall, Delphine Longuet. Exhaustive test sets for algebraic specification correctness. Journal of Software Testing, Verification, and Reliability, John Wiley & Sons, 2016, 26 (4), pp.294-317. ⟨http://onlinelibrary.wiley.com/doi/10.1002/stvr.1598/abstract⟩. ⟨10.1002/stvr.1598 ⟩. ⟨hal-01318362⟩



Record views