Classification Tree Method: Difference between revisions

Revision as of 07:56, 22 August 2019

Revision as of 12:15, 16 September 2019

Line 65:

: CTM allows modeling of hierarchical refinements in the classification tree, also called ''implicit dependencies''.

* '''Tool support''': The tool presented by Ostrand and Balcer only supported test case generation, but not the partitioning itself.

: Grochtmann and Wegener presented their tool, the [[Classification Tree Editor]] (CTE) which supports both partitioning as well as test case generation.<ref name="GW">{{cite journal|last=Grochtmann|first=Matthias|author2=Wegener, Joachim|title=Test Case Design Using Classification Trees and the Classification-Tree Editor CTE|journal=Proceedings of the 8th International Software Quality Week(QW '95), San Francisco, USA|year=1995|url=http://www.systematic-testing.com/documents/qualityweek1995_1.pdf|access-date=2013-08-12|archive-url=https://web.archive.org/web/20150924112623/http://www.systematic-testing.com/documents/qualityweek1995_1.pdf|archive-date=2015-09-24|dead-url-status=yesdead}}</ref>

[[File:Classification Tree for Embedded System.png|thumb|Classification Tree for Embedded System Example containing concrete values, concrete timing, (different) transitions and distinguish between States and Actions]]

Line 79:

=== Dependency Rules and Automated Test Case Generation ===

One way of modelling constraints is using the refinement mechanism in the classification tree method. This, however, does not allow for modelling [[Constraint (information theory)|constraint]]s between classes of different classifications. Lehmann and Wegener introduced Dependency Rules based on [[Boolean expression]]s with their incarnation of the CTE.<ref name="LW">{{cite journal|last=Lehmann|first=Eckard|author2=Wegener, Joachim|title=Test Case Design by Means of the CTE XL|journal=Proceedings of the 8th European International Conference on Software Testing, Analysis & Review (EuroSTAR 2000)|year=2000|url=http://www.systematic-testing.com/documents/eurostar2000.pdf|access-date=2013-08-12|archive-url=https://web.archive.org/web/20160304191237/http://www.systematic-testing.com/documents/eurostar2000.pdf|archive-date=2016-03-04|dead-url-status=yesdead}}</ref> Further features include the automated generation of [[test suite]]s using combinatorial test design (e.g. [[all-pairs testing]]).

=== Prioritized Test Case Generation ===