skip to main content
article

Covering arrays for efficient fault characterization in complex configuration spaces

Published: 01 July 2004 Publication History

Abstract

Testing systems with large configurations spaces that change often is a challenging problem. The cost and complexity of QA explodes because often there isn't just one system, but a multitude of related systems. Bugs may appear in certain configurations, but not in others.The Skoll system and process has been developed to test these types of systems through distributed, continuous quality assurance, leveraging user resources around-the-world, around-the-clock. It has been shown to be effective in automatically characterizing configurations in which failures manifest. The derived information helps developers quickly narrow down the cause of failures which then improves turn around time for fixes. However, this method does not scale well. It requires one to exhaustively test each configuration in the configuration space.In this paper we examine an alternative approach. The idea is to systematically sample the configuration space, test only the selected configurations, and conduct fault characterization on the resulting data. The sampling approach we use is based on calculating a mathematical object called a covering array. We empirically assess the effect of using covering array derived test schedules on the resulting fault characterizations and provide guidelines to practitioners for their use.

References

[1]
L. Breiman, J. Freidman, R. Olshen, and C. Stone. Classification and Regression Trees. Wadsworth, Monterey, CA, 1984.
[2]
R. Brownlie, J. Prowse, and M. S. Padke. Robust testing of AT&T PMX/StarMAIL using OATS. AT&T Technical Journal, 71(3):41--7, 1992.
[3]
K. Burr and W. Young. Combinatorial test techniques: Table-based automation, test generation and code coverage. In Proc. of the Intl. Conf. on Software Testing Analysis & Review, 1998.
[4]
M. Chateauneuf and D. Kreher. On the state of strength-three covering arrays. Journal of Combinatorial Designs, 10(4):217--238, 2002.
[5]
D. M. Cohen, S. R. Dalal, M. L. Fredman, and G. C. Patton. The AETG system: an approach to testing based on combinatorial design. IEEE Transactions on Software Engineering, 23(7):437--44, 1997.
[6]
M. B. Cohen, C. J. Colbourn, P. B. Gibbons, and W. B. Mugridge. Constructing test suites for interaction testing. In Proc. of the Intl. Conf. on Software Engineering, (ICSE '03), pages 38--44, 2003.
[7]
S. R. Dalal, A. Jain, N. Karunanithi, J. M. Leaton, C. M. Lott, G. C. Patton, and B. M. Horowitz. Model-based testing in practice. In Proc. of the Intl. Conf. on Software Engineering, (ICSE), pages 285--294, 1999.
[8]
I. S. Dunietz, W. K. Ehrlich, B. D. Szablak, C. L. Mallows, and A. Iannino. Applying design of experiments to software testing. In Proc. of the Intl. Conf. on Software Engineering, (ICSE '97), pages 205--215, 1997.
[9]
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, pages 91--95, 2002.
[10]
R. Mandl. Orthogonal Latin squares: an application of experiment design to compiler testing. Communications of the ACM, 28(10):1054--1058, 1985.
[11]
A. Memon, A. Porter, C. Yilmaz, A. Nagarajan, D. C. Schmidt, and B. Natarajan. Skoll: Distributed continuous quality assurance. To be appear in Proc. of the Intl. Conf. on Software Engineering, (ICSE '04), 2004.
[12]
N. Sloane. Covering arrays and intersecting codes. Journal of Combinatorial Designs, 1(1):51--63, 1993.
[13]
I. H. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann, 1999.

Cited By

View all
  • (2023)Measurement and evaluation method of radar anti-jamming effectiveness based on principal component analysis and machine learningEURASIP Journal on Wireless Communications and Networking10.1186/s13638-023-02262-32023:1Online publication date: 1-Jul-2023
  • (2021)SYSMODIS: A Systematic Model Discovery Approach2021 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)10.1109/ICSTW52544.2021.00023(67-76)Online publication date: Apr-2021
  • (2020)Combinatorial test list generation based on Harmony Search AlgorithmJournal of Ambient Intelligence and Humanized Computing10.1007/s12652-020-01696-713:7(3361-3377)Online publication date: 21-Jan-2020
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGSOFT Software Engineering Notes
ACM SIGSOFT Software Engineering Notes  Volume 29, Issue 4
July 2004
284 pages
ISSN:0163-5948
DOI:10.1145/1013886
Issue’s Table of Contents
  • cover image ACM Conferences
    ISSTA '04: Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
    July 2004
    294 pages
    ISBN:1581138202
    DOI:10.1145/1007512
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 2004
Published in SIGSOFT Volume 29, Issue 4

Check for updates

Author Tags

  1. covering arrays
  2. distributed continuous quality assurance
  3. fault characterization
  4. software testing

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)7
  • Downloads (Last 6 weeks)0
Reflects downloads up to 01 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Measurement and evaluation method of radar anti-jamming effectiveness based on principal component analysis and machine learningEURASIP Journal on Wireless Communications and Networking10.1186/s13638-023-02262-32023:1Online publication date: 1-Jul-2023
  • (2021)SYSMODIS: A Systematic Model Discovery Approach2021 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW)10.1109/ICSTW52544.2021.00023(67-76)Online publication date: Apr-2021
  • (2020)Combinatorial test list generation based on Harmony Search AlgorithmJournal of Ambient Intelligence and Humanized Computing10.1007/s12652-020-01696-713:7(3361-3377)Online publication date: 21-Jan-2020
  • (2019)Towards an Automated Unified Framework to Run Applications for Combinatorial Interaction TestingProceedings of the 23rd International Conference on Evaluation and Assessment in Software Engineering10.1145/3319008.3319348(252-258)Online publication date: 15-Apr-2019
  • (2019)Wrapper for Building Classification Models Using Covering ArraysIEEE Access10.1109/ACCESS.2019.29446417(148297-148312)Online publication date: 2019
  • (2018)PerfLearner: learning from bug reports to understand and generate performance test framesProceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering10.1145/3238147.3238204(17-28)Online publication date: 3-Sep-2018
  • (2017)On the Effectiveness of Combinatorial Interaction Testing: A Case Study2017 IEEE International Conference on Software Quality, Reliability and Security Companion (QRS-C)10.1109/QRS-C.2017.20(69-76)Online publication date: Jul-2017
  • (2016)An Empirical Study on Performance Bugs for Highly Configurable Software SystemsProceedings of the 10th ACM/IEEE International Symposium on Empirical Software Engineering and Measurement10.1145/2961111.2962602(1-10)Online publication date: 8-Sep-2016
  • (2016)A Tabu Search hyper-heuristic strategy for t-way test suite generationApplied Soft Computing10.1016/j.asoc.2016.03.02144:C(57-74)Online publication date: 1-Jul-2016
  • (2014)Assessing Combinatorial Design for Analyzing System Performance of a Computer NetworkJournal of Zankoy Sulaimani - Part A10.17656/jzs.1034916:4(83-91)Online publication date: 16-Oct-2014
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media