Paper Info
Title
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 scenarios 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.
Year
DOI
Venue
2005
10.1007/978-3-540-31980-1_23
TACAS
Keywords
Field
DocType
approximate fixpoint computation,fixpoint computation,black-box implementation,test execution,symbolic test selection,approximate analysis,quality criterium,infinite-state symbolic model,test purpose,test case attempt,symbolic test case,test case,satisfiability,reactive system
Computer science,Selection algorithm,Model-based reasoning,Finite-state machine,Theoretical computer science,Test case,Fixed point,Reactive system,Message passing,Software development
Conference
Volume
ISSN
ISBN
3440
0302-9743
3-540-25333-5
Citations 
PageRank 
References 
43
1.82
14
Authors
4
Name
Order
Citations
PageRank
Bertrand Jeannet164129.06
Thierry Jéron2105391.06
Vlad Rusu346932.44
Elena Zinovieva41186.27