You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

A Global Algorithm for Model-Based Test Suite Generation

Fulltext:


Authors:

Anders Hessel, Paul Pettersson

Publication Type:

Conference/Workshop Paper

Venue:

Proceedings of Third Workshop on Model-Based Testing

Publisher:

Electronic Notes in Theoretical Computer Science 16697

Abstract

Model-based testing has been proposed as a technique to automatically verify that a system conforms to its specification. A popular approach is to use a model-checker to produce a set of test cases by formulating the test generation problem as a reachability problem. To guide the selection of test cases, a coverage criterion is often used. A coverage criterion can be seen as a set of items to be covered, called coverage items. We propose an on-the-fly algorithm that generates a test suite that covers all feasible coverage items. The algorithm returns a set of traces that includes a path fulfilling each item, without including redundant paths. The reachability algorithm explores a state only if it might increase the total coverage. The decision is global in the sense that it does not only regard each individual local search branch in isolation, but the total coverage in all branches together. For simpler coverage criteria as location of edge coverage, this implies that each model state is never explored twice.The algorithm presented in this paper has been implemented in the test generation tool UPPAAL CoVer. We present encouraging results from applying the tool to a set of experiments and in an industrial sized case study.

Bibtex

@inproceedings{Hessel1018,
author = {Anders Hessel and Paul Pettersson},
title = {A Global Algorithm for Model-Based Test Suite Generation},
month = {March},
year = {2007},
booktitle = {Proceedings of Third Workshop on Model-Based Testing},
publisher = {Electronic Notes in Theoretical Computer Science 16697},
url = {http://www.es.mdu.se/publications/1018-}
}