A Case Study Using the Round-Trip Strategy for State-Based Class Testing

  • Authors:
  • G. Antoniol;L. C. Briand;M. Di Penta;Y. Labiche

  • Affiliations:
  • -;-;-;-

  • Venue:
  • ISSRE '02 Proceedings of the 13th International Symposium on Software Reliability Engineering
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

A number of strategies have been proposed for state-basedclass testing. An important proposal made byChow, that was subsequently adapted by Binder, consistsin deriving test sequences covering all round-trip paths ina finite state machine (FSMs). Based on a number of(rather strong) assumptions, and for traditional FSMs, itcan be demonstrated that all operation and transfererrors in the implementation can be uncovered. Throughexperimentation, this paper investigates this strategywhen used in the context of UML statecharts. Based on aset of mutation operators proposed for object-orientedcode we seed a significant number of faults in animplementation of a specific container class. We theninvestigate the effectiveness of four test teams atuncovering faults, based on the round-trip path strategy,and analyze the faults that seem to be difficult to detect.Our main conclusion is that the round-trip path strategyis reasonably effective at detecting faults (87% average asopposed to 69% for size-equivalent, random test cases)but that a significant number of faults can only exhibit ahigh detection probability by augmenting the round-tripstrategy with a traditional black-box strategy such ascategory-partition testing. This increases the number oftest cases to run --and therefore the cost of testing-- anda cost-benefit analysis weighting the increase of testingeffort and the likely gain in fault detection is necessary.