|IEEE Transactions on Software Engineering 37 (5): 616-634 (2011)|
Xin Feng 1 , David L. Parnas 1 , T.H. Tse 2 , and Tony O'Callaghan 3
[paper from IEEE Xplore | paper from IEEE digital library | technical report TR-2009-19]
Tabular expressions have been proposed as a notation to document mathematically
precise but readable software specifications.
One of the many roles of such documentation is to guide testers.
a) explores the application of four testing strategies
(the partition strategy, decision table-based testing,
the basic meaningful impact strategy, and fault-based testing)
to tabular expression-based specifications, and
b) compares the strategies on a mathematical basis through formal
and precise definitions of the subsumption relationship.
We also compare these strategies through experimental studies.
These results will help researchers improve current methods and will
enable testers to select appropriate testing strategies for tabular
Keywords: Tabular expression, test case constraint, subsume, unconditionally subsume, conditionally subsume
|EVERY VISITOR COUNTS:|