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.
Model-checking and testing are different activities, at least conceptually. While model-checking consists in comparing two specifications at different abstraction levels, testing consists in trying to find errors or gain some confidence in the correctness of an implementation with respect to a specification by the execution of test cases. Nevertheless, there are also similarities in models and algorithms. We argue for this by giving a new on-the-fly test generation algorithm which is an adaptation of a classical graph algorithm which also serves as a basis of some model-checking algorithms. This algorithm is the Tarjan's algorithm which computes the strongly connected components of a digraph.
Thierry Jéron
Thierry.Jeron@irisa.fr
@InProceedings{Jeron-Morel-CAV99,
Author = {Jéron, T. and Morel, P.},
Title = {Test generation derived from model-checking},
BookTitle = {CAV'99, Trento, Italy},
editor = {Halbwachs, N. and Peled, D.},
Volume = {1633},
Pages = {108--122},
Series = {LNCS},
Publisher = {Springer-Verlag},
Month = {July},
Year = {1999}
}
Get EndNote Reference (.ref)