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 Test Case Generation Algorithm for Real-Time Systems .

Fulltext:


Publication Type:

Conference/Workshop Paper

Venue:

the 4th International Conference on Quality Software

Publisher:

IEEE Computer Society,


Abstract

In this paper, we describe how the real-time verification tool UPPAAL has been extended to support automatic generation of time-optimal test suites for conformance testing. Such test suites are derived from a network of timed automata specifying the expected behaviour of the system under test and its environment. To select test cases, we use coverage criteria specifying structural criteria to be fulfilled by the test suite. The result is optimal in the sense that the set of test cases in the test suite requires the shortest possible accumulated time to cover the given coverage criterion. The main contributions of this paper are: (i) a modified reachability analysis algorithm in which the coverage of given criteria is calculated in an on-the-fly manner, (ii) a technique for efficiently manipulating the sets of covered elements that arise during the analysis, and (iii) an extension to the requirement specification language used in UPPAAL, making it possible to express a variety of coverage criteria.

Bibtex

@inproceedings{Hessel2045,
author = {Anders Hessel and Paul Pettersson},
title = { A Test Case Generation Algorithm for Real-Time Systems .},
editor = {Hans-Dieter Ehrich and Klaus-Dieter Schewe},
pages = {268--273},
month = {May},
year = {2004},
booktitle = { the 4th International Conference on Quality Software},
publisher = {IEEE Computer Society,},
url = {http://www.es.mdu.se/publications/2045-}
}