Symbolic Test Selection Based on Approximate Analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Symbolic Test Selection Based on Approximate Analysis


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.
Fichier principal
Vignette du fichier
tacas05.pdf (279.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00564617 , version 1 (09-02-2011)


  • 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. ⟨inria-00564617⟩
102 View
137 Download


Gmail Facebook Twitter LinkedIn More