Jim Lawrence
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Jim Lawrence has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- D. Richard Kuhn
National Institute of Standards and Technology, Gaithersburg, MD 20899
1 shared publication - Michael Forbes
National Institute of Standards and Technology, Gaithersburg, MD 20899
1 shared publication - Raghu N. Kacker
National Institute of Standards and Technology, Gaithersburg, MD, USA
1 shared publication - Yu Lei
University of Texas at Arlington, Arlington, TX 76019
1 shared publication
Latest Publications
- 1 September 2008
- Published by National Institute of Standards and Technology (NIST) in Journal of Research of the National Institute of Standards and Technology
- Vol. 113 (5) , 287-297
Refining the In-Parameter-Order Strategy for Constructing Covering Arrays
Covering arrays are structures for well-representing extremely large input spaces and are used to efficiently implement blackbox testing for software and hardware. This paper proposes refinements over the In-Parameter-Order strategy (for arbitrary t). When constructing homogeneous-alphabet covering arrays, these refinements reduce runtime in nearly all cases by a factor of more than 5 and in some cases by factors as large as 280. This trend is increasing with the number of columns in the covering array. Moreover, the resulting covering arrays are about 5 % smaller. Consequently, this new algorithm has constructed many covering arrays that are the smallest in the literature. A heuristic variant of the algorithm sometimes produces comparably sized covering arrays while running significantly faster.
- 1 September 2008
- Published by National Institute of Standards and Technology (NIST) in Journal of Research of the National Institute of Standards and Technology
- Vol. 113 (5) , 287-297
Refining the In-Parameter-Order Strategy for Constructing Covering Arrays
Covering arrays are structures for well-representing extremely large input spaces and are used to efficiently implement blackbox testing for software and hardware. This paper proposes refinements over the In-Parameter-Order strategy (for arbitrary t). When constructing homogeneous-alphabet covering arrays, these refinements reduce runtime in nearly all cases by a factor of more than 5 and in some cases by factors as large as 280. This trend is increasing with the number of columns in the covering array. Moreover, the resulting covering arrays are about 5 % smaller. Consequently, this new algorithm has constructed many covering arrays that are the smallest in the literature. A heuristic variant of the algorithm sometimes produces comparably sized covering arrays while running significantly faster.