NobleBlocks
Public

Minimum Pairwise Coverage Using Constraint Programming Techniques

Published • Apr 1, 2012
NobleIDNI4P08W06R02S81
Authors:
Arnaud Gotlieb
,
Aymeric Hervieu
,
Benoît Baudry

Abstract

This paper presented the global constraint pairwise that can be used to enforce the presence of a given pair within a set of test cases or configurations. It also introduced several optimizations for implementing a method that computes the minimum set of test cases that covers pairwise. In addition,...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!