Combinatorial Methods for Event Sequence Testing

Published

April 21, 2012

Author(s)

D. Richard Kuhn, James M. Higdon, James F. Lawrence, Raghu N. Kacker, Yu Lei

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.

Proceedings Title

Proceedings of the IEEE Fifth International Conference on Software, Testing, Verification and Validation (ICST 2012)

Conference Dates

April 17-21, 2012

Conference Location

Montreal, CA

Conference Title

First International Workshop on Combinatorial Testing

Pub Type

Conferences

Download Paper

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

Local Download

Keywords

combinatorial testing, covering array, event sequence testing, software testing

Citation

Kuhn, D. , Higdon, J. , Lawrence, J. , Kacker, R. and Lei, Y. (2012), Combinatorial Methods for Event Sequence Testing, Proceedings of the IEEE Fifth International Conference on Software, Testing, Verification and Validation (ICST 2012) , Montreal, CA, [online], https://doi.org/10.1109/ICST.2012.147, https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=906770 (Accessed October 31, 2024)