2015
DOI: 10.1016/bs.adcom.2015.05.003
|View full text |Cite
|
Sign up to set email alerts
|

Combinatorial Testing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 53 publications
(5 citation statements)
references
References 29 publications
0
5
0
Order By: Relevance
“…Specifically, these are used to orient an event on a timeline, specify the duration of an event, and determine the order of an event to other events. There are two main types of temporal constraints, sequencing and real-time (Kuhn et al, 2015 ). Sequencing constraints specify the order in which a sequence of actions or events is allowed to take place.…”
Section: Discussionmentioning
confidence: 99%
“…Specifically, these are used to orient an event on a timeline, specify the duration of an event, and determine the order of an event to other events. There are two main types of temporal constraints, sequencing and real-time (Kuhn et al, 2015 ). Sequencing constraints specify the order in which a sequence of actions or events is allowed to take place.…”
Section: Discussionmentioning
confidence: 99%
“…[1, p. 26, Sec. 2.4] An example of testing based on input domains is combinatorial testing [12,13], which partitions the input space into groups and tests all n-way combinations of the groups. Block, branch, and data flow coverage are graph coverage criteria.…”
Section: Supplemental: Coverage Metricsmentioning
confidence: 99%
“…• General security principles-find security vulnerabilities, such as failure to check credentials, since these often do not cause operational failures (crashes or incorrect output), • Negative tests-make sure that software behaves reasonably for invalid inputs and that it does not do what it should not do, for instance ensure that a user cannot perform operations for which they are not authorized [11,Sec. 8.B], • Combinatorial testing-find errors occurring when handling certain n-tuples of kinds of input [12,13], and • Denial of service and overload-make sure software is resilient.…”
Section: Supplemental: Sources Of Test Casesmentioning
confidence: 99%
“…There are various techniques to build a covering array [3]: algebraic techniques, greedy algorithms, heuristic search, and constraint satisfaction. Greedy algorithms can work onerow-at-a-time, like AETG [4], or horizontally and vertically expanding the solution, like IPOG [5].…”
Section: Introductionmentioning
confidence: 99%