An Efficient Design and Implementation of the In-Parameter-Order Algorithm

The In-Parameter-Order-General algorithm is one of the most widely used algorithms for covering array generation. It has found wide adoption in the field of combinatorial testing as it produces acceptably small covering arrays while being faster than alternative algorithms. In this paper we describe...

Full description

Saved in:
Bibliographic Details
Published inMathematics in computer science Vol. 12; no. 1; pp. 51 - 67
Main Authors Kleine, Kristoffer, Simos, Dimitris E.
Format Journal Article
LanguageEnglish
Published Cham Springer International Publishing 01.03.2018
Springer Nature B.V
Subjects
Algorithms
Combinatorial analysis
Computer Science
Mathematics
Mathematics and Statistics
Order parameters
Generation
68R99
Secondary 68W01
Covering arrays
Performance
Algorithm
Primary 05B15
Optimization
Online AccessGet full text

Cover

More Information
Summary:The In-Parameter-Order-General algorithm is one of the most widely used algorithms for covering array generation. It has found wide adoption in the field of combinatorial testing as it produces acceptably small covering arrays while being faster than alternative algorithms. In this paper we describe in detail how to efficiently design an efficient implementation, referred to as Fast In-Parameter-Order-General algorithm, which improves test generation times significantly while maintaining a low memory footprint compared to existing implementations. Besides the general algorithmic engineering and optimization considerations, we analyse and evaluate their benefits in an experimental study.
ISSN:1661-8270
1661-8289
DOI:10.1007/s11786-017-0326-0