Using genetic algorithms and coupling measures to devise optimal integration test orders

ABSTRACT

We present here an improved strategy to devise optimal integration test orders in object-oriented systems. Our goal is to minimize the complexity of stubbing during integration testing as this has been shown to be a major source of expenditure. Our strategy to do so is based on the combined use of inter-class coupling measurement and genetic algorithms. The former is used to assess the complexity of stubs and the latter is used to minimize complex cost functions based on coupling measurement. Using a precisely defined procedure, we investigate this approach in a case study involving a real system. Results are very encouraging as the approach clearly helps obtaining systematic and optimal results.

REFERENCES

• 1: T. Back, "The Interaction of Mutation Rate, Selection, and Self-Adaptation Within a Genetic Algorithm," Proc. Parallel Problem Solving from Nature (PPSN'92), Brussels (Belgium), pp. 85-94, September 28-30, 1992.
• 2: Lionel C. Briand , John W. Daly , Jürgen K. Wüst, A Unified Framework for Coupling Measurement in Object-Oriented Systems, IEEE Transactions on Software Engineering, v.25 n.1, p.91-121, January 1999 [doi>10.1109/32.748920]
• 3: L. Briand, J. Feng and Y. Labiche, "Experimenting with Genetic Algorithms to Devise Optimal Integration Test Orders," Carleton University, Technical Report SCE-02-03, March, 2002, http://www.sce.carleton.ca/Squall/Articles/TR_SCE-02-03.pdf.
• 4: Lionel C. Briand , Yvan Labiche , Yihong Wang, Revisiting Strategies for Ordering Class Integration Testing in the Presence of Dependency Cycles, Proceedings of the 12th International Symposium on Software Reliability Engineering (ISSRE'01), p.287, November 27-30, 2001
• 5: L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold, 1991.
• 6: Kenneth Alan De Jong, An analysis of the behavior of a class of genetic adaptive systems., 1975
• 7: David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
• 8: B. F. Jones (Ed.), Special Issue on Metaheuristic Algorithms in Software Engineering, Information and Software Technology, vol. 43 (14), 2001.
• 9: D. Kung, J. Gao, P. Hsia, J. Lin and Y. Toyoshima, "Class Firewall, test order, and regression testing of object-oriented programs," Journal of Object-Oriented Programming, vol. 8 (2), pp. 51-65, 1995.
• 10: Y. Labiche , P. Thévenod-Fosse , H. Waeselynck , M.-H. Durand, Testing levels for object-oriented software, Proceedings of the 22nd international conference on Software engineering, p.136-145, June 04-11, 2000, Limerick, Ireland [doi>10.1145/337180.337197]
• 11: E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan and D. B. Shmoys, The Traveling Salesman Problem, Wiley, 1985.
• 12: Y. Le Traon, J.-M. Jézéquel and P. Morel, "Efficient Object-Oriented Integration and Regression Testing," IEEE Trans. on Reliability, vol. 49 (1), pp. 12-25, 2000.
• 13: Palisade, Evolver, the Genetic Algorithm Super Solver, 1998.
• 14: K.-C. Tai and F. J. Daniels, "Interclass Test Order for Object-Oriented Software," Journal of Object-Oriented Programming, vol. 12 (4), pp. 18-25,35, 1999.
• 15: David M. Tate , Alice E. Smith, Expected Allele Coverage and the Role of Mutation in Genetic Algorithms, Proceedings of the 5th International Conference on Genetic Algorithms, p.31-37, June 01, 1993
• 16: S. R. Thangiah and K. E. Nygard, "School bus routing using genetic algorithms," Proc. Applications of Artificial Intelligence SPIE Conference, pp. 387-398, 1992.

INDEX TERMS

Keywords:
genetic algorithms, integration order, integration testing, object-oriented software engineering