The choice relation framework (CHOC' LATE) provides a systematic skeleton for constructing test cases from specifications. An early stage of the framework is to identify a set of categories and choices from the speci- fication, which is not a trivial task when this document is largely informal and complex. Despite the difficulty, the identification task is very important because the quality of the identified categories and choices will affect the comprehensiveness of the test cases and, hence, the chance of revealing software faults. This paper alleviates the problem by introducing a technique for identifying categories and choices from the activity diagrams in the specification. This technique also helps determine the relations between some pair of choices in the choice relation table - an essential step of CHOC' LATE for the subsequent generation of test cases.
Description
ST: Vorgehensweise: Aktivitätsdiagramme werden an Entscheidungspunkten mit „guard conditions“ versehen. Der vorgestellte Algorithmus kann nun basierend darauf eine Kategorien und bilden und Repräsentanten auswählen.
Eignung: Diese Vorgehensweise ist vielversprechend da in unserem Ansatz die Aktivitätsdiagramme ebenfalls mit „guard conditions“ versehen sind. Die Testdaten könnten so vollständig automatisch abgeleitet werden.
%0 Conference Paper
%1 Chen2005
%A Chen, T. Y.
%A Tang, Sau-Fun
%A Poon, Pak-Lok
%A Tse, T. H.
%B QSIC '05: Proceedings of the Fifth International Conference on Quality Software
%C Washington, DC, USA
%D 2005
%I IEEE Computer Society
%K activity category-partition classification-tree-method diagrams specification-based test testing
%P 55--63
%R http://dx.doi.org/10.1109/QSIC.2005.36
%T Identification of Categories and Choices in Activity Diagrams
%U http://portal.acm.org/citation.cfm?id=1110491&dl=&coll=
%X The choice relation framework (CHOC' LATE) provides a systematic skeleton for constructing test cases from specifications. An early stage of the framework is to identify a set of categories and choices from the speci- fication, which is not a trivial task when this document is largely informal and complex. Despite the difficulty, the identification task is very important because the quality of the identified categories and choices will affect the comprehensiveness of the test cases and, hence, the chance of revealing software faults. This paper alleviates the problem by introducing a technique for identifying categories and choices from the activity diagrams in the specification. This technique also helps determine the relations between some pair of choices in the choice relation table - an essential step of CHOC' LATE for the subsequent generation of test cases.
%@ 0-7695-2472-9
@inproceedings{Chen2005,
abstract = {The choice relation framework (CHOC' LATE) provides a systematic skeleton for constructing test cases from specifications. An early stage of the framework is to identify a set of categories and choices from the speci- fication, which is not a trivial task when this document is largely informal and complex. Despite the difficulty, the identification task is very important because the quality of the identified categories and choices will affect the comprehensiveness of the test cases and, hence, the chance of revealing software faults. This paper alleviates the problem by introducing a technique for identifying categories and choices from the activity diagrams in the specification. This technique also helps determine the relations between some pair of choices in the choice relation table - an essential step of CHOC' LATE for the subsequent generation of test cases.},
added-at = {2010-01-12T10:02:16.000+0100},
address = {Washington, DC, USA},
author = {Chen, T. Y. and Tang, Sau-Fun and Poon, Pak-Lok and Tse, T. H.},
biburl = {https://www.bibsonomy.org/bibtex/235bf31ceea5f91ddbed0348764e22e59/ist_spl},
booktitle = {QSIC '05: Proceedings of the Fifth International Conference on Quality Software},
description = {ST: Vorgehensweise: Aktivitätsdiagramme werden an Entscheidungspunkten mit „guard conditions“ versehen. Der vorgestellte Algorithmus kann nun basierend darauf eine Kategorien und bilden und Repräsentanten auswählen.
Eignung: Diese Vorgehensweise ist vielversprechend da in unserem Ansatz die Aktivitätsdiagramme ebenfalls mit „guard conditions“ versehen sind. Die Testdaten könnten so vollständig automatisch abgeleitet werden.},
doi = {http://dx.doi.org/10.1109/QSIC.2005.36},
interhash = {f8187ac03c24234f57c4363f698033dd},
intrahash = {35bf31ceea5f91ddbed0348764e22e59},
isbn = {0-7695-2472-9},
keywords = {activity category-partition classification-tree-method diagrams specification-based test testing},
pages = {55--63},
publisher = {IEEE Computer Society},
timestamp = {2010-01-12T10:02:17.000+0100},
title = {Identification of Categories and Choices in Activity Diagrams},
url = {http://portal.acm.org/citation.cfm?id=1110491&dl=&coll=},
year = 2005
}