Association of Under-Approximation Techniques for Generating Tests from Models - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2011

Association of Under-Approximation Techniques for Generating Tests from Models

Résumé

In this paper we present a Model-Based Testing approach with which we generate tests from an abstraction of a source behavioural model. We show a new algorithm that computes the abstraction as an under-approximation of the source model. Our first contribution is to combine two previous approaches proposed by Ball and Pasareanu et al. to compute May, Must+ and Must- abstract transition relations. Proof techniques are used to compute these transition relations. The tests obtained by covering the abstract transitions have to be instantiated from the source model. So, following Pasareanu et al., our algorithm additionally computes a concrete transition relation: the tests obtained as sequences of concrete transitions need not be instantiated from the source model. Another contribution is to propose a choice of relevant paramaters and heuristics to pilot the tests computation. We experiment our approach and compare it with a previous approach of ours to compute tests from an abstraction that over-approximates the source model.
Fichier principal
Vignette du fichier
bjm11:ip-author.pdf (236.82 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01222515 , version 1 (30-10-2015)

Identifiants

  • HAL Id : hal-01222515 , version 1

Citer

Pierre Bué, Jacques Julliand, Pierre Masson. Association of Under-Approximation Techniques for Generating Tests from Models. TAP'11, 5-th Int. Conf. of Tests and Proofs, 2011, Zurich, Switzerland. pp.51--68. ⟨hal-01222515⟩
69 Consultations
89 Téléchargements

Partager

Gmail Facebook X LinkedIn More