Symbolic Test Selection Based on Approximate Analysis

Abstract : This paper addresses the problem of generating symbolic test cases for testing the conformance of a black-box implementation with respect to a specification, in the context of reactive systems. The challenge we consider is the selection of test cases according to a test purpose, which is here a set of scenarii of interest that one wants to observe during test execution. Because of the interactions that occur between the test case and the implementation, test execution can be seen as a game involving two players, in which the test case attempts to satisfy the test purpose. Efficient solutions to this problem have been proposed in the context of finite-state models, based on the use of fixpoint computations. We extend them in the context of infinite-state symbolic models, by showing how approximate fixpoint computations can be used in a conservative way. The second contribution we provide is the formalization of a quality criterium for test cases, and a result relating the quality of a generated test case to the approximations used in the selection algorithm.
Type de document :
Communication dans un congrès
TACAS, 2005, Edinburgh, United Kingdom. 2005
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger
Contributeur : Mister Dart <>
Soumis le : mercredi 9 février 2011 - 14:36:42
Dernière modification le : mercredi 11 avril 2018 - 01:55:09
Document(s) archivé(s) le : mardi 10 mai 2011 - 03:20:05


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00564617, version 1



Bertrand Jeannet, Thierry Jéron, Vlad Rusu, Elena Zinovieva. Symbolic Test Selection Based on Approximate Analysis. TACAS, 2005, Edinburgh, United Kingdom. 2005. 〈inria-00564617〉



Consultations de la notice


Téléchargements de fichiers