Locating Minimal Fault Interaction in Combinatorial Testing

Table 4

The step of computing canFIS.

Step #	canFIS		= addTF()		Delete from canFIS
)		1	(0, 0, 0, 1)	Fail	8
()		2	(0, 0, 1, 0)	Pass	2, 6
()		3	(0, 1, 0, 0)	Fail
()		4	(1, 0, 0, 0)	Pass	4, 7
()		5	(0, 1, 0, 1)	Fail	1, 3, 9, 10, 12, 17, 18
()	5, 11, 13, 14, 15, 16, 19, 20, 21, 22, 23	11	(1, 1, 0, 1)	Pass	11
()	5, 13, 14, 15, 16, 19, 20, 21, 22, 23	13	(1, 1, 0, 2)	Pass	13
()	5, 14, 15, 16, 19, 20, 21, 22, 23	14	(1, 1, 1, 2)	Pass	14
()	5, 15, 16, 19, 20, 21, 22, 23	15	(1, 1, 0, 2)	Pass	15
()	5, 16, 19, 20, 21, 22, 23	16	(0, 1, 1, 2)	Pass	16
()	5, 19, 20, 21, 22, 23	19	(1, 1, 2, 3)	Pass	19
()	5, 20, 21, 22, 23	20	(0, 1, 1, 3)	Fail	23
()	5, 20, 21, 22	21	(1, 1, 2, 3)	Pass	21
()	5, 20, 22	22	(1, 1, 0, 3)	Pass	22
()	5, 20	—	—	—	—
()	,	—	—	—	—