faulty interaction identification via constraint solving and optimization

ISCAS OpenIR

	faulty interaction identification via constraint solving and optimization
	Zhang Jian; Ma Feifei; Zhang Zhiqiang
	2012
会议名称	15th International Conference on Theory and Applications of Satisfiability Testing, SAT 2012
会议录名称	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
页码	186-199
会议日期	June 17, 2012 - June 20, 2012
会议地点	Trento, Italy
收录类别	EI
ISSN	0302-9743
ISBN	9783642316111
部门归属	(1) State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China
摘要	Combinatorial testing (CT) is an important black-box testing method. In CT, the behavior of the system under test (SUT) is affected by several parameters/components. Then CT generates a combinatorial test suite. After the user executes a test suite and starts debugging, some test cases fail and some pass. From the perspective of a black box, the failures are caused by interaction of several parameters. It will be helpful if we can identify a small set of interacting parameters that caused the failures. This paper proposes a new automatic approach to identifying faulty interactions. It uses (pseudo-Boolean) constraint solving and optimization techniques to analyze the execution results of the combinatorial test suite. Experimental results show that the method is quite efficient and it can find faulty combinatorial interactions quickly. They also shed some light on the relation between the size of test suite and the ability of fault localization. © 2012 Springer-Verlag.; Combinatorial testing (CT) is an important black-box testing method. In CT, the behavior of the system under test (SUT) is affected by several parameters/components. Then CT generates a combinatorial test suite. After the user executes a test suite and starts debugging, some test cases fail and some pass. From the perspective of a black box, the failures are caused by interaction of several parameters. It will be helpful if we can identify a small set of interacting parameters that caused the failures. This paper proposes a new automatic approach to identifying faulty interactions. It uses (pseudo-Boolean) constraint solving and optimization techniques to analyze the execution results of the combinatorial test suite. Experimental results show that the method is quite efficient and it can find faulty combinatorial interactions quickly. They also shed some light on the relation between the size of test suite and the ability of fault localization. © 2012 Springer-Verlag.
关键词	Formal Logic Optimization
主办者	IBM Research; Intel Corporation; Jasper Technologies; Microsoft Research INRIA; Microsoft Research; NEC
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/15773
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Zhang Jian,Ma Feifei,Zhang Zhiqiang. faulty interaction identification via constraint solving and optimization[C],2012:186-199.