Classification Tree Method: Difference between revisions

Revision as of 13:04, 17 July 2023

Revision as of 12:07, 22 July 2023

Line 87:

=== Test Sequence Generation ===

With the addition of valid transitions between individual classes of a classification, classifications can be interpreted as a [[Finite-state machine|state machine]], and therefore the whole classification tree as a [[Statechart#Harel statechart|Statechart]]. This defines an allowed order of class usages in test steps and allows to automatically create test sequences.<ref name="seqgen">{{cite book|last=Kruse|first=Peter M.|author2=Wegener, Joachim|title=2012 IEEE Fifth International Conference on Software Testing, Verification and Validation |chapter=Test Sequence Generation from Classification Trees |journal=Software Testing, Verification and Validation (ICST), 2012 IEEE Fifth International Conference on|date=April 2012|pages=539–548|doi=10.1109/ICST.2012.139|isbn=978-0-7695-4670-4|s2cid=581740}}</ref> Different coverage levels are available, such as [[Code coverage#Basic coverage criteria|state coverage]], transitions coverage and coverage of state pairs and transition pairs.

=== Numerical Constraints ===

In addition to Boolean dependency rules referring to classes of the classification tree, Numerical Constraints allow to specify [[formula]]s with classifications as variables, which will evaluate to the selected class in a test case.<ref name="numdeb">{{cite book|last=Kruse|first=Peter M.|author2=Bauer, Jürgen |author3=Wegener, Joachim |title=2012 IEEE Fifth International Conference on Software Testing, Verification and Validation |chapter=Numerical Constraints for Combinatorial Interaction Testing |journal=Software Testing, Verification and Validation (ICST), 2012 IEEE Fifth International Conference on|date=April 2012|pages=758–763|doi=10.1109/ICST.2012.170|isbn=978-0-7695-4670-4|s2cid=16683773}}</ref>

== Classification Tree Editor ==

Line 206:

* When test design with the classification tree method is performed without proper test decomposition, classification trees can get large and cumbersome.

* New users tend to include too many (esp. irrelevant) test aspects resulting in too many test cases.

* There is no algorithm or strict guidance for selection of test relevant aspects.<ref>{{cite book|last=Chen|first=T.Y.|author2=Poon, P.-L.|title=Proceedings of 1996 Australian Software Engineering Conference |chapter=Classification-Hierarchy Table: aA methodology for constructing the classification tree |journal=Australian Software Engineering Conference, 1996., Proceedings of 1996|year=1996|pages=93–104|doi=10.1109/ASWEC.1996.534127|isbn=978-0-8186-7635-2|s2cid=6789744}}</ref>

== References ==