Classification Tree Method: Difference between revisions

Revision as of 08:45, 12 August 2013

Revision as of 08:53, 12 August 2013

Line 1:

{{AFC submission|t||ts=20130812084544|u=OMPwiki|ns=5}} <!--- Important, do not remove this line before article has been created. --->

The '''Classification Tree Method''' is a method for test design, as it is used in different areas of [[software development]] (e.g. [[embedded systems]] …).

It has been developed by Grimm and Grochtmann in 1993<ref>{{cite journal|last=Grimm|first=Klaus|coauthors=Grochtmann, Matthias|title=Classification Trees for Partition Testing|journal=Software Testing, Verification & Reliability|year=1993|volume=3|issue=2|pages=63-82}}</ref> .

Classification Trees in terms of the Classification Tree Method must not be confused with [[decision treestree]]s.

The classification tree method consists of two mayor steps: (1) Identification of test relevant aspects (so called ''classifications'') and their corresponding values (called ''classes'') as well as (2) Combination of different classes from all classifications into [[test casescase]]s.

The identification of test relevant aspects usually follows the (functional) specification (e.g. [[requirements]], uses cases …) of the [[system under test]].

These aspects form the input and output data space of the test object.