Jump to : Download | Abstract | Contact | BibTex reference | EndNote reference |
Download paper Gziped Postscript (.ps.gz)
Copyright noticeThis material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
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.
Bertrand Jeannet
Bertrand.Jeannet@irisa.fr
Thierry Jéron
Thierry.Jeron@irisa.fr
Vlad Rusu
Vlad.Rusu@irisa.fr
Elena Zinovieva
elena.zinovieva@irisa.fr
@TechReport{jeannet04c,
Author = {Jeannet, B. and Jéron, T. and Rusu, V. and Zinovieva, E.},
Title = {Symbolic test selection using approximate analysis},
Number = {1649},
Institution = {IRISA},
Month = {October},
Year = {2004}
}
Get EndNote Reference (.ref)