Classification Tree Method: Difference between revisions

Revision as of 11:54, 12 August 2013

Revision as of 11:59, 12 August 2013

Line 65:

== Enhancements ==

=== Classification Tree Method for Embedded Systems ===

Originally, the classification tree method was intended for the design and specification of abstract test cases. With the classification tree method for embedded systems<ref>{{cite journal|last=Conrad|first=Mirko|coauthors=Krupp, Alexander|title=An Extension of the Classification-Tree Method for Embedded Systems for the Description of Events|journal=Electronic Notes in Theoretical Computer Science|date=1 October 2006|volume=164|issue=4|pages=3–11|doi=10.1016/j.entcs.2006.09.002}}</ref>, test implementation can also be performed.

Originally, theThe classification tree method first was intended for the design and specification of abstract test cases. With the classification tree method for embedded systems<ref>{{cite journal|last=Conrad|first=Mirko|coauthors=Krupp, Alexander|title=An Extension of the Classification-Tree Method for Embedded Systems for the Description of Events|journal=Electronic Notes in Theoretical Computer Science|date=1 October 2006|volume=164|issue=4|pages=3–11|doi=10.1016/j.entcs.2006.09.002}}</ref>, test implementation can also be performed. The module and [[unit testing]] tool [[Tessy (software)|Tessy]] relies on this extention.

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

== Advantages ==