Exhaustive test sets for algebraic specification correctness - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Journal of Software Testing, Verification and Reliability Année : 2016

Exhaustive test sets for algebraic specification correctness

Résumé

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.

Dates et versions

hal-01318362 , version 1 (19-05-2016)

Identifiants

Citer

Marc Aiguier, Agnès Arnould, Pascale Le Gall, Delphine Longuet. Exhaustive test sets for algebraic specification correctness. Journal of Software Testing, Verification and Reliability, 2016, 26 (4), pp.294-317. ⟨10.1002/stvr.1598⟩. ⟨hal-01318362⟩
169 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More