Pairwise Testing

Andreas Blass, Yuri Gurevich

Bulletin of the European Association for Theoretical Computer Science |

We discuss the following problem, which arises in software testing. Given some independent parameters (of a program to be tested), each having a certain finite set of possible values, we intend to test the program by running it several times. For each test, we give the parameters some (intelligently chosen) values. We want to ensure that for each pair of distinct parameters, every pair of possible values is used in at least one of the tests. And we want to do this with as few tests as possible.

This publication was also reprinted in 2004 World Scientific book, Current Trends in Theoretical Computer Science, pages 237-266