Find the Best Greedy Algorithm with Base Choice Experiments for Covering Array Generation

Jing Jiang, Changhai Nie

Abstract

A number of greedy algorithms have been conducted for covering array construction, and most of them can be integrated into a framework, and more approaches can be derived from the framework. However, such a framework is affected by many factors, which makes its deployment and optimization very challenging. In order to identify the best configuration, we design Base Choice experiments based on six decisions of the framework to study systematically, providing theoretical and practical guideline for the design and optimization of the greedy algorithms.

References

  1. R. C. Bryce, C. J. Colbourn, M. B. Cohen: A Framework of Greedy Methods for Constructing Interaction Test Suite. In: Proceedings of 27th international conference on software engineering (ICSE2005). St. Louis, Missouri, USA, May 15-21, 2005:146-155.
  2. Changhai Nie, Hareton Leung: A suvery of combinatorial testing. ACM Computing Survey, 2011, 43(2).
  3. D. Kuhn and M. Reilly. An investigation of the applicability of design of experiments to software testing. Proc. 27th Annual NASA Goddard/IEEE Software Engineering Workshop, October 2002.
  4. A. W. Williams, R. L. Prober. A Practical Strategy for Testing Pair-wise Coverage of Network Interfaces. In Proceedings of 7th International Symposium on Software Reliability Engineering (ISSRE1996), White Plaints, NY, USA, October 30-November 2, 1997: 246-254.
  5. M. B. Cohen, P. B. Gibbons, W. B. Mugridge, C. J. Colbourn. Constructing Test Suites for Interaction Testing. In Proceedings of the 25th International Conference on Software Engineering (ICSE2003), Portland, Oregon, USA, May 3-10, 2003: 38-48.
  6. K. J. Nurmela. Upper Bounds for Covering Arrays by Tabu Search. Discrete Applied Mathematics, 2004, 138(1-2): 143-152.
  7. D. M. Cohen, S. R. Dalal, M. L. Fredman, G. C. Patton: The AETG system: an approach to testing based on combinatorial design. IEEE Transactions on Software Engineering, 23(7):437-44, October 1997.
  8. D. M. Cohen, S. R. Dalal, M. L. Fredman, J. Parelius, and G. C. Patton. The combinatorial design approach to automatic test generation. IEEE Software, 13(5):82-88, October 1996.
  9. Y. Tung, W. Aldiwan: Automating test case generation for the new generation mission software system. IEEE Aerospace Conf. , pages 431-37,2000.
  10. R. C. Bryce, C. J. Colbourn: The density algorithm for pairwise interaction testing. Journal of Software Testing, Verification, and Reliability, 2007.
  11. K. C. Tai, Y. Lei. A Test Generation Strategy for Pairwise Testing. IEEE Transaction on Software Engineering, 2002, 28(1): 109-111.
  12. M. Grindal, B. Lindastrom, A. J. Offutt, S. F. Andler: An Evaluation of COmbination Strategies for Test Case Selection. Empirical Software Engineering, 2006,11:583-611.
  13. C. H. Nie, B. W. Xu, Z. Y. Wang, L. Shi. Generating Optimal Test Set for Neighbor Factors Combinatorial Testing. QSIC 2006: 259-265.
  14. C. H. Nie, B. W. Xu, L. Shi, Z. Y. Wang. A new Heuristic for Test Suite GEneration for Pair-wise Testing. SEKE 2006:517-521.
Download


Paper Citation


in Harvard Style

Jiang J. and Nie C. (2011). Find the Best Greedy Algorithm with Base Choice Experiments for Covering Array Generation . In Proceeding of the 1st International Workshop on Evidential Assessment of Software Technologies - Volume 1: EAST, (ENASE 2011) ISBN 978-989-8425-58-4, pages 53-60


in Bibtex Style

@conference{east11,
author={Jing Jiang and Changhai Nie},
title={Find the Best Greedy Algorithm with Base Choice Experiments for Covering Array Generation},
booktitle={Proceeding of the 1st International Workshop on Evidential Assessment of Software Technologies - Volume 1: EAST, (ENASE 2011)},
year={2011},
pages={53-60},
publisher={SciTePress},
organization={INSTICC},
doi={},
isbn={978-989-8425-58-4},
}


in EndNote Style

TY - CONF
JO - Proceeding of the 1st International Workshop on Evidential Assessment of Software Technologies - Volume 1: EAST, (ENASE 2011)
TI - Find the Best Greedy Algorithm with Base Choice Experiments for Covering Array Generation
SN - 978-989-8425-58-4
AU - Jiang J.
AU - Nie C.
PY - 2011
SP - 53
EP - 60
DO -