Combinatorial Methods for Event Sequence Testing

Kuhn, Richard; Higdon, J.; Lawrence, J.; Kacker, Raghu; Lei, Yu

doi:https://doi.org/10.1109/ICST.2012.147

July 19, 2023: URLs for CSRC publication details pages have changed. Legacy URLs should automatically redirect to the new URLs. However, links to the actual publications have NOT changed (e.g., DOIs and PDFs on nvlpubs.nist.gov). Please send inquiries to csrc-inquiry@nist.gov.

Conference Paper

Combinatorial Methods for Event Sequence Testing

Documentation

Published: April 21, 2012

Author(s)

Richard Kuhn, J. Higdon, J. Lawrence, Raghu Kacker, Yu Lei

Conference

Name: First International Workshop on Combinatorial Testing (CT 2012)
Dates: 04/17/2012 - 04/21/2012
Location: Montreal, Quebec, Canada
Citation: Proceedings of the IEEE Fifth International Conference on Software Testing, Verification and Validation (ICST 2012), pp. 601-609

Abstract

Many software testing problems involve sequences. This paper presents an application of combinatorial methods to testing problems for which it is important to test multiple configurations, but also to test the order in which events occur. For example, the methods described in this paper were motivated by testing needs for systems that may accept multiple communication or sensor inputs and generate output to several communication links and other interfaces. We use combinatorial methods to generate test sequences which ensure that any t events will be tested in every possible t-way order.

Keywords

combinatorial algorithms; combinatorial methods; software testing

Control Families

None selected

Documentation

Publication:
https://doi.org/10.1109/ICST.2012.147

Supplemental Material:
None available

Document History:
04/21/12: Conference Paper (Final)