Case studies and new results in combinatorial enumeration

Denny, Paul; Gibbons, Peter B.

doi:10.1002/1520-6610(2000)8:4<239::aid-jcd3>3.0.co;2-c

Cited by 14 publications

(1 citation statement)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Others have also studied test suite generation and application of CT [Blass and Gurevich 2002;Czerwonka 2006;Denny and Gibbons 2000;Dumitrescu 2003;Ghazi and Ahmed 2003;Hnich et al 2005Hnich et al , 2006Huller 2000;Kahng and Reda 2004;Maity and Nayak 2005;Nurmela 2004;Seroussi 1988;Tung and Aldiwan 2000;Turban 2006;White and Almezen 2000]. …”

Section: Related Worksupporting

confidence: 75%

The Minimal Failure-Causing Schema of Combinatorial Testing

Nie

Leung

2011

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

Combinatorial Testing (CT) involves the design of a small test suite to cover the parameter value combinations so as to detect failures triggered by the interactions among these parameters. To make full use of CT and to extend its advantages, this article first gives a model of CT and then presents a theory of the Minimal Failure-causing Schema (MFS), including the concept of the MFS, proof of its existence, some of its properties, and a method of finding the MFS. Then we propose a methodology for CT based on this MFS theory and the existing research. Our MFS-based methodology emphasizes that CT should work on accurate testing requirements, and has the following advantages: 1) Detect failure to the greatest degree with the least cost. 2) Effectiveness is improved by emphasizing mining of the information in software and making full use of the information gained from test design and execution. 3) Determine the root causes of failures and reveal related faults near the exposed ones. 4) Provide a foundation and model for regression testing and software quality evaluation of CT. A case study is presented to illustrate the MFS-based CT methodology, and an empirical study on a real software developed by us shows that the MFS really exists and the methodology based on MFS can considerably improve CT.

show abstract

Section: Related Worksupporting

confidence: 75%

The Minimal Failure-Causing Schema of Combinatorial Testing

Nie

Leung

2011

ACM Trans. Softw. Eng. Methodol.

View full text Add to dashboard Cite

show abstract

Enumerating Motzkin–Rabin geometries

Wamelen

2006

J of Combinatorial Designs

View full text Add to dashboard Cite

Abstract:The main result of this paper is an enumeration of all Motzkin-Rabin geometries on up to 18 points. A Motzkin-Rabin geometry is a two-colored linear space with no monochromatic line. We also study the embeddings of Motzkin-Robin geometries into projective spaces over fields and division rings. We find no Motzkin-Rabin geometries on up to 18 points embeddable in C 2 or F 2 (t) 2 . We find many examples of Motzkin-Rabin geometries with no proper linear subspaces. We give an example of a proper linear space embeddable in P(Q( √ −7) 2 ).

show abstract