Discovering accurate interclass test dependences

  • Authors:
  • Weilei Zhang;Barbara G. Ryder

  • Affiliations:
  • Rutgers University, Piscataway, NJ;Rutgers University, Piscataway, NJ

  • Venue:
  • PASTE '07 Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Knowledge of interclass test dependences is crucial to decide class test order, facilitating the design of an efficient integration test plan. In order to discover precise interclass test dependences, we proposed a semantic-based definition and designed a safe approximation algorithm to calculate the dependence according to the given definition. The algorithm propagates semantic dependences at method-level granularity and is parameterized by the precision of the corresponding program analysis. We have experimented with nine benchmarks and showed that the algorithm is rather accurate in that it discovers dependence cycles precisely in 6 out of 9 benchmarks (as evaluated by human inspection). The algorithm uncovers additional opportunities for concurrent testing in each of the benchmarks, with an on average expected 52.5% time savings over the ORD-based definition.