Better bounds for event sequencing testing

Oded Margalit

doi:10.1109/ICSTW.2013.39

Better bounds for event sequencing testing

Oded Margalit

Research output: Contribution to conference › Paper › peer-review

12 Scopus citations

Abstract

A permutation of a sequence of events is a common construction in many testing environments. Covering all possible permutations has clearly an exponential behavior, so one can ask for partial (easier) requirement, to cover all possible orders: permutations induced on of a small cardinality subset of elements. In our paper we show better (both lower and upper) bounds on this event sequencing testing problem. We also discuss another variant of the problem where we impose restrictions on the permutations. In this case we show how to achieve an exponential growth in the complexity of the problem. We also give solutions for specific cases of the problem.

Original language	English
Pages	281-284
Number of pages	4
DOIs	https://doi.org/10.1109/ICSTW.2013.39
State	Published - 9 Sep 2013
Externally published	Yes
Event	IEEE 6th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2013 - Luxembourg, Luxembourg Duration: 18 Mar 2013 → 20 Mar 2013

Conference

Conference	IEEE 6th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2013
Country/Territory	Luxembourg
City	Luxembourg
Period	18/03/13 → 20/03/13

Keywords

Algorithm design and analysis
combinatorial testing
covering array
event sequence testing
program testing
software testing

ASJC Scopus subject areas

Software

Access to Document

10.1109/ICSTW.2013.39

Cite this

@conference{592c74c55adc46c2b51ab5b14d47d590,

title = "Better bounds for event sequencing testing",

abstract = "A permutation of a sequence of events is a common construction in many testing environments. Covering all possible permutations has clearly an exponential behavior, so one can ask for partial (easier) requirement, to cover all possible orders: permutations induced on of a small cardinality subset of elements. In our paper we show better (both lower and upper) bounds on this event sequencing testing problem. We also discuss another variant of the problem where we impose restrictions on the permutations. In this case we show how to achieve an exponential growth in the complexity of the problem. We also give solutions for specific cases of the problem.",

keywords = "Algorithm design and analysis, combinatorial testing, covering array, event sequence testing, program testing, software testing",

author = "Oded Margalit",

year = "2013",

month = sep,

day = "9",

doi = "10.1109/ICSTW.2013.39",

language = "English",

pages = "281--284",

note = "IEEE 6th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2013 ; Conference date: 18-03-2013 Through 20-03-2013",

}

TY - CONF

T1 - Better bounds for event sequencing testing

AU - Margalit, Oded

PY - 2013/9/9

Y1 - 2013/9/9

N2 - A permutation of a sequence of events is a common construction in many testing environments. Covering all possible permutations has clearly an exponential behavior, so one can ask for partial (easier) requirement, to cover all possible orders: permutations induced on of a small cardinality subset of elements. In our paper we show better (both lower and upper) bounds on this event sequencing testing problem. We also discuss another variant of the problem where we impose restrictions on the permutations. In this case we show how to achieve an exponential growth in the complexity of the problem. We also give solutions for specific cases of the problem.

AB - A permutation of a sequence of events is a common construction in many testing environments. Covering all possible permutations has clearly an exponential behavior, so one can ask for partial (easier) requirement, to cover all possible orders: permutations induced on of a small cardinality subset of elements. In our paper we show better (both lower and upper) bounds on this event sequencing testing problem. We also discuss another variant of the problem where we impose restrictions on the permutations. In this case we show how to achieve an exponential growth in the complexity of the problem. We also give solutions for specific cases of the problem.

KW - Algorithm design and analysis

KW - combinatorial testing

KW - covering array

KW - event sequence testing

KW - program testing

KW - software testing

UR - http://www.scopus.com/inward/record.url?scp=84883436862&partnerID=8YFLogxK

U2 - 10.1109/ICSTW.2013.39

DO - 10.1109/ICSTW.2013.39

M3 - Paper

AN - SCOPUS:84883436862

SP - 281

EP - 284

T2 - IEEE 6th International Conference on Software Testing, Verification and Validation Workshops, ICSTW 2013

Y2 - 18 March 2013 through 20 March 2013

ER -

Better bounds for event sequencing testing

Abstract

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this